Logical undecidabilities made easy

zbMATH Open1166.03019MaRDI QIDQ3601404FDOQ3601404

Authors: Daniel M. Leivant 

Publication date: 10 February 2009

Recommendations

• Undecidability without arithmetization
• Decidability without mathematics
• A simple character string proof of the ``true but unprovable version of Gödel's first incompleteness theorem
• Gödel incompleteness theorems and the limits of their applicability. I
• scientific article; zbMATH DE number 3922637

zbMATH Keywords

undecidability

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Cited In (7)

• Ein Direkter Beweis für die Allgemein‐Rekursive Unlösbarkeit des Entscheidungsproblems des Prädikatenkalküls der Ersten Stufe mit Identität
• Undecidability without arithmetization
• Undecidability and incompleteness results in automata theory
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Decidability without mathematics
• A simple character string proof of the ``true but unprovable version of Gödel's first incompleteness theorem

This page was built for publication: Logical undecidabilities made easy

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