Transition of consistency and satisfiability under language extensions

DOI10.2478/V10037-012-0022-0MaRDI QIDQ2852156zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

formal proofGödel completeness theoremMizar

Mathematics Subject Classification ID

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

Recommendations

• The Gödel completeness theorem for uncountable languages
• Sequent calculus, derivability, provability. Gödel's completeness theorem
• Extending ω-consistent sets to maximally consistent, ω-complete sets
• scientific article; zbMATH DE number 553883
• Gödel's completeness theorem

Cited in

(4)

• The Gödel completeness theorem for uncountable languages
• Sequent calculus, derivability, provability. Gödel's completeness theorem
• Extending ω-consistent sets to maximally consistent, ω-complete sets
• Approximately satisfied properties of systems and simple language homomorphisms

Describes a project that uses

Uses Software

• Mizar

This page was built for publication: Transition of consistency and satisfiability under language extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852156)