Transition of Consistency and Satisfiability under Language Extensions

DOI10.2478/v10037-012-0022-0zbMath1288.03034OpenAlexW2125706593MaRDI QIDQ2852156

Peter Koepke, Julian J. Schlöder

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-0022-0

zbMATH Keywords

Mizarformal proofGödel completeness theorem

Mathematics Subject Classification ID

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

Related Items

The Gödel Completeness Theorem for Uncountable Languages

Uses Software

• Mizar

Cites Work

• Unnamed Item