A Multiple-Conclusion Calculus for First-Order Gödel Logic

1. Avellone, A., Ferrari, M., Miglioli, P.: 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)

   Article  MATH  Google Scholar 

2. Avron, A.: Using Hypersequents in Proof Systems for Non-classical Logics. Annals of Mathematics and Artificial Intelligence 4, 225–248 (1991)

   Article  MathSciNet  MATH  Google Scholar 

3. Avron, A.: Gentzen-Type Systems, Resolution and Tableaux. Journal of Automated Reasoning 10, 265–281 (1993)

   Article  MathSciNet  MATH  Google Scholar 

4. Avron, A.: A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic. Journal of Logic and Computation (2009), doi:10.1093/logcom/exp055

   Google Scholar 

5. Avron, A., Konikowska, B.: Decomposition Proof Systems for Gödel Logics. Studia Logica 69, 197–219 (2001)

   Article  MathSciNet  MATH  Google Scholar 

6. Baaz, M., Ciabattoni, A., Fermüller, C.G.: Hypersequent Calculi for Gödel Logics - a Survey. Journal of Logic and Computation 13, 835–861 (2003)

   Article  MathSciNet  MATH  Google Scholar 

7. Baaz, M., Preining, N., Zach, R.: First-order Gödel Logics. Annals of Pure and Applied Logic 147, 23–47 (2007)

   Article  MathSciNet  MATH  Google Scholar 

8. Baaz, M., Zach, R.: Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 187–201. Springer, Heidelberg (2000)

   Chapter  Google Scholar 

9. Ciabattoni, A., Galatos, N., Terui, K.: From Axioms to Analytic Rules in Nonclassical Logics. In: Proceedings of LICS, pp. 229–240 (2008)

   Google Scholar 

10. Corsi, G.: Semantic Trees for Dummett’s Logic LC. Studia Logica 45, 199–206 (1986)

    Article  MathSciNet  MATH  Google Scholar 

11. Dyckhoff, D.: A Deterministic Terminating Sequent Calculus for Gödel-Dummett Logic. Logic J. IGPL 7, 319–326 (1999)

    Article  MATH  Google Scholar 

12. Dyckhoff, D., Negri, S.: Decision Methods for Linearly Ordered Heyting Algebras. Archive for Mathematical Logic 45, 411–422 (2006)

    Article  MathSciNet  MATH  Google Scholar 

13. Dummett, M.: A Propositional Calculus with a Denumerable matrix. Journal of Symbolic Logic 24, 96–107 (1959)

    Article  MathSciNet  MATH  Google Scholar 

14. Gabbay, D.: Semantical Investigations in Heyting’s Intuitionistic Logic. Reidel, Dordrechtz (1983)

    MATH  Google Scholar 

15. Gödel, K.: On the Intuitionistic Propositional Calculus. In: Feferman, S., et al. (eds.) Collected Work, vol. 1, Oxford University Press, Oxford (1986)

    Google Scholar 

16. Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)

    Book  MATH  Google Scholar 

17. Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer, Heidelberg (2009)

    MATH  Google Scholar 

18. Sonobe, O.: A Gentzen-type Formulation of Some Intermediate Propositional Logics. Journal of Tsuda College 7, 7–14 (1975)

    MathSciNet  Google Scholar 

19. Takano, M.: P Another proof of the strong completeness of the intuitionistic fuzzy logic. Tsukuba J. Math. 11, 851–866 (1984)

    MathSciNet  Google Scholar 

20. Takeuti, G.: Proof Theory. North-Holland, Amsterdam (1975)

    MATH  Google Scholar 

21. Takeuti, G., Titani, T.: Intuitionistic Fuzzy Logic and Intuitionistic Fuzzy Set Theory. Journal of Symbolic Logic 49, 851–866 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references