A proof of the completeness theorem of Grödel

DOI10.4064/fm-37-1-193-200zbMath0040.29303OpenAlexW767530356MaRDI QIDQ5800356

Roman Sikorski, Helena Rasiowa

Publication date: 1950

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213213

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (32)

While-programs with nondeterministic assignments and the logic ALNA ⋮ Adequacy and complete axiomatization for timed modal logic ⋮ A partially ordered extension of the integers ⋮ Leon Henkin the Reviewer ⋮ Henkin’s Theorem in Textbooks ⋮ The Countable Henkin Principle ⋮ A geometric interpretation of logical formulae ⋮ Concurrent weighted logic ⋮ An extension of Jónsson‐Tarski representation and model existence in predicate non‐normal modal logics ⋮ On duality and model theory for polyadic spaces ⋮ Polyadic spaces and profinite monoids ⋮ Topological proofs of some Rasiowa-Sikorski lemmas ⋮ Alternation-free weighted mu-calculus: decidability and completeness ⋮ Plain semi-Post algebras as a poset-based generalization of Post algebras and their representability ⋮ Unnamed Item ⋮ An infinitary extension of Jankov's theorem ⋮ An open mapping theorem for finitely copresented Esakia spaces ⋮ \(LT\)-fuzzy sets ⋮ Kripke completeness of infinitary predicate multimodal logics ⋮ Cylindric Algebras and Algebras of Substitutions ⋮ Four studies in metamathematics ⋮ On universal algebraic constructions of logics ⋮ Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures ⋮ Strong completeness and limited canonicity for PDL ⋮ Rasiowa–Sikorski Sets and Forcing ⋮ Key notions of Tarski's methodology of deductive systems ⋮ Completeness of the functional calculus of first order ⋮ The algebraic treatment of the methodology of elementary deductive systems ⋮ A note on algebraic semantics for \(\mathsf {S5}\) with propositional quantifiers ⋮ MacNeille completion and profinite completion can coincide on finitely generated modal algebras ⋮ Axiomatization and completeness of uncountably valued approximation logic ⋮ Monoidal functional dependencies

This page was built for publication: A proof of the completeness theorem of Grödel