scientific article; zbMATH DE number 517064

MaRDI QIDQ4282592zbMATH OpenFDO

Authors Tyko Straßen, Sergei Artemov

Publication date 17 April 1994

zbMATH Keywords

arithmetical completenessGödel proof predicatePeano Arithmetic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30)

Recommendations

• On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs
• scientific article; zbMATH DE number 1166301
• Logic of proofs
• scientific article; zbMATH DE number 1670501
• Decidable and enumerable predicate logics of provability

Cited in

(14)

• Sequent logic of arithmetic decidability
• Undecidability of a second-order provability logic with operation of comparison of witnesses
• Syntactical models and fixed points for the basic logic of proofs
• Gödel's proof. Edited and with a new foreword by Douglas R. Hofstadter
• Gödel's ontological proof and its variants
• scientific article; zbMATH DE number 3870631 (Why is no real title available?)
• scientific article; zbMATH DE number 5081354 (Why is no real title available?)
• scientific article; zbMATH DE number 5157044 (Why is no real title available?)
• scientific article; zbMATH DE number 3896333 (Why is no real title available?)
• scientific article; zbMATH DE number 1166301 (Why is no real title available?)
• scientific article; zbMATH DE number 2174393 (Why is no real title available?)
• On the complexity of Gödel's proof predicate
• Gödel’s Disjunction
• On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs

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 Q4282592)