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
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,173
Through your library
References found in this work BETA
A Modification of Parry's Analytic Implication.J. Michael Dunn - 1972 - Notre Dame Journal of Formal Logic 13 (2):195-205.

Add more references

Citations of this work BETA
Logics of Nonsense and Parry Systems.Thomas Macaulay Ferguson - 2015 - Journal of Philosophical Logic 44 (1):65-80.
A Computational Interpretation of Conceptivism.Thomas Macaulay Ferguson - 2014 - Journal of Applied Non-Classical Logics 24 (4):333-367.
Correia Semantics Revisited.Thomas Macaulay Ferguson - 2016 - Studia Logica 104 (1):145-173.
Paraconsistent Analytic Implication.Harry Deutsch - 1984 - Journal of Philosophical Logic 13 (1):1 - 11.

View all 6 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

19 ( #253,807 of 2,152,503 )

Recent downloads (6 months)

1 ( #399,611 of 2,152,503 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums