Discriminator logics

Australasian Journal of Logic 11 (2) (2014)
  Copy   BIBTEX


A discriminator logic is the 1 -assertional logic of a discriminator variety V having two constant terms 0 and 1 such that V ⊨ 0 1 iff every member of V is trivial. Examples of such logics abound in the literature. The main result of this research announcement asserts that a certain non-Fregean deductive system SBPC, which closely resembles the classical propositional calculus, is canonical for the class of discriminator logics in the sense that any discriminator logic S can be presented as an axiomatic extension of SBPC by a set of extensional logical connectives taken from the language of S. The results outlined in this research announcement are extended to several generalisations of the class of discriminator logics in the main work.



    Upload a copy of this work     Papers currently archived: 93,069

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


Added to PP

14 (#1,019,789)

6 months
5 (#710,385)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The independence of connectives.Timothy Smiley - 1962 - Journal of Symbolic Logic 27 (4):426-436.
An Intriguing Logic with Two Implicational Connectives.Lloyd Humberstone - 2000 - Notre Dame Journal of Formal Logic 41 (1):1-40.
Modal-type orthomodular logic.Trixie Wagner & Andreas Schouml - forthcoming - Mathematical Logic Quarterly.

Add more references