- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Models and types of Peano's arithmetic
Annals of Mathematical Logic 9 (3):223-306 (1976)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Some remarks on initial segments in models of peano arithmetic.Henryk Kotlarski - 1984 - Journal of Symbolic Logic 49 (3):955-960.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
On certain types and models for arithmetic.Andreas Blass - 1974 - Journal of Symbolic Logic 39 (1):151-162.
Iterations of satisfaction classes and models of peano arithmetic.Roman Murawski - 1992 - Mathematical Logic Quarterly 38 (1):59-84.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.
Generic cuts in models of arithmetic.Richard Kaye - 2008 - Mathematical Logic Quarterly 54 (2):129-144.
Definable sets and expansions of models of Peano arithmetic.Roman Murawski - 1988 - Archive for Mathematical Logic 27 (1):21-33.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
A model of peano arithmetic with no elementary end extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Analytics
Added to PP
2014-01-17
Downloads
47 (#345,300)
6 months
9 (#347,496)
2014-01-17
Downloads
47 (#345,300)
6 months
9 (#347,496)
Historical graph of downloads
Author's Profile
Citations of this work
Automorphisms of recursively saturated models of arithmetic.Richard Kaye, Roman Kossak & Henryk Kotlarski - 1991 - Annals of Pure and Applied Logic 55 (1):67-99.
Fixed points of self-embeddings of models of arithmetic.Saeideh Bahrami & Ali Enayat - 2018 - Annals of Pure and Applied Logic 169 (6):487-513.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
Rank-initial embeddings of non-standard models of set theory.Paul Kindvall Gorbow - 2020 - Archive for Mathematical Logic 59 (5-6):517-563.
On maximal subgroups of the automorphism group of a countable recursively saturated model of PA.Roman Kossak, Henryk Kotlarski & James H. Schmerl - 1993 - Annals of Pure and Applied Logic 65 (2):125-148.
References found in this work
Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory.Saharon Shelah - 1971 - Annals of Mathematical Logic 3 (3):271-362.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-747975fc64-d7skc uwo