A Hierarchy of Cuts in Models of Arithmetic

, , , , &
Journal of Symbolic Logic 51 (4):1062-1066 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273919

Links

PhilArchive



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

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

Review: J. B. Paris, L. Pacholski, J. Wierzejewski, A. J. Wilkie, A Hierarchy of Cuts in Models of Arithmetic; George Mills, A Tree Analysis of Unprovable Combinatorial Statements; Jussi Ketonen, Robert Solovay, Rapidly Growing Ramsey Functions. [REVIEW]A. J. Wilkie - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.
Generic cuts in models of arithmetic.Richard Kaye - 2008 - Mathematical Logic Quarterly 54 (2):129-144.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
Subsets of models of arithmetic.Roman Kossak & Jeffrey B. Paris - 1992 - Archive for Mathematical Logic 32 (1):65-73.
The arithmetic of cuts in models of arithmetic.Richard Kaye - 2013 - Mathematical Logic Quarterly 59 (4-5):332-351.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Truth in generic cuts.Richard Kaye & Tin Lok Wong - 2010 - Annals of Pure and Applied Logic 161 (8):987-1005.
Type two cuts, bad cuts and very bad cuts.Renling Jin - 1997 - Journal of Symbolic Logic 62 (4):1241-1252.
Review: Angus Macintyre, L. Pacholski, J. Wierzejewski, A. J. Wilkie, Ramsey Quantifiers in Arithmetic; James H. Schmerl, Stephen G. Simpson, On the Role of Ramsey Quantifiers in First Order Arithmetic; Carl Morgenstern, On Generalized Quantifiers in Arithmetic. [REVIEW]L. A. S. Kirby - 1985 - Journal of Symbolic Logic 50 (4):1078-1079.
Regular cuts in models of bounded arithmetic.Morteza Moniri & S. Hosein Sajjadi - 2013 - Bulletin of the Section of Logic 42 (1/2):11-20.
Model Theory of Algebra and Arithmetic: Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz,Poland, September 1-7, 1979.L. Pacholski, Jędrzej Wierzejewski, J. Wierzejewski & A. J. Wilkie - 1980 - Lecture Notes in Mathematics.
On closed elementary cuts in recursively saturated models of Peano arithmetic.Bożena Piekart - 1993 - Notre Dame Journal of Formal Logic 34 (2):223-230.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Relating the bounded arithmetic and polynomial time hierarchies.Samuel R. Buss - 1995 - Annals of Pure and Applied Logic 75 (1-2):67-77.

Analytics

Added to PP
2015-02-05

Downloads
17 (#795,850)

6 months
5 (#441,012)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeffrey Paris
University of Manchester

Citations of this work

Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Slow consistency.Sy-David Friedman, Michael Rathjen & Andreas Weiermann - 2013 - Annals of Pure and Applied Logic 164 (3):382-393.
Inductive Full Satisfaction Classes.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Annals of Pure and Applied Logic 47 (1):199--223.
On Gödel incompleteness and finite combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (C):23-41.
On me number of steps in proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.

View all 13 citations / Add more citations

References found in this work

No references found.

Add more references