S. Buss and G. Mints. The complexity of the disjunction and existential properties in intuitionistic logic. Annals of Pure and Applied Logic, 99(3):93-104, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Formal Framework for Synthesis and Verification of.. - Avellone, Ferrari.. (2000) (Correct)
.... However, the proofs of uniform constructivity of all the systems discussed in [6, 7] rely on extraction rules which are not suitable to get ecient proof search in ID(R; in particular, all these results involve the cut rule (for a discussion on the complexity of these extraction procedure see [2]) On the other hand, in [5] it is proved that ID(R; can be characterized as a goal oriented calculus for suitable proofs involving Hereditary Harrop Formulae (see [10] In Section 3, we will show that the SLD rule is sucient to decide the explicit de nability property and the disjunction ....
S. Buss and G. Mints. The complexity of the disjunction and existential properties in intuitionistic logic. Annals of Pure and Applied Logic, 99(3):93-104, 1999.
Complexity of the Intuitionistic Sequent Calculus - Goerdt (1998) (2 citations) (Correct)
.... The proof method we apply is the interpolation method as used most explicitly in [Pu 97] The conceptually new feature here is the use of a suitably modified cut elimination procedure for the intuitionistic sequent calculus.That cut elimination may be helpful in the present context can be seen in [BuMi 98] After the basic definitions we give a more detailed outline of our argument at the end of section 1. The details follow in section 2 and 3. 1 Definitions and outline We consider usual propositional formulas as built up from an infinite set of propositional variables with the connectives ; ....
....in LI, then Gamma implies A classically. 2)If Gamma implies A classically, then Gamma ) A is derivable in LI. If Gamma implies :A classically, then Gamma ) A is derivable in LI [Kl 52] p. 492. 3)Each derivation in LI can be transformed into one without the cut rule [Ta 87] In [BuMi 98] a different intuitionistic sequent calculus is given. It is not difficult to see that LI and the system of Buss,Mints can simulate each other efficiently. Note that the negation :A must be expressed in their system as A oe . Frege or Hilbert systems make only use of formulas instead of sequents. ....
[Article contains additional citation context not shown here]
Sam Buss and Grigori Mints. The complexity of the disjunction and existential properties in intuitionistic logic. Manuscript (1998).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC