The Gödel Completeness Theorem for Uncountable Languages

DOI10.2478/V10037-012-0023-ZzbMath1288.03035OpenAlexW2067545168MaRDI QIDQ2852157

Julian J. Schlöder, Peter Koepke

Publication date: 8 October 2013

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10037-012-0023-z

zbMATH Keywords

Mizarformal proofGödel completeness theorem

Mathematics Subject Classification ID

Knowledge representation (68T30) Gödel numberings and issues of incompleteness (03F40)

Related Items (6)

Soundness and completeness proofs by coinductive methods ⋮ Formalization of the resolution calculus for first-order logic ⋮ Formal and Natural Proof: A Phenomenological Approach ⋮ Unnamed Item ⋮ Programming and verifying a declarative first-order prover in Isabelle/HOL ⋮ Formalization of the Resolution Calculus for First-Order Logic

Uses Software

• Mizar

Cites Work

• Transition of Consistency and Satisfiability under Language Extensions
• Semantics of MML Query - Ordering
• Unnamed Item

This page was built for publication: The Gödel Completeness Theorem for Uncountable Languages