Sentential constants in systems near R

Studia Logica 52 (3):443 - 455 (1993)
An Ackermann constant is a formula of sentential logic built up from the sentential constant t by closing under connectives. It is known that there are only finitely many non-equivalent Ackermann constants in the relevant logic R. In this paper it is shown that the most natural systems close to R but weaker than it-in particular the non-distributive system LR and the modalised system NR-allow infinitely many Ackermann constants to be distinguished. The argument in each case proceeds by construction of an algebraic model, infinite in the case of LR and of arbitrary finite size in the case of NR. The search for these models was aided by the computer program MaGIC (Matrix Generator for Implication Connectives) developed by the author at the Australian National University.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01057657
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,664
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

8 ( #467,114 of 1,903,037 )

Recent downloads (6 months)

3 ( #264,928 of 1,903,037 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.