Decomposition of supermartingales indexed by a linearly ordered set

2007 ◽  
Vol 77 (8) ◽  
pp. 795-802 ◽  
Author(s):  
Gianluca Cassese
Keyword(s):  
Ordered Set ◽  
Linearly Ordered Set

Shuffling of Linear Orders

1995 ◽  
Vol 38 (2) ◽  
pp. 223-229
Author(s):  
John Lindsay Orr
Keyword(s):  
Ordered Set ◽  
Linear Orders ◽  
Real Numbers ◽  
The Real ◽  
Linearly Ordered Set

AbstractA linearly ordered set A is said to shuffle into another linearly ordered set B if there is an order preserving surjection A —> B such that the preimage of each member of a cofinite subset of B has an arbitrary pre-defined finite cardinality. We show that every countable linearly ordered set shuffles into itself. This leads to consequences on transformations of subsets of the real numbers by order preserving maps.

A Note on a Fully Ordered Ring

1967 ◽  
Vol 10 (5) ◽  
pp. 757-758 ◽  
Author(s):  
Kwangil Koh
Keyword(s):  
Associative Ring ◽  
Ordered Set ◽  
Additive Subgroup ◽  
Ordered Ring ◽  
Linearly Ordered Set

A ring R (associative ring) is said to be fully ordered provided that R is a linearly ordered set under a relation such that for any a, b and c in R, implies that and if c ε 0 then and . We say a subset K of R is convex provided that if a, b ε K such that then the interval [a, b] is a subset of K. Obviously an additive subgroup K of R is convex if and only if b ε K and b > 0 implies [a, b] ⊆ K.

MULTIPLE TRANSITIVITY AND MIN-WISE INDEPENDENCE IN PERMUTATION GROUPS

2004 ◽  
Vol 03 (04) ◽  
pp. 427-435
Author(s):  
C. FRANCHI
Keyword(s):  
Positive Integer ◽  
Permutation Group ◽  
Ordered Set ◽  
Permutation Groups ◽  
Linearly Ordered Set

Let Ω be a finite linearly ordered set and let k be a positive integer. A permutation group G on Ω is called co-k-restricted min-wise independent on Ω if [Formula: see text] for any X⊆Ω such that |X|≥|Ω|-k+1 and for any x∈X. We show that co-k-restricted min-wise independent groups are exactly the groups with the property that for each subset X⊆Ω with |X|≤k-1, the stabilizer G{X} of X in G is transitive on Ω\X. Using this fact, we determine all co-k-restricted min-wise independent groups.

Interval covers of a linearly ordered set

1996 ◽  
pp. 1-13
Author(s):  
R. Aharoni ◽  
A. Hajnal ◽  
E. C. Milner
Keyword(s):  
Ordered Set ◽  
Linearly Ordered Set

On a theorem of Fleischer

1986 ◽  
Vol 40 (2) ◽  
pp. 261-266 ◽  
Author(s):  
G. Mehta
Keyword(s):  
Ordered Set ◽  
Separation Theorem ◽  
Order Topology ◽  
Topological Spaces ◽  
Real Numbers ◽  
The Real ◽  
Linearly Ordered Set

AbstractFleischer proved that a linearly ordered set that is separable in its order topology and has countably many jumps is order-isomorphic to a subset of the real numbers. The object of this paper is to extend Fleischer's result and to prove it in a different way. The proof of the theorem is based on Nachbin's extension to ordered topological spaces of Urysohn's separation theorem in normal topological spaces.

An open mapping theorem for o-minimal structures

2001 ◽  
Vol 66 (4) ◽  
pp. 1817-1820 ◽  
Author(s):  
Joseph Johns
Keyword(s):  
Elementary Proof ◽  
Ordered Set ◽  
Cartesian Product ◽  
Closed Field ◽  
Product Topology ◽  
Open Mapping Theorem ◽  
Open Set ◽  
Minimal Structure ◽  
Background Material ◽  
Linearly Ordered Set

We fix an arbitrary o-minimal structure (R, ω, …), where (R, <) is a dense linearly ordered set without end points. In this paper “definable” means “definable with parameters from R”, We equip R with the interval topology and Rn with the induced product topology. The main result of this paper is the following.Theorem. Let V ⊆ Rnbe a definable open set and suppose that f: V → Rnis a continuous injective definable map. Then f is open, that is, f(U) is open whenever U is an open subset of V.Woerheide [6] proved the above theorem for o-minimal expansions of a real closed field using ideas of homology. The case of an arbitrary o-minimal structure remained an open problem, see [4] and [1]. In this paper we will give an elementary proof of the general case.Basic definitions and notation. A box B ⊆ Rn is a Cartesian product of n definable open intervals: B = (a1, b1) × … × (an, bn) for some ai, bi, ∈ R ∪ {−∞, +∞}, with ai < bi, Given A ⊆ Rn, cl(A) denotes the closure of A, int(A) denotes the interior of A, bd(A) ≔ cl(A) − int(A) denotes the boundary of A, and ∂A ≔ cl(A) − A denotes the frontier of A, Finally, we let π: Rn → Rn− denote the projection map onto the first n − 1 coordinates.Background material. Without mention we will use notions and facts discussed in [5] and [3]. We will also make use of the following result, which appears in [2].

The Fuzzy Description Logic ALCFH with Hedge Algebras as Concept Modifiers

2003 ◽  
Vol 7 (3) ◽  
pp. 294-305 ◽  
Author(s):  
Steffen Hölldobler ◽  
◽  
Hans-Peter Störr ◽  
Tran Dinh Khang ◽  
Keyword(s):  
Knowledge Base ◽  
Decision Procedure ◽  
Description Logic ◽  
Ordered Set ◽  
Fuzzy Description ◽  
Linearly Ordered Set

In this paper we present the fuzzy description logic ALCFH introduced, where primitive concepts are modified by means of hedges taken from hedge algebras. ALCFH is strictly more expressive than Fuzzy-ALC defined in [11]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedges. Furthermore, we define a decision procedure for the unsatisfiability problem in ALCFH, and discuss knowledge base expansion when using terminologies, truth bounds, expressivity as well as complexity issues. We extend [8] by allowing modifiers on non-primitive concepts and extending the satisfiability procedure to handle concept definitions.

Automorphism groups of models of Peano arithmetic

2002 ◽  
Vol 67 (4) ◽  
pp. 1249-1264 ◽  
Author(s):  
James H. Schmerl
Keyword(s):  
Topological Group ◽  
Automorphism Group ◽  
Closed Subgroup ◽  
Automorphism Groups ◽  
Ordered Set ◽  
Peano Arithmetic ◽  
Ordered Sets ◽  
Torsion Free ◽  
Linearly Ordered Set

Which groups are isomorphic to automorphism groups of models of Peano Arithmetic? It will be shown here that any group that has half a chance of being isomorphic to the automorphism group of some model of Peano Arithmetic actually is.For any structure , let Aut() be its automorphism group. There are groups which are not isomorphic to any model = (N, +, ·, 0, 1, ≤) of PA. For example, it is clear that Aut(N), being a subgroup of Aut((, <)), must be torsion-free. However, as will be proved in this paper, if (A, <) is a linearly ordered set and G is a subgroup of Aut((A, <)), then there are models of PA such that Aut() ≅ G.If is a structure, then its automorphism group can be considered as a topological group by letting the stabilizers of finite subsets of A be the basic open subgroups. If ′ is an expansion of , then Aut(′) is a closed subgroup of Aut(). Conversely, for any closed subgroup G ≤ Aut() there is an expansion ′ of such that Aut(′) = G. Thus, if is a model of PA, then Aut() is not only a subgroup of Aut((N, <)), but it is even a closed subgroup of Aut((N, ′)).There is a characterization, due to Cohn [2] and to Conrad [3], of those groups G which are isomorphic to closed subgroups of automorphism groups of linearly ordered sets.

ON THE SET-THEORETIC STRENGTH OF ELLIS’ THEOREM AND THE EXISTENCE OF FREE IDEMPOTENT ULTRAFILTERS ON ω

2018 ◽  
Vol 83 (2) ◽  
pp. 551-571
Author(s):  
ELEFTHERIOS TACHTSIS
Keyword(s):  
Prime Ideal ◽  
Ordered Set ◽  
Idempotent Element ◽  
Abelian Semigroup ◽  
Free Ultrafilter ◽  
Image Position ◽  
Idempotent Ultrafilter ◽  
Right Topological Semigroup ◽  
Linearly Ordered Set ◽  
Prime Ideal Theorem

AbstractEllis’ Theorem (i.e., “every compact Hausdorff right topological semigroup has an idempotent element”) is known to be proved only under the assumption of the full Axiom of Choice (AC); AC is used in the proof in the disguise of Zorn’s Lemma.In this article, we prove that in ZF, Ellis’ Theorem follows from the Boolean Prime Ideal Theorem (BPI), and hence is strictly weaker than AC in ZF. In fact, we establish that BPI implies the formally stronger (than Ellis’ Theorem) statement “for every family ${\cal A} = \{ ({S_i},{ \cdot _i},{{\cal T}_i}):i \in I\}$ of nontrivial compact Hausdorff right topological semigroups, there exists a function f with domain I such that $f\left( i \right)$ is an idempotent of ${S_i}$, for all $i \in I$”, which in turn implies ACfin (i.e., AC for sets of nonempty finite sets).Furthermore, we prove that in ZFA, the Axiom of Multiple Choice (MC) implies Ellis’ Theorem for abelian semigroups (i.e., “every compact Hausdorff right topological abelian semigroup has an idempotent element”) and that the strictly weaker than MC (in ZFA) principle LW (i.e., “every linearly ordered set can be well-ordered”) implies Ellis’ Theorem for linearly orderable semigroups (i.e., “every compact Hausdorff right topological linearly orderable semigroup has an idempotent element”); thus the latter formally weaker versions of Ellis’ Theorem are strictly weaker than BPI in ZFA. Yet, it is shown that no choice is required in order to prove Ellis’ Theorem for well-orderable semigroups.We also show that each one of the (strictly weaker than AC) statements “the Tychonoff product $2^{\Cal R} $ is compact and Loeb” and $BPI_{\Cal R}$ (BPI for filters on ${\Cal R}$) implies “there exists a free idempotent ultrafilter on ω” (which in turn is not provable in ZF). Moreover, we prove that the latter statement does not imply $BP{I_\omega }$ (BPI for filters on ω) in ZF, hence it does not imply any of $AC_{\Cal R} $ (AC for sets of nonempty sets of reals) and $BPI_{\Cal R} $ in ZF, either.In addition, we prove that the statements “there exists a free ultrafilter on ω”, “there exists a free ultrafilter on ω which is not idempotent”, and “for every IP set $A \subseteq \omega$, there exists a free ultrafilter ${\cal F}$ on ω such that $A \in {\cal F}$” are pairwise equivalent in ZF.

A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings

1984 ◽  
Vol 49 (2) ◽  
pp. 563-569 ◽  
Author(s):  
Richard Watnick
Keyword(s):  
Ordered Set ◽  
Order Type ◽  
Test Case ◽  
Linear Orderings ◽  
Order Types ◽  
Concrete Model ◽  
Linearly Ordered Set ◽  
Effective Translation ◽  
Recursive Set

An effective translation of the fact that any infinite ordered set contains an infinite ascending or descending sequence is that any infinite recursive set A ⊆ Q has a recursive subset with order type ω or ω*. Tennenbaum's theorem states that this translation is false, and there is a counterexample A with order type ω + ω*. Tennenbaum suggested that this counterexample is an infinite recursive linearly ordered set which is effectively finite, and that the collection of all such counterexamples could provide a concrete model of nonstandard arithmetic. The purpose of this paper is to determine the collection of order types for which there is a counterexample.It is readily seen that any counterexample to the effective translation must have order type ω + Z · α + ω* for some α [2], [3]. Let be the collection of order types α for which there is a counterexample. As a test case, we have previously shown that contains the constructive scattered orderings [3], [4]. In this paper we determine exactly which order types are in . We easily show that if ω+ Z · α + ω* is recursive, then α is . The main result is that . Consequently, .

Sign in / Sign up

Export Citation Format

Share Document