arXiv:2105.06877 [math.LO]AbstractReferencesReviewsResources
First order logic properly displayed
Samuel Balco, Giuseppe Greco, Alexander Kurz, Andrew Moshier, Alessandra Palmigiano, Apostolos Tzimoulis
Published 2021-05-14, updated 2021-05-19Version 2
We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform substitution and are without side conditions.
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:math/0210387 [math.LO] (Published 2002-10-24)
Consistency Without Cut Elimination
arXiv:1606.01763 [math.LO] (Published 2016-06-06)
A Constructive Proof of Cut Elimination for a System of Full Second Order Logic
arXiv:1605.03501 [math.LO] (Published 2016-05-11)
Is Leibnizian calculus embeddable in first order logic?