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)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,446
Through your library
References found in this work BETA

Add more references

Citations of this work BETA
Refutation Systems in Modal Logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.

Add more citations

Similar books and articles
Added to PP index

Total downloads
13 ( #398,718 of 2,226,330 )

Recent downloads (6 months)
2 ( #255,041 of 2,226,330 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature