Generalizing special Aronszajn trees

1974 ◽  
Vol 39 (4) ◽  
pp. 732-740 ◽  
Author(s):  
James H. Schmerl
Keyword(s):  
Model Theory ◽  
Initial Segment ◽  
Order Type ◽  
Linear Ordering ◽  
Property A ◽  
Transfer Property ◽  
First Order ◽  
Partition Property ◽  
Aronszajn Trees ◽  
Transfer Properties

In this paper we define by means of a partition property a decreasing sequence N = ‹Nα: α is an ordinal› of classes of ordinals. This property is a generalization of the nonexistence of special Aronszajn trees: the successor cardinal κ+ is in N0 iff there does not exist a special Aronszajn κ+-tree.The interest in the classes Nα stems from their applicability in model theory, in particular to that aspect of model theory dealing with ordered and two-cardinal models. A model is κ-like iff < is a linear ordering of A of cardinality κ but such that every proper initial segment has cardinality < κ. is α-ordered iff ≼ is a reflexive, linear ordering of some subset of A with order type α. The sequence N can be characterized by a first-order sentence σ in the following manner: The sentence σ has a κ-like α-ordered model iff κ ∉ Nα. This characterization will allow us to translate various independence statements regarding the sequence N to statements about the independence of transfer properties. We say that the transfer property κ → λ holds iff every first-order sentence which has a κ-like model also has a λ-like model. κ ⇸ λ is the negation of κ → λ.

On order-types of models

1972 ◽  
Vol 37 (1) ◽  
pp. 69-70 ◽  
Author(s):  
Wilfrid Hodges
Keyword(s):  
Order Type ◽  
Linear Ordering ◽  
Infinite Field ◽  
Strong Limit ◽  
First Order ◽  
Order Types ◽  
Order Language ◽  
Language L ◽  
New Feature

Let T be a theory in a first-order language L. Let L have a predicate ν0 ≺ ν1 such that in every model of T, the interpretation of ≺ is a linear ordering with infinite field. The order-type of this ordering will be called the order-type of the model .Several recent theorems have the following form: if T has a model of order-type ξ then T has a model of order-type ζ (see [1]). We shall add one to the list. The new feature of our result is that the order-type ζ may be in a sense “opposite” to ξ. Silver's Theorem 2.24 of [3] is a corollary of Theorem 1 below.Theorem 1. Let κ be a strong limit number (i.e. μ < κ implies 2μ < κ). Suppose λ < κ, and suppose that for every cardinal μ < κ, T has a model with where the order-type of contains no descending well-ordered sequences of length λ. Then for every cardinal μ ≥ the cardinality ∣L∣ of the language L, T has models and such that(a) the field of is the union of ≤ ∣L∣ well-ordered (inversely well-ordered) parts;(b) .The proof is by Ehrenfeucht-Mostowski models; we presuppose [2].

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 ωωω.

Boolean-valued structures

2018 ◽  
Author(s):  
Tim Button ◽  
Sean Walsh
Keyword(s):  
Model Theory ◽  
Order Logic ◽  
First Order Logic ◽  
Inference Rules ◽  
Mathematical Concepts ◽  
Semantic Framework ◽  
First Order ◽  
Standard Models ◽  
Boolean Valued Model ◽  
Semantic Values

Chapters 6-12 are driven by questions about the ability to pin down mathematical entities and to articulate mathematical concepts. This chapter is driven by similar questions about the ability to pin down the semantic frameworks of language. It transpires that there are not just non-standard models, but non-standard ways of doing model theory itself. In more detail: whilst we normally outline a two-valued semantics which makes sentences True or False in a model, the inference rules for first-order logic are compatible with a four-valued semantics; or a semantics with countably many values; or what-have-you. The appropriate level of generality here is that of a Boolean-valued model, which we introduce. And the plurality of possible semantic values gives rise to perhaps the ‘deepest’ level of indeterminacy questions: How can humans pin down the semantic framework for their languages? We consider three different ways for inferentialists to respond to this question.

PLATELET AGGREGATION DOES NOT CONFORM TO SIMPLE PARTICLE COLLISION THEORY

1987 ◽  
Author(s):  
Moideen P Jamaluddin
Keyword(s):  
Platelet Aggregation ◽  
Rate Equation ◽  
Rate Constants ◽  
Kinetic Scheme ◽  
Order Type ◽  
Second Order ◽  
Particle Collision ◽  
Collision Theory ◽  
Rate Law ◽  
First Order

Platelet aggregation kinetics, according to the particle collision theory, generally assumed to apply, ought to conform to a second order type of rate law. But published data on the time-course of ADP-induced single platelet recruitment into aggregates were found not to do so and to lead to abnormal second order rate constants much larger than even their theoretical upper bounds. The data were, instead, found to fit a first order type of rate law rather well with rate constants in the range of 0.04 - 0.27 s-1. These results were confirmed in our laboratory employing gelfiltered calf platelets. Thus a mechanism much more complex than hithertofore recognized, is operative. The following kinetic scheme was formulated on the basis of information gleaned from the literature.where P is the nonaggregable, discoid platelet, A the agonist, P* an aggregable platelet form with membranous protrusions, and P** another aggregable platelet form with pseudopods. Taking into account the relative magnitudes of the k*s and assuming aggregation to be driven by hydrophobic interaction between complementary surfaces of P* and P** species, a rate equation was derived for aggregation. The kinetic scheme and the rate equation could account for the apparent first order rate law and other empirical observations in the literature.

scholarly journals Π10 classes and strong degree spectra of relations

2007 ◽  
Vol 72 (3) ◽  
pp. 1003-1018 ◽  
Author(s):  
John Chisholm ◽  
Jennifer Chubb ◽  
Valentina S. Harizanov ◽  
Denis R. Hirschfeldt ◽  
Carl G. Jockusch ◽  
...  
Keyword(s):  
Kolmogorov Complexity ◽  
Initial Segment ◽  
Truth Table ◽  
Linear Ordering ◽  
Computable Structures ◽  
Degree Spectra

AbstractWe study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable subsets of 2ω and Kolmogorov complexity play a major role in the proof.

Weakly atomic-compact relational structures

1971 ◽  
Vol 36 (1) ◽  
pp. 129-140 ◽  
Author(s):  
G. Fuhrken ◽  
W. Taylor
Keyword(s):  
Abelian Group ◽  
Model Theory ◽  
Compact Abelian Group ◽  
Finite Subset ◽  
Relational Structure ◽  
Similarity Type ◽  
First Order ◽  
Relational Structures ◽  
Order Language ◽  
Weakly Atomic

A relational structure is called weakly atomic-compact if and only if every set Σ of atomic formulas (taken from the first-order language of the similarity type of augmented by a possibly uncountable set of additional variables as “unknowns”) is satisfiable in whenever every finite subset of Σ is so satisfiable. This notion (as well as some related ones which will be mentioned in §4) was introduced by J. Mycielski as a generalization to model theory of I. Kaplansky's notion of an algebraically compact Abelian group (cf. [5], [7], [1], [8]).

Model Theory of Epimorphisms

1974 ◽  
Vol 17 (4) ◽  
pp. 471-477 ◽  
Author(s):  
Paul D. Bacsich
Keyword(s):  
Model Theory ◽  
Order Theory ◽  
First Order ◽  
First Order Theory

Given a first-order theory T, welet be the category of models of T and homomorphisms between them. We shall show that a morphism A→B of is an epimorphism if and only if every element of B is definable from elements of A in a certain precise manner (see Theorem 1), and from this derive the best possible Cowell- power Theorem for .

Some model theory for almost real closed fields

1996 ◽  
Vol 61 (4) ◽  
pp. 1121-1152 ◽  
Author(s):  
Françoise Delon ◽  
Rafel Farré
Keyword(s):  
Model Theory ◽  
Residue Field ◽  
Elementary Equivalence ◽  
First Order ◽  
Valuation Rings ◽  
Closed Fields ◽  
Theory Of Fields ◽  
Model Theory Of Fields ◽  
Elementary Inclusion ◽  
Henselian Valuation

AbstractWe study the model theory of fields k carrying a henselian valuation with real closed residue field. We give a criteria for elementary equivalence and elementary inclusion of such fields involving the value group of a not necessarily definable valuation. This allows us to translate theories of such fields to theories of ordered abelian groups, and we study the properties of this translation. We also characterize the first-order definable convex subgroups of a given ordered abelian group and prove that the definable real valuation rings of k are in correspondence with the definable convex subgroups of the value group of a certain real valuation of k.

scholarly journals First Order Languages: Further Syntax and Semantics

2011 ◽  
Vol 19 (3) ◽  
pp. 179-192 ◽  
Author(s):  
Marco Caminati
Keyword(s):  
Model Theory ◽  
Atomic Formula ◽  
Order Model ◽  
Logical Implication ◽  
First Order ◽  
Definition Of ◽  
Theory Interpretation

First Order Languages: Further Syntax and SemanticsThird of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a consequence, the evaluation of any w.f.f. string and the relation of logical implication are introduced. Depth of a formula. Definition of satisfaction and entailment (aka entailment or logical implication) relations, see [18] III.3.2 and III.4.1 respectively.

On the strong semantical completeness of the intuitionistic predicate calculus

1968 ◽  
Vol 33 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Richmond H. Thomason
Keyword(s):  
Model Theory ◽  
Completeness Theorem ◽  
Predicate Calculus ◽  
First Order ◽  
Semantic Tableaux ◽  
Weak Completeness ◽  
Skolem Theorem ◽  
Completeness Theorems

In Kripke [8] the first-order intuitionjstic predicate calculus (without identity) is proved semantically complete with respect to a certain model theory, in the sense that every formula of this calculus is shown to be provable if and only if it is valid. Metatheorems of this sort are frequently called weak completeness theorems—the object of the present paper is to extend Kripke's result to obtain a strong completeness theorem for the intuitionistic predicate calculus of first order; i.e., we will show that a formula A of this calculus can be deduced from a set Γ of formulas if and only if Γ implies A. In notes 3 and 5, below, we will indicate how to account for identity, as well. Our proof of the completeness theorem employs techniques adapted from Henkin [6], and makes no use of semantic tableaux; this proof will also yield a Löwenheim-Skolem theorem for the modeling.

Sign in / Sign up

Export Citation Format

Share Document