The completeness of S

Studia Logica 38 (2):137 - 147 (1979)
The subsystem S of Parry's AI [10] (obtained by omitting modus ponens for the material conditional) is axiomatized and shown to be strongly complete for a class of three valued Kripke style models. It is proved that S is weakly complete for the class of consistent models, and therefore that Ackermann's rule is admissible in S. It also happens that S is decidable and contains the Lewis system S4 on translation — though these results are not presented here. S is arguably the most relevant relevant logic known at this time to be decidable.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370438
 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: 15,831
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
J. Michael Dunn (1972). A Modification of Parry's Analytic Implication. Notre Dame Journal of Formal Logic 13 (2):195-205.

Add more references

Citations of this work BETA
Thomas Macaulay Ferguson (2014). A Computational Interpretation of Conceptivism. Journal of Applied Non-Classical Logics 24 (4):333-367.
Harry Deutsch (1984). Paraconsistent Analytic Implication. Journal of Philosophical Logic 13 (1):1 - 11.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

17 ( #156,749 of 1,724,747 )

Recent downloads (6 months)

6 ( #110,389 of 1,724,747 )

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.