LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS

2016 ◽  
Vol 81 (2) ◽  
pp. 463-482 ◽  
Author(s):  
EKATERINA FOKINA ◽  
BAKHADYR KHOUSSAINOV ◽  
PAVEL SEMUKHIN ◽  
DANIEL TURETSKY
Keyword(s):  
Ordered Set ◽  
Equivalence Relations ◽  
Ordered Sets ◽  
Linear Orders ◽  
Algebraic Properties ◽  
Image Position ◽  
Quotient Set ◽  
The Relationship ◽  
Induced Structure ◽  
Linearly Ordered Set

AbstractLetEbe a computably enumerable (c.e.) equivalence relation on the setωof natural numbers. We say that the quotient set$\omega /E$(or equivalently, the relationE)realizesa linearly ordered set${\cal L}$if there exists a c.e. relation ⊴ respectingEsuch that the induced structure ($\omega /E$; ⊴) is isomorphic to${\cal L}$. Thus, one can consider the class of all linearly ordered sets that are realized by$\omega /E$; formally,${\cal K}\left( E \right) = \left\{ {{\cal L}\,|\,{\rm{the}}\,{\rm{order}}\, - \,{\rm{type}}\,{\cal L}\,{\rm{is}}\,{\rm{realized}}\,{\rm{by}}\,E} \right\}$. In this paper we study the relationship between computability-theoretic properties ofEand algebraic properties of linearly ordered sets realized byE. One can also define the following pre-order$ \le _{lo} $on the class of all c.e. equivalence relations:$E_1 \le _{lo} E_2 $if every linear order realized byE1is also realized byE2. Following the tradition of computability theory, thelo-degrees are the classes of equivalence relations induced by the pre-order$ \le _{lo} $. We study the partially ordered set oflo-degrees. For instance, we construct various chains and anti-chains and show the existence of a maximal element among thelo-degrees.

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.

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.

The 3-Irreducible Partially Ordered Sets

1977 ◽  
Vol 29 (2) ◽  
pp. 367-383 ◽  
Author(s):  
David Kelly
Keyword(s):  
Positive Integer ◽  
Finite Dimension ◽  
Ordered Set ◽  
Partially Ordered Sets ◽  
Partial Ordering ◽  
Ordered Sets ◽  
Linear Orders ◽  
Compactness Property ◽  
Partially Ordered ◽  
Minimum Number

The dimension [4] of a partially ordered set (poset) is the minimum number of linear orders whose intersection is the partial ordering of the poset. For a positive integer m, a poset is m-irreducible[10] if it has dimension m and removal of any element lowers its dimension. By the compactness property of finite dimension, every m-irreducible poset is finite and every poset of dimension ≧ m contains an m-irreducible subposet.

scholarly journals Groups of automorphisms of linearly ordered sets

1976 ◽  
Vol 15 (1) ◽  
pp. 13-32 ◽  
Author(s):  
J.L. Hickman
Keyword(s):  
Simple Group ◽  
Direct Product ◽  
Cyclic Group ◽  
Ordered Set ◽  
Embedding Theorems ◽  
Ordered Sets ◽  
Infinite Cyclic Group ◽  
Groups Of Automorphisms ◽  
Linearly Ordered Set

I show that a group of order-automorphisms of a linearly ordered set can be expressed as an unrestricted direct product in which each factor is either the infinite cyclic group or else a group of order-automorphisms of a densely ordered set. From this a couple of simple group embedding theorems can be derived. The technique used to obtain the main result of this paper was motivated by the Erdös-Hajnal inductive classification of scattered sets.

scholarly journals A Theorem on Partially Ordered Sets and its Application

1969 ◽  
Vol 9 (3-4) ◽  
pp. 361-362
Author(s):  
Vladimir Devidé
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Maximal Elements ◽  
Partially Ordered ◽  
Image Position

Let (S, ≦) be a (non-void) partially ordered set with the property that for every (non-void) chain C (i.e., every totally ordered subset) of S, there exists in S the element sup C. Let SM be the set of all maximal elements s of S. ƒ:S/SM→S be a slowly increasing mapping in the sense that

ON RAMSEY’S THEOREM AND THE EXISTENCE OF INFINITE CHAINS OR INFINITE ANTI-CHAINS IN INFINITE POSETS

2016 ◽  
Vol 81 (1) ◽  
pp. 384-394 ◽  
Author(s):  
ELEFTHERIOS TACHTSIS
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered Sets ◽  
Infinite Chain ◽  
Ordered Sets ◽  
Ramsey's Theorem ◽  
Partially Ordered ◽  
Ramsey’S Theorem ◽  
Image Position ◽  
The Axiom Of Choice

AbstractRamsey’s Theorem is naturally connected to the statement “every infinite partially ordered set has either an infinite chain or an infinite anti-chain”. Indeed, it is a well-known result that Ramsey’s Theorem implies the latter principle.In the book “Consequences of the Axiom of Choice” by P. Howard and J. E. Rubin, it is stated as unknown whether the above implication is reversible, that is whether the principle “every infinite partially ordered set has either an infinite chain or an infinite anti-chain” implies Ramsey’s Theorem. The purpose of this paper is to settle the aforementioned open problem. In particular, we construct a suitable Fraenkel–Mostowski permutation model ${\cal N}$ for ZFA and prove that the above principle for infinite partially ordered sets is true in ${\cal N}$, whereas Ramsey’s Theorem is false in ${\cal N}$. Then, based on the existence of ${\cal N}$ and on results of D. Pincus, we show that there is a model of ZF which satisfies “every infinite partially ordered set has either an infinite chain or an infinite anti-chain” and the negation of Ramsey’s Theorem.In addition, we prove that Ramsey’s Theorem (hence, the above principle for infinite partially ordered sets) is true in Mostowski’s linearly ordered model, filling the gap of information in the book “Consequences of the Axiom of Choice”.

scholarly journals On the endomorphism semigroup of an ordered set

1995 ◽  
Vol 37 (2) ◽  
pp. 173-178 ◽  
Author(s):  
T. S. Blyth
Keyword(s):  
Maximal Element ◽  
Ordered Set ◽  
Minimal Element ◽  
Hasse Diagram ◽  
Endomorphism Semigroup ◽  
Ordered Sets ◽  
Maximal Elements ◽  
Minimal Elements ◽  
Image Position

M. E. Adams and Matthew Gould [1] have obtained a remarkable classification of ordered sets P for which the monoid End P of endomorphisms (i.e. isotone maps) is regular, in the sense that for every f є End P there exists g є End P such that fgf = f. They show that the class of such ordered sets consists precisely of(a) all antichains;(b) all quasi-complete chains;(c) all complete bipartite ordered sets (i.e. given non-zero cardinals α β an ordered set Kα,β of height 1 having α minimal elements and β maximal elements, every minimal element being less than every maximal element);(d) for a non-zero cardinal α the lattice Mα consisting of a smallest element 0, a biggest element 1, and α atoms;(e) for non-zero cardinals α, β the ordered set Nα,β of height 1 having α minimal elements and β maximal elements in which there is a unique minimal element α0 below all maximal elements and a unique maximal element β0 above all minimal elements (and no further ordering);(f) the six-element crown C6 with Hasse diagramA similar characterisation, which coincides with the above for sets of height at most 2 but differs for chains, was obtained by A. Ya. Aizenshtat [2].

scholarly journals Slaves to Rome: The Rhetoric of Mastery in Titus' Speech to the Jews (Bellum Judaicum 6.328-50)

Ramus ◽  
2007 ◽  
Vol 36 (1) ◽  
pp. 25-38 ◽  
Author(s):  
Myles Lavan
Keyword(s):  
Historical Account ◽  
Self Presentation ◽  
Image Position ◽  
Relationship Of ◽  
The Relationship ◽  
Made In

(BJ6.350)Those who discard their weapons and surrender their persons, I will let live. Like a lenient master in a household, I will punish the incorrigible but preserve the rest for myself.So ends Titus' address to the embattled defenders of Jerusalem in the sixth book of Josephus'Jewish War(6.328-50). It is the most substantial instance of communication between Romans and Jews in the work. Titus compares himself to the master of a household and the Jewish rebels to his slaves. Is this how we expect a Roman to describe empire? If not, what does it mean for our understanding of the politics of Josephus' history? The question is particularly acute given that this is not just any Roman but Titus himself: heir apparent and, if we believe Josephus, the man who read and approved this historical account. It is thus surprising that, while the speeches of Jewish advocates of submission to Rome such as Agrippa II (2.345-401) and Josephus himself (5.362-419) have long fascinated readers, Titus' speech has received little or no attention. Remarkably, it is not mentioned in any of three recent collections of essays on Josephus. This paper aims to highlight the rhetorical choices that Josephus has made in constructing this voice for Titus—particularly his self-presentation as master—and the interpretive questions these raise for his readers. It should go without saying that the relationship of this text to anything that Titus may have said during the siege is highly problematic. (Potentially more significant, but unfortunately no less speculative, is the question of how it might relate to any speech recorded in the commentaries of Vespasian and Titus that Josephus appears to have used as a source.) What we have is a Josephan composition that is embedded in the broader narrative of theJewish War.

A note on the relationship between live weight and the incidence of oestrus in Hereford heifers

1980 ◽  
Vol 31 (2) ◽  
pp. 221-222 ◽  
Author(s):  
R. D. H. Cohen ◽  
D. L. Garden ◽  
J. P. Langlands
Keyword(s):  
Live Weight ◽  
Weight Range ◽  
Image Position ◽  
The Relationship

ABSTRACTThe incidence of oestrus in 603 Hereford heifers with a mean age of 545 days (range 515 to 575) was related to live weight (range 130 to 376 kg). Observations were ranked in order of ascending live weight and the percentage of heifers showing oestrus was calculated for consecutive 10 kg increments in live weight from 130 to 380 kg. The percentage showing oestrus was subjected to the probit transformation (Y, probit units) and was then related to live weight (X, kg):It was predicted that 50% of the heifers showed oestrus at 231 ± 1 kg, and that 5% and 95% showed oestrus at 187 and 280 kg respectively.

Sign in / Sign up

Export Citation Format

Share Document