Abstract
First of all, let us define the language of LC. Given a denumerable set P of primitive symbols, we let the set of formulae FormLC be the smallest set containing every primitive symbol and closed under “\”, “/”, and “•”, i.e., if A,B ∈ FormLC, then A\B, A/B, A•B ∈ FormLC. The set of sequents is the set of all expressions of the form A1, . . . , An ⇒ A0 where n is a positive integer and Ai ∈ FormLC for each i ≤ n. LC is given by the following axiom and rules of inference, where A, B, C stand for formulae and x, y, z stand for finite sequences of formulae including the empty sequence unless the contrary is asserted. Axiom: (0) A⇒ A .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
