Undecidable sentences generated by semantic paradoxes

DOI10.2307/2268041MaRDI QIDQ5848180zbMATH OpenOpenAlexFDO

Authors Hao Wang

Publication date 1955

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2268041

zbMATH Keywords

semantic paradoxesundecidable sentences

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• scientific article; zbMATH DE number 515370
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Undecidability without arithmetization
• Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory
• Undecidability results for restricted universally quantified formulae of set theory

Cites work

• Some concepts concerning formal systems of number theory

Cited in

(8)

• The undecidability of Grišin's set theory
• The scope of Gödel's first incompleteness theorem
• Linguistic paradoxes and tautologies
• scientific article; zbMATH DE number 3891324 (Why is no real title available?)
• Current research on Gödel's incompleteness theorems
• Decreasing sentences in simple type theory
• INCOMPLETENESS VIA PARADOX AND COMPLETENESS
• Paradoxes behind the Solovay sentences

This page was built for publication: Undecidable sentences generated by semantic paradoxes

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