The Pigeonhole Principle and Fragments of Arithmetic

DOI10.1002/MALQ.19860320109zbMath0571.03028OpenAlexW2036512720MaRDI QIDQ3688388

Constantine Dimitracopoulos, Jeffrey Bruce Paris

Publication date: 1986

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19860320109

zbMATH Keywords

collection schemainduction schemapigeonhole principlefirst-order language of arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Related Items (6)

A note on exponentiation ⋮ HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ Pell Equations and Weak Regularity Principles ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document} ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06

This page was built for publication: The Pigeonhole Principle and Fragments of Arithmetic