An Axiomatisation of the Conditionals of Post's Many Valued Logics

Mathematical Logic Quarterly 41 (3):369-372 (1995)
  Copy   BIBTEX

Abstract

The paper provides a method for a uniform complete Hilbert-style axiomatisation of Post's -conditionals and Post's negation, where m is the number of truth values and u is the number of designated truth values . 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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

How to avoid deviance (in logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Process algebra with four-valued logic.Jan A. Bergstra & Alban Ponse - 2000 - Journal of Applied Non-Classical Logics 10 (1):27-53.
Note on a six-valued extension of three-valued logic.Josep M. Font & Massoud Moussavi - 1993 - Journal of Applied Non-Classical Logics 3 (2):173-187.
Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.
Three-valued logics in modal logic.Barteld Kooi & Allard Tamminga - 2013 - Studia Logica 101 (5):1061-1072.
Factor semantics forn-valued logics.A. S. Karpenko - 1983 - Studia Logica 42 (2-3):179 - 185.
Many-valued logics.Grzegorz Malinowski - 1993 - New York: Oxford University Press. Edited by L. Goble.

Analytics

Added to PP
2013-12-01

Downloads
15 (#893,994)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations