A simple sequent system for first-order logic with free constructors

From MaRDI portal





The author presents a sound and complete sequent system for natural first-order logic with free constructors and equality. Theories of this kind have been considered as foundations for inductive datatypes both in programming language design and in proof assistents, and as frameworks for analyzing and proving properties of cryptographic protocols which also used similar inductive definitions. The basic rules of the logic system are like the rules for Martelli-Montanari-style first-order unification. Soundness, completeness and cut-elimination are proved for the presented system. For the entire collection see [Zbl 0915.00048].











This page was built for publication: A simple sequent system for first-order logic with free constructors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263016)