×

On 2nd order intuitionistic propositional calculus with full comprehension. (English) Zbl 0289.02016


MSC:

03B55 Intermediate logics
03B25 Decidability of theories and sets of sentences
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Görnemann, S.: A logic stronger than intuitionism.JSL 1971, pp. 249–262. · Zbl 0276.02013
[2] Gabbay, D. M.: Applications of trees of intermediate logics.JSL 1972, pp. 135–138. · Zbl 0243.02019
[3] Gabbay, D. M.: Sufficient conditions for the undecidability of an intuitionistic theory.JSL 1972, pp. 375–384. · Zbl 0266.02026
[4] Gabbay, D. M.: The undecidability of the intuitionistic theories of algebraically closed and real closed fields.JSL 1973, pp. 86–92. · Zbl 0266.02027
[5] Gabbay, D.M.: Decidability of some intuitionistic predicate calcul.JSL 1972, pp. 579–587. · Zbl 0266.02025
[6] Fine, K.: Propositional quantifiers in modal logic.Theoria, Vol. 36, 1970, pp. 336–346. · Zbl 0302.02005 · doi:10.1111/j.1755-2567.1970.tb00432.x
[7] Schütte, K.:Vollständige Systeme modaler und intuitionistischer Logik. Springer 1968. · Zbl 0157.01602
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.