The method of axiomatic rejection for the intuitionistic propositional logic

Studia Logica 48 (4):449 - 459 (1989)
We prove that the intuitionistic sentential calculus is -decidable (decidable in the sense of ukasiewicz), i.e. the sets of theses of Int and of rejected formulas are disjoint and their union is equal to all formulas. A formula is rejected iff it is a sentential variable or is obtained from other formulas by means of three rejection rules. One of the rules is original, the remaining two are ukasiewicz's rejection rules: by detachement and by substitution. We extensively use the method of Beth's semantic tableaux.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370199
 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,974
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

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

7 ( #292,425 of 1,725,806 )

Recent downloads (6 months)

2 ( #268,283 of 1,725,806 )

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.