scholarly journals Automorphisms of recursively saturated models of arithmetic

1991 ◽  
Vol 55 (1) ◽  
pp. 67-99 ◽  
Author(s):  
Richard Kaye ◽  
Roman Kossak ◽  
Henryk Kotlarski
Keyword(s):  
Saturated Models ◽  
Recursively Saturated ◽  
Models Of Arithmetic

scholarly journals The Complexity of Classification Problems for Models of Arithmetic

2010 ◽  
Vol 16 (3) ◽  
pp. 345-358 ◽  
Author(s):  
Samuel Coskey ◽  
Roman Kossak
Keyword(s):  
Classification Problem ◽  
The Other ◽  
Saturated Model ◽  
Classification Problems ◽  
Finitely Generated ◽  
Saturated Models ◽  
Other Hand ◽  
Recursively Saturated ◽  
Recursively Saturated Model ◽  
Models Of Arithmetic

AbstractWe observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.

scholarly journals Degrees of recursively saturated models

1984 ◽  
Vol 282 (2) ◽  
pp. 539-539 ◽  
Author(s):  
Angus Macintyre ◽  
David Marker
Keyword(s):  
Saturated Models ◽  
Recursively Saturated
Sign in / Sign up

Export Citation Format

Share Document