Keywords
- Prime Model
- Countable Model
- Order Type
- Peano Arithmetic
- Recursive Tree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S.S. GONCHAROV and A.T. NURTAZIN: Constructive models of complete solvable theories. Algebra i Logica 12-2 March–April 1973.
P. CLOTE: Anti-basis theorems and their relation to indepen dence results in Peano arithmetic. This volume
C.G. JOCKUSCH, Jr. and R.I. SOARE: π 1° Classes and degrees of theories. Transactions of the American Mathematical Society 173, November 1972.
T.S. MILLAR: Foundations of recursive model theory. Annals of Mathematical Logic, 13, 1978.
M. MORLEY: Decidable models, Israel Journal of Mathematics, 25, 1976.
P. CLOTE and K. Mc ALOON: Two new combinatorial theorems equivament to the 1-consistency of Peano Arithmetic, à paraître.
G. WILMERS: Minimally saturated models, Proceedings of Logic Colloquium 1979 at Karpacz.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Clote, P. (1981). A note on Decidable Model theory. In: Berline, C., McAloon, K., Ressayre, JP. (eds) Model Theory and Arithmetic. Lecture Notes in Mathematics, vol 890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095661
Download citation
DOI: https://doi.org/10.1007/BFb0095661
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11159-7
Online ISBN: 978-3-540-38629-2
eBook Packages: Springer Book Archive
