Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem

DOI10.2478/V10037-011-0029-YzbMath1276.03045OpenAlexW1987404778MaRDI QIDQ2865750

Marco Bright Caminati

Publication date: 3 December 2013

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

Full work available at URL: https://doi.org/10.2478/v10037-011-0029-y

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Basic properties of first-order languages and structures (03C07) Gödel numberings and issues of incompleteness (03F40)

Related Items (1)

Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages

Uses Software

• Mizar

Cites Work

• Semantics of MML Query - Ordering
• Preliminaries to Classical First Order Model Theory
• Definition of First Order Language with Arbitrary Alphabet. Syntax of Terms, Atomic Formulas and their Subterms
• First Order Languages: Further Syntax and Semantics
• Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages

This page was built for publication: Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem