Ramsey Quantifiers in Arithmetic

, , , , &
Journal of Symbolic Logic 50 (4):1078-1079 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273997

Links

PhilArchive



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

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: 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.
On the role of Ramsey quantifiers in first order arithmetic.James H. Schmerl & Stephen G. Simpson - 1982 - Journal of Symbolic Logic 47 (2):423-435.
Ramsey quantifiers in arithmetic.A. Macintyre - 1980 - Journal of Symbolic Logic 834 (4):186--210.
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.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
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.
Ramsey theory is needed for solving definability problems of generalized quantifiers.K. Luosto - 1999 - In Jouko A. Vaananen (ed.), European Summer School in Logic, Language and Information: ESSLLI 1997: Generalized Quantifiers and Computation. Springer. pp. 121--134.
Decidability Results for Classes of Ordered Abelian Groups in Logics with Ramsey-Quantifiers.Wolfgang Lenski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 139--168.
Hierarchies of Monadic Generalized Quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
Theorems Of Peano Arithmetic Are Buridan-volpin Recursively Satisfable.David Isles - 1997 - Reports on Mathematical Logic:57-74.
Effectiveness for infinite variable words and the Dual Ramsey Theorem.Joseph S. Miller & Reed Solomon - 2004 - Archive for Mathematical Logic 43 (4):543-555.
Uniform heyting arithmetic.Ulrich Berger - 2005 - Annals of Pure and Applied Logic 133 (1):125-148.
Magidor-Malitz quantifiers in modules.Andreas Baudisch - 1984 - Journal of Symbolic Logic 49 (1):1-8.
A Hierarchy of Cuts in Models of Arithmetic.J. B. Paris, L. Pacholski, J. Wierzejewski, A. J. Wilkie, George Mills & Jussi Ketonen - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.

Analytics

Added to PP
2017-02-21

Downloads
11 (#1,105,752)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

PA( aa ).James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):560-569.

Add more citations

References found in this work

No references found.

Add more references