Contributions To Independence Results In Number Theory And Set Theory.
Paul Howard · Deep Blue (University of Michigan) · 1970
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
Deep Blue (University of Michigan) · University of Michigan · dissertation · 1970
Abstract
f orm: 1 ) -» 3 x ( s x = 0 ) 2 ) Vx Vy ( s x = sy -► x = y ) 3 ) Vx ( x + 0 = x A Vy ( x * a y = a ( x+y ) ) ) 4 ) Vx ( X» 0 = 0 A Vy ( X^ ay = x^y + x ) ) 3) Vx \/y ( x<y -> 3z ( z / 0 z * x = y ) ) 6a) Vtle.. Vtm [ ( A(0,tlw Vy ( A(y,tlf ►.A(^y * t y » • • • ») ) * Vx A(x, , .. ., tm For every formula A of with free variables contained in ^x^t^^ '^m^ ■ de introduce terms 1, 2, 3, » « into X by the defining axloms sQ = 1» si = 2, , an = n + 1, ...
In what follows we will use without proof any of the well known theorems provable from the Peano Axioms.A model for Peano Arithmetic is a structure TH = , +, a, < , 0^ for the language in which all of the Peano Axioms are true when + is interpreted as *, 2_ aa ° • £ as a, as and 0 as 0, If TD is any model of Peano Arithmetic it is easy to see that the set W-m = 2^, 2m» •••J' with the relations and operations of 'TYA restricted is a submodel of TH which is isomorphic to the model 71 whose domain |Tt/ is the natural numbers and in which the relations and operations are the usual ones.TV, is called the standard model.If TH is any model not isomorphic to 71 ( i.e.TTL is a non standard model ), then there is some m 6in satisfying n Cm for each natural number n.So non-standard, models have -m "infinite" elements, that is elements larger than every stand ard integer in the model.Def inition.If TTY = • » +, s, < , is a model of Peano Arithmetic, the ^+, s, -reduct of TTL is the structure +, s, • Theorem.1.1.There are uncountably many countable models of Peano Arithmetic whose C + » s, -reducts are pairwise non-1somorph1c.Proof.Suppose the theorem is false, then there is a et B of disjoint, countable models of Peano Arithmetic such that B is countable and if Tft is any countable model of Peano Arithmetic, the ^+, s, -reduct of TH is isomorphic to the ^ + , s, C / -reduct of some element of B.
Suppose that ^a^ ; l€ûo} is an enumeration of UB-Let at1 be the language together with a new individual constant c and let A* be the following set of axioms.xhe axioms of Peano Arithmetic together with a countable set of axioms lecj ?determined by A« = 3x ( x + x + ...+ x = c ) 1 K-----Z--------p^ times A1 = -> 3 x ( + x + .. .+ x^ = ç ) p. times If p^ does not divide aa in the model of which is a member.If divides a. in the model of which a^ is a member.in the above p^ is the i^ prime and p^ divides a^ in TTY if a^e, TTLand in TH, it is true that Hy ( p^^y = a^ ).>4 is a consistent set of axioms, for suppose >4* * is any finite subset of -A .In the model TL all the Peano Axioms of
Open the resolved locator · 10.7302/16622
Metadata licence: OpenAlex metadata (CC0)