On groups and initial segments in nonstandard models of Peano Arithmetic
نویسنده
چکیده
This thesis concerns M-finite groups and a notion of discrete measure in models of Peano Arithmetic. First we look at a measure construction for arbitrary non-M-finite sets via suprema and infima of appropriate M-finite sets. The basic properties of the measures are covered, along with non-measurable sets and the use of end-extensions. Next we look at nonstandard finite permutations, introducing nonstandard symmetric and alternating groups. We show that the standard cut being strong is necessary and sufficient for coding of the cycle shape in the standard system to be equivalent to the cycle being contained within the external normal closure of the nonstandard symmetric group. Subsequently the normal subgroup structure of nonstandard symmetric and alternating groups is given as a result analogous to the result of Baer, Schreier and Ulam for infinite symmetric groups. The external structure of nonstandard cyclic groups of prime order is identified as that of infinite dimensional rational vector spaces and the normal subgroup structure of nonstandard projective special linear groups is given for models elementarily extending the standard model. Finally we discuss some applications of our measure to nonstandard finite groups.
منابع مشابه
Tutorial on Elementary Pairs of Models of Arithmetic
Almost all results in model theory of arithmetic are about elementary extensions. I will talk about an effort to systematize those results. If M and N are models of arithmetic and M ≺ N , how much information is there in Th((N,M)) in relation to Th(N)? In what situations is there a form of elimination of quantifiers for Th((N,M))? Is there a complete set of isomorphism invariants for such pairs...
متن کاملOrder-types of models of Peano arithmetic: a short survey
Here, PA is the first-order theory in the language with 0, 1,+, ·, < containing finitely many basic axioms true in N together with the first-order induction axiom scheme. Any model of PA has an initial segment isomorphic to N, and we will always identify N with this initial segment. The theory PA is well-known not to be complete, and has 2א0 complete extensions. ‘True arithmetic’—the theory Th(...
متن کاملThe arithmetic of cuts in models of arithmetic
We present a number of results on the structure of initial segments models of Peano arithmetic with the arithmetic operations of addition, subtraction, multiplication, logarithm and a notion of derivative on cuts. Each of these operations is defined in two dual ways, often with quite different results, and we attempt to systemise the issues and show how various calculations may be carried out. ...
متن کاملAn Effective Conservation Result for Nonstandard Arithmetic
We prove that a nonstandard extension of arithmetic is eeectively conservative over Peano arithmetic by using an internal version of a deenable ultrapower. By the same method we show that a certain extension of the nonstandard theory with a saturation principle has the same proof-theoretic strength as second order arithmetic, where comprehension is restricted to arithmetical formulas.
متن کاملTennenbaum’s Theorem for Models of Arithmetic
This paper discusses Tennenbaum’s Theorem in its original context of models of arithmetic, which states that there are no recursive nonstandard models of Peano Arithmetic. We focus on three separate areas: the historical background to the theorem; an understanding of the theorem and its relationship with the Gödel–Rosser Theorem; and extensions of Tennenbaum’s theorem to diophantine problems in...
متن کامل