On Ehrenfeucht-Fraïssé equivalence of linear orderings

1990 ◽  
Vol 55 (1) ◽  
pp. 65-73 ◽  
Author(s):  
Juha Oikkonen
Keyword(s):  
Binary Relation ◽  
Linear Ordering ◽  
Relation Symbol ◽  
Linear Orderings ◽  
Binary Relation Symbol

AbstractC. Karp has shown that if α is an ordinal with ωα = α and A is a linear ordering with a smallest element, then α and α ⊗ A are equivalent in L∞ω up to quantifer rank α. This result can be expressed in terms of Ehrenfeucht-Fraïssé games where player ∀ has to make additional moves by choosing elements of a descending sequence in α. Our aim in this paper is to prove a similar result for Ehrenfeucht-Fraïssé games of length ω1. One implication of such a result will be that a certain infinite quantifier language cannot say that a linear ordering has no descending ω1-sequences (when the alphabet contains only one binary relation symbol). Connected work is done by Hyttinen and Oikkonen in [H] and [O].

A note on countable complete theories having three isomorphism types of countable models

1976 ◽  
Vol 41 (3) ◽  
pp. 672-680 ◽  
Author(s):  
Robert E. Woodrow
Keyword(s):  
Binary Relation ◽  
Quantifier Elimination ◽  
Relation Symbol ◽  
Complete Theories ◽  
Binary Relation Symbol ◽  
Countable Models

AbstractWith quantifier elimination and restriction of language to a binary relation symbol and constant symbols it is shown that countable complete theories having three isomorphism types of countable models are “essentially” the Ehrenfeucht example [4, §6].

scholarly journals Completeness of two theories on ordered abelian groups and embedding relations

1980 ◽  
Vol 77 ◽  
pp. 33-39 ◽  
Author(s):  
Yuichi Komori
Keyword(s):  
Binary Relation ◽  
Abelian Groups ◽  
Function Symbol ◽  
Binary Function ◽  
Relation Symbol ◽  
Unary Function ◽  
First Order ◽  
Order Language ◽  
Unary Relation ◽  
Binary Relation Symbol

The first order language ℒ that we consider has two nullary function symbols 0, 1, a unary function symbol –, a binary function symbol +, a unary relation symbol 0 <, and the binary relation symbol = (equality). Let ℒ′ be the language obtained from ℒ, by adding, for each integer n > 0, the unary relation symbol n| (read “n divides”).

Definability of models by means of existential formulas without identity

1993 ◽  
Vol 58 (2) ◽  
pp. 424-434 ◽  
Author(s):  
Paweł Pazdyka
Keyword(s):  
Binary Relation ◽  
Weak Point ◽  
Relation Symbol ◽  
Infinite Case ◽  
Binary Relation Symbol ◽  
Mathematical Literature ◽  
The Universe ◽  
Elementary Theories

The problem of coding relations by means of a single binary relation is well known in the mathematical literature. It was considered in interpretation theory, and also in connection with investigations of decidability of elementary theories. Using various constructions (see, e.g., [2,6], proofs of Theorem 11 in [7] and Theorem 16.51 in [3]), for any model for a countable language, one can construct a model for ℒp (a language with a single binary relation symbol ) in which is interpretable. Each of the mentioned constructions has the same weak point: the universe of is different than the universe of . In [4] we have shown that, in the infinite case, one can eliminate this defect, i.e., for any infinite , we have constructed a model , having the same universe as , in which is elementarily definable. In all constructions mentioned above, it appears that formulas, which define in ( in ), are very complicated. In the present paper, another construction of a model for ℒp is given.

A Model of the Real Numbers

1963 ◽  
Vol 6 (2) ◽  
pp. 239-255
Author(s):  
Stanton M. Trott
Keyword(s):  
Irrational Number ◽  
Additive Group ◽  
Linear Ordering ◽  
Real Numbers ◽  
Ordered Group ◽  
The Real ◽  
Linear Orderings ◽  
Positive Elements ◽  
The Law ◽  
Ordered Pairs

The model of the real numbers described below was suggested by the fact that each irrational number ρ determines a linear ordering of J2, the additive group of ordered pairs of integers. To obtain the ordering, we define (m, n) ≤ (m', n') to mean that (m'- m)ρ ≤ n' - n. This order is invariant with group translations, and hence is called a "group linear ordering". It is completely determined by the set of its "positive" elements, in this case, by the set of integer pairs (m, n) such that (0, 0) ≤ (m, n), or, equivalently, mρ < n. The law of trichotomy for linear orderings dictates that only the zero of an ordered group can be both positive and negative.

Uniformly defined descending sequences of degrees

1976 ◽  
Vol 41 (2) ◽  
pp. 363-367 ◽  
Author(s):  
Harvey Friedman
Keyword(s):  
Unique Solution ◽  
Set Theory ◽  
Limit Point ◽  
Infinite Sequence ◽  
Linear Ordering ◽  
Natural Numbers ◽  
Linear Orderings ◽  
Nonstandard Models ◽  
Related Paper ◽  
Models Of Set Theory

This paper answers some questions which naturally arise from the Spector-Gandy proof of their theorem that the π11 sets of natural numbers are precisely those which are defined by a Σ11 formula over the hyperarithmetic sets. Their proof used hierarchies on recursive linear orderings (H-sets) which are not well orderings. (In this respect they anticipated the study of nonstandard models of set theory.) The proof hinged on the following fact. Let e be a recursive linear ordering. Then e is a well ordering if and only if there is an H-set on e which is hyperarithmetic. It was implicit in their proof that there are recursive linear orderings which are not well orderings, on which there are H-sets. Further information on such nonstandard H-sets (often called pseudohierarchies) can be found in Harrison [4]. It is natural to ask: on which recursive linear orderings are there H-sets?In Friedman [1] it is shown that there exists a recursive linear ordering e that has no hyperarithmetic descending sequences such that no H-set can be placed on e. In [1] it is also shown that if e is a recursive linear ordering, every point of which has an immediate successor and either has finitely many predecessors or is finitely above a limit point (heretofore called adequate) such that an H-set can be placed on e, then e has no hyperarithmetic descending sequences. In a related paper, Friedman [2] shows that there is no infinite sequence xn of codes for ω-models of the arithmetic comprehension axiom scheme such that each xn+ 1 is a set in the ω-model coded by xn, and each xn+1 is the unique solution of P(xn, xn+1) for some fixed arithmetic P.

An elementary sentence which has ordered models

1972 ◽  
Vol 37 (3) ◽  
pp. 521-530 ◽  
Author(s):  
James H. Schmerl
Keyword(s):  
Binary Relation ◽  
Initial Segment ◽  
Linear Ordering ◽  
Infinite Cardinal ◽  
Generalized Quantifiers

Let < and ≼ be two distinguished binary relation symbols. A structure is κ-like iff is a linear ordering of A, card(A) = κ, and every proper initial segment of A has cardinality < κ. A structure is α-ordered iff is a (reflexive) linear ordering of type α with field a subset of A. We define when a cardinal κ is α-inaccessible. (In this paper, inaccessible always means weakly inaccessible.) The 0-inaccessible cardinals are just the inaccessible cardinals; if α > 0, then κ is α-inaccessible iff for each β < α, each closed, cofinal subset of κ contains a β-inaccessible. (The (1 + α)-inaccessibles are just the ρα cardinals of Mahlo.) This paper is concerned with the proof of the following theorem.Main Theorem. There is an elementary sentence σ with the property that whenever α is an ordinal and κ an infinite cardinal, then σ has an α-ordered κ-like model iff κ is not α-inaccessible.This theorem gives some additional answers to a question of Mostowski about languages with generalized quantifiers. Fuhrken [1] showed that this question is equivalent to the following one: For which cardinals κ and λ is it true that if an elementary sentence has a κ-like model, then it has a λ-like model? It is actually this question to which the theorem refers. The theorem limits the possible pairs κ, λ of cardinals which answer the question. In fact, if the question is generalized so as to permit sentences from some more extensive language, then the theorem still limits the possible answers. For a more thorough introduction to this problem, the reader is referred to the aforementioned article of Fuhrken as well as Keisler [2] and Vaught [6].

On the Equimorphism Types of Linear Orderings

2007 ◽  
Vol 13 (1) ◽  
pp. 71-99 ◽  
Author(s):  
Antonio Montalbán
Keyword(s):  
Equivalence Relation ◽  
Reverse Mathematics ◽  
Computability Theory ◽  
Equivalence Classes ◽  
Linear Ordering ◽  
Partially Ordered ◽  
Linear Orderings ◽  
Definition Of

§1. Introduction. A linear ordering (also known astotal ordering) embedsinto another linear ordering if it is isomorphic to a subset of it. Two linear orderings are said to beequimorphicif they can be embedded in each other. This is an equivalence relation, and we call the equivalence classesequimorphism types. We analyze the structure of equimorphism types of linear orderings, which is partially ordered by the embeddability relation. Our analysis is mainly fromthe viewpoints of Computability Theory and Reverse Mathematics. But we also obtain results, as the definition of equimorphism invariants for linear orderings, which provide a better understanding of the shape of this structure in general.This study of linear orderings started by analyzing the proof-theoretic strength of a theorem due to Jullien [Jul69]. As is often the case in Reverse Mathematics, to solve this problem it was necessary to develop a deeper understanding of the objects involved. This led to a variety of results on the structure of linear orderings and the embeddability relation on them. These results can be divided into three groups.

scholarly journals ALGEBRAIC LINEAR ORDERINGS

2011 ◽  
Vol 22 (02) ◽  
pp. 491-515 ◽  
Author(s):  
S. L. BLOOM ◽  
Z. ÉSIK
Keyword(s):  
Order Type ◽  
Linear Ordering ◽  
Type Result ◽  
First Order ◽  
Linear Orderings ◽  
Context Free Language ◽  
Categorical Algebra ◽  
Context Free ◽  
Free Language

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than ωω. It follows that the algebraic ordinals are exactly those less than ωωω.

scholarly journals Embeddability Between Orderings and GCH

2021 ◽  
Vol 56 ◽  
pp. 101-109
Author(s):  
Rodrigo A. Freire
Keyword(s):  
Structure Theorem ◽  
Linear Ordering ◽  
Linear Orderings

We provide some statements equivalent in ZFC to GCH, and also to GCH above a given cardinal. These statements express the validity of the notions of replete and well-replete car- dinals, which are introduced and proved to be specially relevant to the study of cardinal exponentiation. As a byproduct, a structure theorem for linear orderings is proved to be equivalent to GCH: for every linear ordering L, at least one of L and its converse is universal for the smaller well-orderings.

scholarly journals On computable self-embeddings of computable linear orderings

2009 ◽  
Vol 74 (4) ◽  
pp. 1352-1366 ◽  
Author(s):  
Rodney G. Downey ◽  
Bart Kastermans ◽  
Steffen Lempp
Keyword(s):  
Open Problem ◽  
Linear Ordering ◽  
Linear Orderings ◽  
Precise Characterization

AbstractWe solve a longstanding question of Rosenstein, and make progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computable η-like linear ordering without an infinite strongly η-like interval has a computable copy without nontrivial computable self-embedding.The precise characterization of those computable linear orderings which have computable copies without nontrivial computable self-embedding remains open.

Sign in / Sign up

Export Citation Format

Share Document