Difference between revisions of "Jonsson models"

From Peano's Parlour
Jump to: navigation, search
Line 3: Line 3:
 
Gaifman and Knight independently showed in 1976 that there are Jonsson models of PA.  
 
Gaifman and Knight independently showed in 1976 that there are Jonsson models of PA.  
  
Jonsson models M of PAofcardinality\aleph_1areeither\aleph_1-likeorareshorti.e.thereisana\in MsuchthattheSkolemclosureofaiscofinalinM$.  Each known Jonsson model realizes uncountably many  complete types.  
+
Jonsson models M of $PA$ of cardinality 1 are either 1like or are ''short'' i.e. there is an aM such that the Skolem closure of a is cofinal in M.  Each known Jonsson model realizes uncountably many  complete types.  
  
 
Kossak has asked: Is there an 1-like Jonsson model M\PA such that |{tp(a):aM}|=0?  
 
Kossak has asked: Is there an 1-like Jonsson model M\PA such that |{tp(a):aM}|=0?  
  
 
If M\PA is 1-like and recursively saturated,  then |{tp(a):aM}|=0, but M is not Jonsson. Therefore, another related question is: Is there a  ''weakly Jonsson model'' M\PA, i.e. a recursively saturated model MPA such that for  every recursively saturated KM, if |K|=|M|, then K=M? Some results related to this question are in Kossak, Roman, ''Four problems concerning recursively saturated models of arithmetic''. Special Issue: Models of arithmetic. Notre Dame J. Formal Logic 36 (1995), no. 4, 519–530.
 
If M\PA is 1-like and recursively saturated,  then |{tp(a):aM}|=0, but M is not Jonsson. Therefore, another related question is: Is there a  ''weakly Jonsson model'' M\PA, i.e. a recursively saturated model MPA such that for  every recursively saturated KM, if |K|=|M|, then K=M? Some results related to this question are in Kossak, Roman, ''Four problems concerning recursively saturated models of arithmetic''. Special Issue: Models of arithmetic. Notre Dame J. Formal Logic 36 (1995), no. 4, 519–530.

Revision as of 16:37, 17 January 2013

A model B is J\'onsson if |B|>0 and for every AB, if |A|=|B|, then A=B.

Gaifman and Knight independently showed in 1976 that there are Jonsson models of PA.

Jonsson models M of PA of cardinality 1 are either 1like or are short i.e. there is an aM such that the Skolem closure of a is cofinal in M. Each known Jonsson model realizes uncountably many complete types.

Kossak has asked: Is there an 1-like Jonsson model M\PA such that |{tp(a):aM}|=0?

If M\PA is 1-like and recursively saturated, then |{tp(a):aM}|=0, but M is not Jonsson. Therefore, another related question is: Is there a weakly Jonsson model M\PA, i.e. a recursively saturated model MPA such that for every recursively saturated KM, if |K|=|M|, then K=M? Some results related to this question are in Kossak, Roman, Four problems concerning recursively saturated models of arithmetic. Special Issue: Models of arithmetic. Notre Dame J. Formal Logic 36 (1995), no. 4, 519–530.