A note on the undefinability of cuts
From MaRDI portal
Publication:3310622
DOI10.2307/2273447zbMath0529.03040OpenAlexW2088127783MaRDI QIDQ3310622
Jeffrey Bruce Paris, Constantine Dimitracopoulos
Publication date: 1983
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273447
Related Items (8)
On the scheme of induction for bounded arithmetic formulas ⋮ TRUTH AND SPEED-UP ⋮ Passive induction and a solution to a Paris-Wilkie open question ⋮ A note on proofs of falsehood ⋮ The formalization of interpretability ⋮ A generalization of the second incompleteness theorem and some exceptions to it ⋮ Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem ⋮ The arithmetic of cuts in models of arithmetic
This page was built for publication: A note on the undefinability of cuts
