✦ LIBER ✦

The Pigeonhole Principle and Fragments of Arithmetic

✍ Scribed by C. Dimitracopoulos; J. Paris

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 380 KB
Volume: 32
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19860320109

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Proof of the Weak Pigeonhole Princ

A New Proof of the Weak Pigeonhole Principle

✍ Alexis Maciel; Toniann Pitassi; Alan R. Woods 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 213 KB

The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, J. B. Paris et al. (J. Symbolic Logic 53 (1988), 1235-1244) showed how to prove the weak pigeonhole principle with bounded-depth, quasipolynomialsize proofs.

Fragments of Arithmetic and true sentenc

Fragments of Arithmetic and true sentences

✍ Andrés Cordón-Franco; Alejandro Fernández-Margarit; F. Félix Lara-Martín 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only (up to deductive equivalence) consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of b

The weak pigeonhole principle for functi

The weak pigeonhole principle for function classes in S12

✍ Norman Danner; Chris Pollett 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB 👁 1 views

## Abstract It is well known that __S__ ^1^~2~ cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in __S__ ^1^~2~ for provably weaker function class

A note on the Σ1 collection scheme and f

A note on the Σ1 collection scheme and fragments of bounded arithmetic

✍ Zofia Adamowicz; Leszek Aleksander Kołodziejczyk 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

Bounded arithmetic, collection principle, weak pigeonhole principle. ## MSC (2000) 03F30 We show that for each n ≥ 1, if T n 2 does not prove the weak pigeonhole principle for Σ b n functions, then the collection scheme BΣ1 is not finitely axiomatizable over T n 2 . The same result holds with S n

Nonstandard Models for a Fragment of the

Nonstandard Models for a Fragment of the Arithmetic and Their Decision Problem

✍ Ibrahim Garro 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Synthesis of Pectin Fragments by Modular

Synthesis of Pectin Fragments by Modular Design Principle

✍ C. Vogel; B. Nolting; S. Kramer; W. Steffan; A.-J. Ott 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 7 KB

## Abstract For Abstract see ChemInform Abstract in Full Text.