scientific article; zbMATH DE number 910749
From MaRDI portal
Publication:4885911
zbMath0855.03032MaRDI QIDQ4885911
Publication date: 9 February 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
incompletenessHerbrand consistencylengths of proofsnon-standard models of arithmeticfinite consistencyspeed-up of proofs
Complexity of computation (including implicit computational complexity) (03D15) Nonstandard models of arithmetic (03H15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (9)
Passive induction and a solution to a Paris-Wilkie open question ⋮ The paradox of the knower revisited ⋮ Further oracles separating conjectures about incompleteness in the finite domain ⋮ Montague's paradox, informal provability, and explicit modal logic ⋮ The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem ⋮ 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 ⋮ An oracle separating conjectures about incompleteness in the finite domain ⋮ P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle
This page was built for publication:
