The intersection of nonstandard models of arithmetic

1972 ◽  
Vol 37 (1) ◽  
pp. 103-106 ◽  
Author(s):  
Andreas Blass

If two nonstandard models of complete arithmetic are elementarily embedded in a third, then their intersection may be considerably smaller than either of them; indeed, the intersection may be only the standard model. For example, if D and E are nonprincipal ultrafilters on ω, then the nonstandard models D-prod and E-prod (where is the standard model) have canonical elementary embeddings into D-prod (E-prod , and the intersection of their images is easily seen to be the (canonical image of the) standard model. In this paper, we shall prove that, under certain conditions, this phenomenon will not occur. Our main result (Theorem 3) is that the intersection of countably many pairwise cofinal models is itself cofinal with these models, provided that at least one of them is generated by a single element. (Precise definitions will be given below.)The theorems in this paper were first formulated in terms of ultrafilters, then rephrased (using the methods of Chapter III of [1]) as statements about ultra-powers of , and finally generalized to their present form. Since the theorems and their proofs are now entirely model-theoretic, they are presented here separately from the study of ultrafilters in which they originated. That study, including applications of the present results, will appear in [2].Let L be the first-order language whose n-place relation symbols are all the relations R ⊆; ωn and whose n-place function symbols are all the functions f: ωn → ω. Let be the standard model for L; its universe is ω and every nonlogical symbol of L denotes itself. Let be an elementary extension of . The relation (or function) denoted by R (or f) in will be called *R (or *f).

1972 ◽  
Vol 37 (3) ◽  
pp. 562-568
Author(s):  
Andreas Blass

Consider the Löwenheim-Skolem theorem in the form: If a theory in a countable first-order language has a model, then it has a countable model. As is well known, this theorem becomes false if one omits the hypothesis that the language be countable, for one then has the following trivial counterexample.Example 1. Let the language have uncountably many constants, and let the theory say that they are unequal.To motivate some of our future definitions and to introduce some notation, we present another, less trivial, counterexample.Example 2. Let L0 be the language whose n-place predicate (resp. function) symbols are all the n-place predicates (resp. functions) on the set ω of natural numbers. Let be the standard model for L0; we use the usual notation Th() for its complete theory. Add to L0 a new constant e, and add to Th() an axiom schema saying that e is infinite. By the compactness theorem, the resulting theory T has models. However, none of its models are countable. Although this fact is well known, we sketch a proof in order to refer to it later.By [5, p. 81], there is a family {Aα ∣ < α < c} of infinite subsets of ω, the intersection of any two of which is finite.


1982 ◽  
Vol 47 (2) ◽  
pp. 416-422 ◽  
Author(s):  
L. A. S. Kirby

Flipping properties were introduced in set theory by Abramson, Harrington, Kleinberg and Zwicker [1]. Here we consider them in the context of arithmetic and link them with combinatorial properties of initial segments of nonstandard models studied in [3]. As a corollary we obtain independence resutls involving flipping properties.We follow the notation of the author and Paris in [3] and [2], and assume some knowledge of [3]. M will denote a countable nonstandard model of P (Peano arithmetic) and I will be a proper initial segment of M. We denote by N the standard model or the standard part of M. X ↑ I will mean that X is unbounded in I. If X ⊆ M is coded in M and M ≺ K, let X(K) be the subset of K coded in K by the element which codes X in M. So X(K) ⋂ M = X.Recall that M ≺IK (K is an I-extension of M) if M ≺ K and for some c∈K,In [3] regular and strong initial segments are defined, and among other things it is shown that I is regular if and only if there exists an I-extension of M.


2017 ◽  
Vol 82 (1) ◽  
pp. 292-302 ◽  
Author(s):  
MAKOTO KIKUCHI ◽  
TAISHI KURAHASHI

AbstractGödel introduced the original provability predicate in the proofs of Gödel’s incompleteness theorems, and Rosser defined a new one. They are equivalent in the standard model ${\mathbb N}$ of arithmetic or any nonstandard model of ${\rm PA} + {\rm Con_{PA}} $, but the behavior of Rosser’s provability predicate is different from the original one in nonstandard models of ${\rm PA} + \neg {\rm Con_{PA}} $. In this paper, we investigate several properties of the derivability conditions for Rosser provability predicates, and prove the existence of a Rosser provability predicate with which we can define any consistent complete extension of ${\rm PA}$ in some nonstandard model of ${\rm PA} + \neg {\rm Con_{PA}} $. We call it a universal Rosser predicate. It follows from the theorem that the true arithmetic ${\rm TA}$ can be defined as the set of theorems of ${\rm PA}$ in terms of a universal Rosser predicate in some nonstandard model of ${\rm PA} + \neg {\rm Con_{PA}} $. By using this theorem, we also give a new proof of a theorem that there is a nonstandard model M of ${\rm PA} + \neg {\rm Con_{PA}} $ such that if N is an initial segment of M which is a model of ${\rm PA} + {\rm Con_{PA}} $ then every theorem of ${\rm PA}$ in N is a theorem of $\rm PA$ in ${\mathbb N}$. In addition, we prove that there is a Rosser provability predicate such that the set of theorems of $\rm PA$ in terms of the Rosser provability predicate is inconsistent in any nonstandard model of ${\rm PA} + \neg {\rm Con_{PA}} $.


2006 ◽  
Vol 05 (06) ◽  
pp. 847-854 ◽  
Author(s):  
CARL FAITH

If R is right pseudo-Frobenius (= PF), and A is an ideal, when is R/A right PF? Our main result, Theorem 3.7, states that this happens iff the ideal A′ of the basic ring B of R corresponding to A has left annihilator F in B generated by a single element on both sides. Moreover, in this case B/A′ ≈ F in mod-B, (see Theorem 3.5), a property that does not extend to R, that is, in general R/A is not isomorphic to the left annihilator of A. (See Example 4.3(2) and Theorem 4.5.) Theorem 4.6 characterizes Frobenius rings among quasi-Frobenius (QF) rings. As an application of the main theorem, in Theorem 3.9 we prove that if A is generated as a right or left ideal by an idempotent e, then e is central (and R/A is then trivially right PF along with R). This generalizes the result of F. W. Anderson for quasi-Frobenius rings. (See Theorem 2.2 for a new proof.). In Proposition 1.6, we prove that a generalization of this result holds for finite products R of full matrix rings over local rings; namely, an ideal A is finitely generated as a right or left ideal iff A is generated by a central idempotent. We also note a theorem going back to Nakayama, Goursaud, and the author that every factor ring of R is right PF iff R is a uniserial ring. (See Theorem 5.1.).


1982 ◽  
Vol 47 (2) ◽  
pp. 403-415 ◽  
Author(s):  
Kenneth McAloon

AbstractLet P0 be the subsystem of Peano arithmetic obtained by restricting induction to bounded quantifier formulas. Let M be a countable, nonstandard model of P0 whose domain we suppose to be the standard integers. Let T be a recursively enumerable extension of Peano arithmetic all of whose existential consequences are satisfied in the standard model. Then there is an initial segment M′ of M which is a model of T such that the complete diagram of M′ is Turing reducible to the atomic diagram of M. Moreover, neither the addition nor the multiplication of M is recursive.


Author(s):  
Sterling P. Newberry

At the 1958 meeting of our society, then known as EMSA, the author introduced the concept of microspace and suggested its use to provide adequate information storage space and the use of electron microscope techniques to provide storage and retrieval access. At this current meeting of MSA, he wishes to suggest an additional use of the power of the electron microscope.The author has been contemplating this new use for some time and would have suggested it in the EMSA fiftieth year commemorative volume, but for page limitations. There is compelling reason to put forth this suggestion today because problems have arisen in the “Standard Model” of particle physics and funds are being greatly reduced just as we need higher energy machines to resolve these problems. Therefore, any techniques which complement or augment what we can accomplish during this austerity period with the machines at hand is worth exploring.


2019 ◽  
Author(s):  
Adib Rifqi Setiawan

Put simply, Lisa Randall’s job is to figure out how the universe works, and what it’s made of. Her contributions to theoretical particle physics include two models of space-time that bear her name. The first Randall–Sundrum model addressed a problem with the Standard Model of the universe, and the second concerned the possibility of a warped additional dimension of space. In this work, we caught up with Randall to talk about why she chose a career in physics, where she finds inspiration, and what advice she’d offer budding physicists. This article has been edited for clarity. My favourite quote in this interview is, “Figure out what you enjoy, what your talents are, and what you’re most curious to learn about.” If you insterest in her work, you can contact her on Twitter @lirarandall.


2019 ◽  
Author(s):  
Adib Rifqi Setiawan

Put simply, Lisa Randall’s job is to figure out how the universe works, and what it’s made of. Her contributions to theoretical particle physics include two models of space-time that bear her name. The first Randall–Sundrum model addressed a problem with the Standard Model of the universe, and the second concerned the possibility of a warped additional dimension of space. In this work, we caught up with Randall to talk about why she chose a career in physics, where she finds inspiration, and what advice she’d offer budding physicists. This article has been edited for clarity. My favourite quote in this interview is, “Figure out what you enjoy, what your talents are, and what you’re most curious to learn about.” If you insterest in her work, you can contact her on Twitter @lirarandall.


2014 ◽  
Vol 36 (10) ◽  
pp. 2156-2167
Author(s):  
Qiang LI ◽  
Deng-Guo FENG ◽  
Li-Wu ZHANG ◽  
Zhi-Gang GAO

Sign in / Sign up

Export Citation Format

Share Document