scientific article

Publication date: 23 January 1993

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

modal logic Peano arithmetic provability Gödel's incompleteness theorems fixed point principle axiomatic arithmetic based on plus, times and power Montague-Kalish axiomatization for first-order logic original Gödel proof representation and separation theorems of Shepherdson Rosser's proof Tarski truth set

Mathematics Subject Classification ID

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)

Related Items (25)

Much ado about nothing—an introductive inquiry about zero ⋮ SUFFICIENT CONDITIONS FOR THE EXISTENCE OF UNDECIDABLE INDIRECTLY REFLECTIVE SENTENCES ⋮ A deductive approach towards reasoning about algebraic transition systems ⋮ The indefinability of truth in the ``Wahrheitsbegriff ⋮ Curves in Gödel-space: towards a structuralist ontology of mathematical signs ⋮ Unnamed Item ⋮ A step towards absolute versions of metamathematical results ⋮ On fuzzification of Tarski's fixed point theorem without transitivity ⋮ Categorical pairs and the indicative shift ⋮ On the Semantics of Intensionality ⋮ The concept of truth in a finite universe ⋮ Constructibility and decidability versus domain independence and absoluteness ⋮ Unnamed Item ⋮ Some new results on decidability for elementary algebra and geometry ⋮ The knower paradox in the light of provability interpretations of modal logic ⋮ Existence and definability of states of the world ⋮ Quantum logic, Hilbert space, revision theory ⋮ A Framework for Formalizing Set Theories Based on the Use of Static Set Terms ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Is independence an exception? ⋮ Distilling the requirements of Gödel's incompleteness theorems with a proof assistant ⋮ The Complexity of Quantified Constraints Using the Algebraic Formulation ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS ⋮ Multiple Fibonacci trees ⋮ Mechanism, truth, and Penrose's new argument

This page was built for publication: