The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthias Baaz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthias Baaz, Rosalie Iemhoff
    On the Proof Theory of the Existence Predicate. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:125-166 [Conf]
  2. Matthias Baaz
    Proof Analysis by Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:517-532 [Conf]
  3. Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach
    MUltlog 1.0: Towards an Expert System for Many-Valued Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:226-230 [Conf]
  4. Matthias Baaz, Alexander Leitsch, Georg Moser
    System Description: CutRes 0.1: Cut Elimination by Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:212-216 [Conf]
  5. Matthias Baaz, Gernot Salzer
    Semi-Unification and Generalizations of a Particularly Simple Form. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:106-120 [Conf]
  6. Matthias Baaz, Richard Zach
    Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:187-201 [Conf]
  7. Matthias Baaz, Helmut Veith
    Quantifier Elimination in Fuzzy Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:399-414 [Conf]
  8. Matthias Baaz, Richard Zach
    Algorithmic Structuring of Cut-free Proofs. [Citation Graph (0, 0)][DBLP]
    CSL, 1992, pp:29-42 [Conf]
  9. Matthias Baaz, Richard Zach
    Short Proofs of Tautologies Using the Schema of Equivalence. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:33-35 [Conf]
  10. Matthias Baaz, Alexander Leitsch, Richard Zach
    Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 1995, pp:1-15 [Conf]
  11. Matthias Baaz, Georg Moser
    On a Generalisation of Herbrand's Theorem. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:469-483 [Conf]
  12. Matthias Baaz, Georg Moser
    On Generalizations of Semi-terms of Particularly Simple Form. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:382-396 [Conf]
  13. Matthias Baaz
    Note on Formal Analogical Reasoning in the Juridical Context. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:18-26 [Conf]
  14. Matthias Baaz, Alexander Leitsch
    Fast Cut-Elimination by Projection. [Citation Graph (0, 0)][DBLP]
    CSL, 1996, pp:18-33 [Conf]
  15. Matthias Baaz, Christian G. Fermüller
    A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity. [Citation Graph (0, 0)][DBLP]
    Proof Theory in Computer Science, 2001, pp:38-48 [Conf]
  16. Matthias Baaz, Alexander Leitsch
    Comparing the Complexity of Cut-Elimination Methods. [Citation Graph (0, 0)][DBLP]
    Proof Theory in Computer Science, 2001, pp:49-67 [Conf]
  17. Matthias Baaz, Fernando Galindo, Gerald Quirchmayr, Manuel Vázqez
    The Application of Kripke-Type Structures to Regional Development Programs. [Citation Graph (0, 0)][DBLP]
    DEXA, 1993, pp:523-528 [Conf]
  18. Matthias Baaz, Gerald Quirchmayr
    A Formal Model for the Support of Analogical Reasoning in Legal Expert Systems. [Citation Graph (0, 0)][DBLP]
    DEXA, 1991, pp:431-435 [Conf]
  19. Matthias Baaz, Alexander Leitsch
    Strong splitting rules in automated theorem proving. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1987, pp:424-425 [Conf]
  20. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith
    On the Undecidability of some Sub-Classical First-Order Logics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:258-268 [Conf]
  21. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
    Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2001, pp:181-186 [Conf]
  22. Matthias Baaz, Christian G. Fermüller
    Intuitionistic Counterparts of Finitely-Valued Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1996, pp:136-0 [Conf]
  23. Matthias Baaz, Christian G. Fermüller, Richard Zach
    Systematic Construction of Natural Deduction Systems for Many-Valued Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1993, pp:208-213 [Conf]
  24. Matthias Baaz, Norbert Preining, Richard Zach
    Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2003, pp:175-180 [Conf]
  25. Matthias Baaz, Norbert Preining, Richard Zach
    Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2006, pp:9- [Conf]
  26. Matthias Baaz, Richard Zach
    Approximating Propositional Calculi by Finite-Valued Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1994, pp:257-263 [Conf]
  27. Matthias Baaz, Richard Zach
    Compact Propositional Gödel Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1998, pp:108-113 [Conf]
  28. Matthias Baaz, Alexander Leitsch
    A Strong Problem Reduction Method Based on Function Introduction. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:30-37 [Conf]
  29. Matthias Baaz, Karin Hörwein
    A New Frame For Common-Sense Reasoning - Towards Local Inconsistencies. [Citation Graph (0, 0)][DBLP]
    KI, 1994, pp:392- [Conf]
  30. Matthias Baaz, Christian G. Fermüller, Alexander Leitsch
    A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:213-219 [Conf]
  31. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
    Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:201-215 [Conf]
  32. Matthias Baaz, Agata Ciabattoni, Richard Zach
    Quantified Propositional Gödel Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:240-256 [Conf]
  33. Matthias Baaz, Christian G. Fermüller
    A Translation Characterizing the Constructive Content of Classical Theories. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:107-121 [Conf]
  34. Matthias Baaz, Christian G. Fermüller
    Resolution for Many-Valued Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:107-118 [Conf]
  35. Matthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach
    MULTILOG: A System for Axiomatizing Many-valued Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 1993, pp:345-347 [Conf]
  36. Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
    Cut-Elimination: Experiments with CERES. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:481-495 [Conf]
  37. Matthias Baaz, Rosalie Iemhoff
    On Interpolation in Existence Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:697-711 [Conf]
  38. Matthias Baaz, Alexander Leitsch
    CERES in Many-Valued Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:1-20 [Conf]
  39. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith
    Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:203-212 [Conf]
  40. Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
    Proof Transformation by CERES. [Citation Graph (0, 0)][DBLP]
    MKM, 2006, pp:82-93 [Conf]
  41. Matthias Baaz
    Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können. [Citation Graph (0, 0)][DBLP]
    ÖGAI, 1987, pp:176-181 [Conf]
  42. Matthias Baaz
    An Effective Decision Algorithm for Propositional Temporal Logic. [Citation Graph (0, 0)][DBLP]
    ÖGAI, 1989, pp:106-113 [Conf]
  43. Matthias Baaz, Alexander Leitsch
    Eine Methode zur automatischen Problemreduktion. [Citation Graph (0, 0)][DBLP]
    ÖGAI, 1985, pp:154-163 [Conf]
  44. Matthias Baaz
    Proof Analysis by Resolution. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2002, pp:1- [Conf]
  45. Matthias Baaz, Agata Ciabattoni
    A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2002, pp:24-37 [Conf]
  46. Matthias Baaz, Uwe Egly, Christian G. Fermüller
    Lean Induction Principles for Tableaux. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1997, pp:62-75 [Conf]
  47. Matthias Baaz, Christian G. Fermüller
    Non-elementary Speedups between Different Versions of Tableaux. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1995, pp:217-230 [Conf]
  48. Matthias Baaz, Christian G. Fermüller
    Combining Many-valued and Intuitionistic Tableaux. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1996, pp:65-79 [Conf]
  49. Matthias Baaz, Christian G. Fermüller
    Analytic Calculi for Projective Logics. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1999, pp:36-50 [Conf]
  50. Matthias Baaz, Christian G. Fermüller, Helmut Veith
    An Analytic Calculus for Quantified Propositional Gödel Logic. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2000, pp:112-126 [Conf]
  51. Matthias Baaz, Georg Moser
    Herbrand's theorem and term induction. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:4, pp:447-503 [Journal]
  52. Matthias Baaz
    Controlling witnesses. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:22-29 [Journal]
  53. Matthias Baaz, Petr Hájek, Franco Montagna, Helmut Veith
    Complexity of t-tautologies. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:3-11 [Journal]
  54. Matthias Baaz, Alexander Leitsch
    Complexity of Resolution Proofs and Function Introduction. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:57, n:3, pp:181-215 [Journal]
  55. Matthias Baaz, Alexander Leitsch
    Cut Normal Forms and Proof Complexity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:97, n:1-3, pp:127-177 [Journal]
  56. Matthias Baaz, Richard Zach
    Generalizing Theorems in Real Closed Fields. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:3-23 [Journal]
  57. Matthias Baaz, Rosalie Iemhoff
    The Skolemization of existential quantifiers in intuitionistic logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:269-295 [Journal]
  58. Matthias Baaz, Christian G. Fermüller, Richard Zach
    Dual systems of sequents and tableaux for many-valued logics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:51, n:, pp:192-197 [Journal]
  59. Matthias Baaz, Christian G. Fermüller, Richard Zach
    Dual systems of sequents and tableaux for many-valued logics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:49, n:, pp:192-197 [Journal]
  60. Matthias Baaz, Richard Zach
    Note on calculi for a three-valued logic for logic programming.. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:48, n:, pp:157-164 [Journal]
  61. Matthias Baaz, Christian G. Fermüller, Richard Zach
    Elimination of Cuts in First-order Finite-valued Logics. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1993, v:29, n:6, pp:333-355 [Journal]
  62. Matthias Baaz, Agata Ciabattoni, Franco Montagna
    Analytic Calculi for Monoidal T-norm Based Logic. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:59, n:4, pp:315-332 [Journal]
  63. Matthias Baaz, Alexander Leitsch
    On Skolemization and Proof Complexity. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:20, n:4, pp:353-379 [Journal]
  64. Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek
    Editorial. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2005, v:13, n:4, pp:363- [Journal]
  65. Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek
    Editorial. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2005, v:13, n:5, pp:491- [Journal]
  66. Matthias Baaz, Christian G. Fermüller
    Resolution-Based Theorem Proving for Manyvalued Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:19, n:4, pp:353-391 [Journal]
  67. Matthias Baaz, Alexander Leitsch
    Cut-elimination and Redundancy-elimination by Resolution. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:29, n:2, pp:149-177 [Journal]
  68. Matthias Baaz, Alexander Leitsch
    Towards a clausal analysis of cut-elimination. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2006, v:41, n:3-4, pp:381-410 [Journal]
  69. Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2005, v:15, n:4, pp:409- [Journal]
  70. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
    Hypersequent Calculi for Go"del Logics -- a Survey. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:6, pp:835-861 [Journal]
  71. Matthias Baaz, Norbert Brunner, Karl Svozil
    The Axiom of Choice in Quantum Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:319-340 [Journal]
  72. Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach
    Labeled Calculi and Finite-Valued Logics. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1998, v:61, n:1, pp:7-33 [Journal]
  73. Matthias Baaz, Petr Hájek, David Svejda, Jan Krajícek
    Embedding Logics into Product Logic. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1998, v:61, n:1, pp:35-47 [Journal]
  74. Matthias Baaz, Rosalie Iemhoff
    Gentzen Calculi for the Existence Predicate. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2006, v:82, n:1, pp:7-23 [Journal]
  75. Matthias Baaz
    Note on the Generalization of Calculations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:224, n:1-2, pp:3-11 [Journal]
  76. Matthias Baaz, Alexander Leitsch, Richard Zach
    Completeness of a First-Order Temporal Logic with Time-Gaps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:241-270 [Journal]
  77. Matthias Baaz
    Note on Conditional Constructivity. [Citation Graph (0, 0)][DBLP]
    Algebraic and Proof-theoretic Aspects of Non-classical Logics, 2006, pp:25-29 [Conf]
  78. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
    Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:77-91 [Conf]
  79. Matthias Baaz, George Metcalfe
    Proof Theory for First Order Lukasiewicz Logic. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2007, pp:28-42 [Conf]
  80. Matthias Baaz, Norbert Preining, Richard Zach
    First-order Gödel logics. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2007, v:147, n:1-2, pp:23-47 [Journal]

  81. Effective Finite-Valued Approximations of General Propositional Logics. [Citation Graph (, )][DBLP]


  82. Herbrand Theorems and Skolemization for Prenex Fuzzy Logics. [Citation Graph (, )][DBLP]


  83. A Resolution Mechanism for Prenex Gödel Logic. [Citation Graph (, )][DBLP]


  84. Cut Elimination for First Order Gödel Logic by Hyperclause Resolution. [Citation Graph (, )][DBLP]


  85. SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. [Citation Graph (, )][DBLP]


  86. Note on generalizing theorems in algebraically closed fields. [Citation Graph (, )][DBLP]


  87. Interpolation in fuzzy logic. [Citation Graph (, )][DBLP]


  88. Generalizing proofs in monadic languages. [Citation Graph (, )][DBLP]


  89. Foreword. [Citation Graph (, )][DBLP]


  90. Note on witnessed Gödel logics with Delta. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002