A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

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

2011
*
Formalized Mathematics
*

Fifth of a series of articles laying down the bases for classical first order model theory. This paper presents multiple themes: first it introduces sequents, rules and sets of rules for a first order language L as L-dependent types. Then defines derivability and provability according to a set of rules, and gives several technical lemmas binding all those concepts. Following that, it introduces a fixed set D of derivation rules, and proceeds to convert them to Mizar functorial cluster

doi:10.2478/v10037-011-0029-y
fatcat:ly6vkssqhza4ti5e626dcg6psy