Combinatorial principles concerning approximations of functions

DOI10.1007/BF02017489zbMath0645.03057OpenAlexW1978312966MaRDI QIDQ3788005

Jeffrey Bruce Paris, Petr Hájek

Publication date: 1987

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/138050

zbMATH Keywords

fragmentsapproximations of functionscombinatorial principlesPudlak principleprovability or unprovability in PA

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items

On principles between ∑1- and ∑2-induction, and monotone enumerations ⋮ A WALK WITH GOODSTEIN ⋮ Inductive full satisfaction classes ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ On some formalized conservation results in arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• On Gödel incompleteness and finite combinatorics
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• Rapidly growing Ramsey functions
• ∏ 0 1 Classes and Degrees of Theories