메뉴 건너뛰기




Volumn 69, Issue 2, 2001, Pages 197-219

Decomposition proof systems for gödel-dummett logics

Author keywords

Analytic rules; Decomposition Systems; Fuzzy Logics; Gentzen type systems; G del Logics; Hypersequents; Intermediate Logics; Tableaux

Indexed keywords


EID: 0348151994     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1013813806341     Document Type: Article
Times cited : (27)

References (16)
  • 1
    • 0000020502 scopus 로고    scopus 로고
    • Duplication-free Tableaux Calculi Together with Cut-free and Contraction-free Sequent Calculi for the Interpolable Propositional Intermediate Logics
    • Avellone, A., M. Ferrari, P. Miglioli. Duplication-free Tableaux Calculi Together with Cut-free and Contraction-free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic J. IGPL, 7:447-480, 1999.
    • (1999) Logic J. IGPL , vol.7 , pp. 447-480
    • Avellone, A.1    Ferrari, M.2    Miglioli, P.3
  • 2
    • 0001517353 scopus 로고
    • Using Hypersequents in Proof Systems for Non-classical Logics
    • Avron, A. Using Hypersequents in Proof Systems for Non-classical Logics. Annals of Mathematics and Artificial Intelligence, 4:225-248, 1991.
    • (1991) Annals of Mathematics and Artificial Intelligence , vol.4 , pp. 225-248
    • Avron, A.1
  • 3
    • 84886015254 scopus 로고    scopus 로고
    • A Tableaux System for Gödel-Dummett Logic Based on a Hypersequential Calculus
    • R. Dyckhoff, Ed. Springer Verlag
    • Avron, A. A Tableaux System for Gödel-Dummett Logic Based on a Hypersequential Calculus. In Proc. of TABLEA UX'2000, LNAI 1847 (R. Dyckhoff, Ed.) Springer Verlag, pp. 98-111, 2000.
    • (2000) Proc. of TABLEA UX'2000, LNAI 1847 , pp. 98-111
    • Avron, A.1
  • 4
    • 84957355949 scopus 로고    scopus 로고
    • Analytic Calculi for Projective Logics
    • Proc. of TABLEAUX'99, Springer-Verlag, Berlin
    • Baaz, M., G.G. Fermüller. Analytic Calculi for Projective Logics. In Proc. of TABLEAUX'99, LNCS 1617, pp. 36-50, Springer-Verlag, Berlin, 1999.
    • (1999) LNCS , vol.1617 , pp. 36-50
    • Baaz, M.1    Fermüller, G.G.2
  • 5
    • 84986865463 scopus 로고
    • Algebraic Completeness Results for Dummett's LC and its extensions
    • Dünn, J. M., R. K. Meyer. Algebraic Completeness Results for Dummett's LC and its extensions. Z. math. Logik und Grundlagen der Mathematik, 17:225-230, 1971.
    • (1971) Z. Math. Logik und Grundlagen der Mathematik , vol.17 , pp. 225-230
    • Dünn, J.M.1    Meyer, R.K.2
  • 6
    • 0001826588 scopus 로고
    • A Propositional Calculus with a Denumerable matrix
    • Dummett, M. A Propositional Calculus with a Denumerable matrix. Journal of Symbolic Logic, 24:96-107, 1959.
    • (1959) Journal of Symbolic Logic , vol.24 , pp. 96-107
    • Dummett, M.1
  • 7
    • 0000530595 scopus 로고    scopus 로고
    • A Deterministic Terminating Sequent Calculus for Gödel-Dummett Logic.Logzc
    • Dyckhoff, R. A Deterministic Terminating Sequent Calculus for Gödel-Dummett Logic.Logzc J. IGPL, 7:319-326, 1999.
    • (1999) J. IGPL , vol.7 , pp. 319-326
    • Dyckhoff, R.1
  • 8
    • 0003356102 scopus 로고
    • On the Intuitionistic Propositional Calculus, 1933
    • edited by S. Feferman et al, Oxford University Press
    • Gödel, K. On the Intuitionistic Propositional Calculus, 1933. In Collected Work, Vol. 1, edited by S. Feferman et al, Oxford University Press, 1986.
    • (1986) Collected Work , vol.1
    • Gödel, K.1
  • 10
    • 84957686353 scopus 로고    scopus 로고
    • Rasiowa-Sikorski deduction system: A handy tool for Computer Science Logic
    • Proceedings WADT'98, Springer-Verlag, Berlin
    • Konikowska, B. Rasiowa-Sikorski deduction system: a handy tool for Computer Science Logic. In Proceedings WADT'98, LNCS 1589, pp. 183-197, Springer-Verlag, Berlin, 1999.
    • (1999) LNCS , vol.1589 , pp. 183-197
    • Konikowska, B.1
  • 11
    • 0037125936 scopus 로고    scopus 로고
    • Rasiowa-Sikorski Deduction Systems in Computer Science Applications
    • Konikowska, B. Rasiowa-Sikorski Deduction Systems in Computer Science Applications. To appear in a Special Issue of Theoretical Computer Science.
    • Theoretical Computer Science , Issue.SPEC. ISSUE
    • Konikowska, B.1
  • 14
    • 0002380477 scopus 로고
    • A Gentzen-type Formulation of Some Intermediate Propositional Logics
    • Sonobe, O. A Gentzen-type Formulation of Some Intermediate Propositional Logics. Journal of Tsuda College, 7:7-14, 1975.
    • (1975) Journal of Tsuda College , vol.7 , pp. 7-14
    • Sonobe, O.1
  • 16
    • 0001740683 scopus 로고
    • On the Completeness Principle: A study of provability in Heyting's arithmetic
    • Visser, A. On the Completeness Principle: A study of provability in Heyting's arithmetic. Annals of Mathematical Logic, 22:263-295, 1982.
    • (1982) Annals of Mathematical Logic , vol.22 , pp. 263-295
    • Visser, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.