The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
A simplified framework for first-order languages and its formalization in Mizar
[article]
2012
arXiv
pre-print
A strictly formal, set-theoretical treatment of classical first-order logic is given. Since this is done with the goal of a concrete Mizar formalization of basic results (Lindenbaum lemma; Henkin, satisfiability, completeness and Lowenheim-Skolem theorems) in mind, it turns into a systematic pursue of simplification: we give up the notions of free occurrence, of derivation tree, and study what inference rules are strictly needed to prove the mentioned results. Afterwards, we discuss details of
arXiv:1205.4316v1
fatcat:egc4zhopozgvrd2rvjiwotq3f4