scientific article; zbMATH DE number 2236687

zbMATH Open1084.03045MaRDI QIDQ5711939

Andrey Bovykin

Publication date: 8 December 2005

Title of this publication is not available (Why is that?)

zbMATH Keywords

surveyindiscerniblesunprovabilityParis-Harrington principleKanamori-McAloon principlecombinatorial statementsmodel-theoretic independence proofstheories of induction

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Applications of model theory (03C98)

Related Items (4)

Combinatorial unprovability proofs and their model-theoretic counterparts ⋮ Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem ⋮ The scope of Gödel's first incompleteness theorem ⋮ PROVING UNPROVABILITY

Recommendations

• The undecidability of \(k\)-provability 👍 👎
• On an unsatisfiability-satisfiability prover 👍 👎
• On the complexity of the parity argument and other inefficient proofs of existence 👍 👎
• \(k\)-provability in \(\mathrm{PA}\) 👍 👎
• Unprovability and proving unprovability 👍 👎
• Combinatorial unprovability proofs and their model-theoretic counterparts 👍 👎
• Some proofs of undecidability of arithmetic 👍 👎
• On memoryless provers and insincere verifiers 👍 👎
• Pseudo-deterministic Proofs 👍 👎
• PROVING UNPROVABILITY 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711939)