Studia Logica 52 (3):443 - 455 (1993)

Abstract
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
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,564
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

Sentential Constants in R and R⌝.Robert K. Meyer - 1986 - Studia Logica 45 (3):301 - 327.
3088 Varieties a Solution to the Ackermann Constant Problem.John K. Slaney - 1985 - Journal of Symbolic Logic 50 (2):487-501.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

3088 Varieties a Solution to the Ackermann Constant Problem.John K. Slaney - 1985 - Journal of Symbolic Logic 50 (2):487-501.
Contextual Deduction Theorems.J. G. Raftery - 2011 - Studia Logica 99 (1-3):279-319.
Sequent-Systems for Modal Logic.Kosta Došen - 1985 - Journal of Symbolic Logic 50 (1):149-168.
Algebraic Aspects of Deduction Theorems.Janusz Czelakowski - 1985 - Studia Logica 44 (4):369 - 387.
Protoalgebraic Logics.W. J. Blok & Don Pigozzi - 1986 - Studia Logica 45 (4):337 - 369.
Sentential Constants in R and R⌝.Robert K. Meyer - 1986 - Studia Logica 45 (3):301 - 327.

Analytics

Added to PP index
2009-01-28

Total views
29 ( #398,892 of 2,533,572 )

Recent downloads (6 months)
1 ( #390,861 of 2,533,572 )

How can I increase my downloads?

Downloads

My notes