The method of axiomatic rejection for the intuitionistic propositional logic

Studia Logica 48 (4):449 - 459 (1989)
Abstract
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
Options
 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: 25,683
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

Monthly downloads

Added to index

2009-01-28

Total downloads

10 ( #417,122 of 2,143,899 )

Recent downloads (6 months)

1 ( #387,257 of 2,143,899 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums