Iterations of satisfaction classes and models of peano arithmetic

Mathematical Logic Quarterly 38 (1):59-84 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19920380106

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Minimal satisfaction classes with an application to rigid models of Peano arithmetic.Roman Kossak & James H. Schmerl - 1991 - Notre Dame Journal of Formal Logic 32 (3):392-398.
Some remarks on initial segments in models of peano arithmetic.Henryk Kotlarski - 1984 - Journal of Symbolic Logic 49 (3):955-960.
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.
Troubles with (the concept of) truth in mathematics.Roman Murawski - 2006 - Logic and Logical Philosophy 15 (4):285-303.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
Model-theoretic properties characterizing peano arithmetic.Richard Kaye - 1991 - Journal of Symbolic Logic 56 (3):949-963.

Analytics

Added to PP
2013-12-01

Downloads
16 (#901,783)

6 months
3 (#961,692)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Mathematical logic.Joseph R. Shoenfield - 1967 - Reading, Mass.,: Addison-Wesley.
The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.
Mathematical Logic.J. Donald Monk - 2001 - Bulletin of Symbolic Logic 7 (3):376-376.
Model Theory and Algebra.Jon Barwise, John Schlipf, D. H. Saracino & V. B. Weispfenning - 1987 - Journal of Symbolic Logic 52 (1):279-284.

Add more references