Forcing in Finite Structures

Mathematical Logic Quarterly 43 (3):401-412 (1997)
  Copy   BIBTEX

Abstract

We present a simple and completely model-theoretical proof of a strengthening of a theorem of Ajtai: The independence of the pigeonhole principle from IΔ0. With regard to strength, the theorem proved here corresponds to the complexity/proof-theoretical results of [10] and [14], but a different combinatorics is used. Techniques inspired by Razborov [11] replace those derived from Håstad [8]. This leads to a much shorter and very direct construction

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,335

External links

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

Through your library

Similar books and articles

Structures interpretable in models of bounded arithmetic.Neil Thapen - 2005 - Annals of Pure and Applied Logic 136 (3):247-266.
Abelian groups and quadratic residues in weak arithmetic.Emil Jeřábek - 2010 - Mathematical Logic Quarterly 56 (3):262-278.
A model-theoretic characterization of the weak pigeonhole principle.Neil Thapen - 2002 - Annals of Pure and Applied Logic 118 (1-2):175-195.
Algebraic Methods and Bounded Formulas.Domenico Zambella - 1997 - Notre Dame Journal of Formal Logic 38 (1):37-48.
Bounded finite set theory.Laurence Kirby - 2021 - Mathematical Logic Quarterly 67 (2):149-163.
Closed Normal Subgroups.James H. Schmerl - 2001 - Mathematical Logic Quarterly 47 (4):489-492.
On a Theory for AC0 and the Strength of the Induction Scheme.Satoru Kuroda - 1998 - Mathematical Logic Quarterly 44 (3):417-426.

Analytics

Added to PP
2013-12-01

Downloads
16 (#1,056,769)

6 months
11 (#485,833)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.

Add more citations

References found in this work

Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
¹1-formulae on finite structures.M. Ajtai - 1983 - Annals of Pure and Applied Logic 24 (1):1.

Add more references