Basic proof theory
Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hi-index | 0.00 |
This article presents a sequent calculus for a negative free logic with identity, called N. The main theorem (in part 1) is the admissibility of the Cut-rule. The second part of this essay is devoted to proofs of soundness, compactness and completeness of N relative to a standard semantics for negative free logic.