Bulletin of Symbolic Logic 16 (3):345-358 (2010)

Authors
Roman Kossak
City University of New York
Abstract
We 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
Keywords Countable models of arithmetic, complexity of isomorphis problems,  finitely generated models of PA, recursively saturated models of PA
Categories (categorize this paper)
DOI 10.2178/bsl/1286284557
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,593
Through your library

References found in this work BETA

Models and Types of Peano's Arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Recursively Saturated Nonstandard Models of Arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.

View all 10 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Models with the Ω-Property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Transplendent Models: Expansions Omitting a Type.Fredrik Engström & Richard W. Kaye - 2012 - Notre Dame Journal of Formal Logic 53 (3):413-428.
Recursively Saturated $\omega_1$-Like Models of Arithmetic.Roman Kossak - 1985 - Notre Dame Journal of Formal Logic 26 (4):413-422.
Recursively Saturated Nonstandard Models of Arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
On the Complexity of Models of Arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Elementary Extensions of Recursively Saturated Models of Arithmetic.C. Smoryński - 1981 - Notre Dame Journal of Formal Logic 22 (3):193-203.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.

Analytics

Added to PP index
2010-10-06

Total views
56 ( #194,664 of 2,462,064 )

Recent downloads (6 months)
1 ( #448,768 of 2,462,064 )

How can I increase my downloads?

Downloads

My notes