Abstract

AbstractThe paper provides a method for a uniform complete Hilbert‐style axiomatisation of Post's (m, u)‐conditionals and Post's negation, where m is the number of truth values and u is the number of designated truth values (cf. [5]). The main feature of the technique which we employ in this proof generalises the well‐known Kalmár Lemma which was used by its author in his completeness argument for the ordinary, two‐valued logic (cf. [2]).

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 call

Disclaimer: 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.