scientific article

zbMath1152.03003MaRDI QIDQ3511020

Melvin Fitting

Publication date: 4 July 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite set theoryLöb's theoremincompleteness of arithmeticundecidability of arithmeticundecidability of first-order logicundefinability of truth in arithmetic

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Axiomatics of classical set theory and its fragments (03E30) Gödel numberings and issues of incompleteness (03F40)

Related Items (3)

Logic of negation-complete interactive proofs (formal theory of epistemic deciders) ⋮ A representation of recursively enumerable sets through Horn formulas in higher recursion theory ⋮ A step towards absolute versions of metamathematical results

This page was built for publication: