Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Matthias Baaz
2010 – today
- 2012
[j44]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability. Logical Methods in Computer Science 8(1) (2012)- [j43]Matthias Baaz, Oliver Fasching: Gödel logics with monotone operators. Fuzzy Sets and Systems 197: 3-13 (2012)
- [j42]Matthias Baaz, Stefan Hetzl, Daniel Weller: On the complexity of proof deskolemization. J. Symb. Log. 77(2): 669-686 (2012)
- [c59]Matthias Baaz, Ori Lahav, Anna Zamansky: Effective Finite-Valued Semantics for Labelled Calculi. IJCAR 2012: 52-66
- 2011
- [j41]Matthias Baaz, Stefan Hetzl: On the non-confluence of cut-elimination. J. Symb. Log. 76(1): 313-340 (2011)
- [j40]Matthias Baaz, Rosalie Iemhoff: Eskolemization in Intuitionistic Logic. J. Log. Comput. 21(4): 625-638 (2011)
- [j39]Matthias Baaz, Agata Ciabattoni, Norbert Preining: First-order satisfiability in Gödel logics: An NP-complete fragment. Theor. Comput. Sci. 412(47): 6612-6623 (2011)
- [j38]Matthias Baaz, Agata Ciabattoni, Norbert Preining: First-order satisfiability in Gödel logics: An NP-complete fragment. Theor. Comput. Sci. 412(47): 6612-6623 (2011)
- 2010
- [j37]Matthias Baaz, George Metcalfe: Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic. J. Log. Comput. 20(1): 35-54 (2010)
- [c58]Matthias Baaz, Christian G. Fermüller: A Resolution Mechanism for Prenex Gödel Logic. CSL 2010: 67-79
2000 – 2009
- 2009
- [j36]
- [j35]Matthias Baaz, Oliver Fasching: Note on witnessed Gödel logics with Delta. Ann. Pure Appl. Logic 161(2): 121-127 (2009)
- [j34]
- [c57]Matthias Baaz, Agata Ciabattoni, Norbert Preining: SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. WoLLIC 2009: 113-123
- 2008
- [j33]Matthias Baaz, Piotr Wojtylak: Generalizing proofs in monadic languages. Ann. Pure Appl. Logic 154(2): 71-138 (2008)
- [j32]Matthias Baaz, Rosalie Iemhoff: On Skolemization in constructive theories. J. Symb. Log. 73(3): 969-998 (2008)
- [j31]Matthias Baaz, Norbert Preining: Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type omega. J. Log. Comput. 18(4): 649-668 (2008)
- [j30]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: CERES: An analysis of Fürstenberg's proof of the infinity of primes. Theor. Comput. Sci. 403(2-3): 160-175 (2008)
- [c56]Matthias Baaz, Richard Zach: Effective Finite-Valued Approximations of General Propositional Logics. Pillars of Computer Science 2008: 107-129
- [c55]Matthias Baaz, George Metcalfe: Herbrand Theorems and Skolemization for Prenex Fuzzy Logics. CiE 2008: 22-31
- [c54]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Cut Elimination for First Order Gödel Logic by Hyperclause Resolution. LPAR 2008: 451-466
- 2007
- [j29]Matthias Baaz, Norbert Preining, Richard Zach: First-order Gödel logics. Ann. Pure Appl. Logic 147(1-2): 23-47 (2007)
- [c53]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. LPAR 2007: 77-91
- [c52]Matthias Baaz, George Metcalfe: Proof Theory for First Order Lukasiewicz Logic. TABLEAUX 2007: 28-42
- 2006
- [j28]Matthias Baaz, Georg Moser: Herbrand's theorem and term induction. Arch. Math. Log. 45(4): 447-503 (2006)
- [j27]Matthias Baaz, Rosalie Iemhoff: The Skolemization of existential quantifiers in intuitionistic logic. Ann. Pure Appl. Logic 142(1-3): 269-295 (2006)
- [j26]Matthias Baaz, Alexander Leitsch: Towards a clausal analysis of cut-elimination. J. Symb. Comput. 41(3-4): 381-410 (2006)
- [j25]Matthias Baaz, Rosalie Iemhoff: Gentzen Calculi for the Existence Predicate. Studia Logica 82(1): 7-23 (2006)
- [c51]Matthias Baaz: Note on Conditional Constructivity. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 25-29
- [c50]Matthias Baaz, Norbert Preining, Richard Zach: Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. ISMVL 2006: 9
- [c49]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Proof Transformation by CERES. MKM 2006: 82-93
- 2005
- [j24]
- [j23]Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek: Editorial. Logic Journal of the IGPL 13(4): 363 (2005)
- [j22]Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek: Editorial. Logic Journal of the IGPL 13(5): 491 (2005)
- [j21]
- [c48]Matthias Baaz, Rosalie Iemhoff: On the Proof Theory of the Existence Predicate. We Will Show Them! (1) 2005: 125-166
- [c47]
- [c46]
- 2004
- [j20]Matthias Baaz, Agata Ciabattoni, Franco Montagna: Analytic Calculi for Monoidal T-norm Based Logic. Fundam. Inform. 59(4): 315-332 (2004)
- [c45]
- [c44]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Cut-Elimination: Experiments with CERES. LPAR 2004: 481-495
- 2003
- [j19]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Hypersequent Calculi for Gödel Logics - a Survey. J. Log. Comput. 13(6): 835-861 (2003)
- [c43]Matthias Baaz, Norbert Preining, Richard Zach: Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. ISMVL 2003: 175-180
- [c42]Matthias Baaz, Christian G. Fermüller: A Translation Characterizing the Constructive Content of Classical Theories. LPAR 2003: 107-121
- [e2]Matthias Baaz, Johann A. Makowsky (Eds.): Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings. Lecture Notes in Computer Science 2803, Springer 2003, ISBN 3-540-40801-0
- 2002
- [c41]
- [c40]Matthias Baaz, Georg Moser: On Generalizations of Semi-terms of Particularly Simple Form. CSL 2002: 382-396
- [c39]
- [c38]Matthias Baaz, Agata Ciabattoni: A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. TABLEAUX 2002: 24-37
- [e1]Matthias Baaz, Andrei Voronkov (Eds.): Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings. Lecture Notes in Computer Science 2514, Springer 2002, ISBN 3-540-00010-0
- 2001
- [j18]Matthias Baaz, Petr Hájek, Franco Montagna, Helmut Veith: Complexity of t-tautologies. Ann. Pure Appl. Logic 113(1-3): 3-11 (2001)
- [p2]Matthias Baaz, Uwe Egly, Alexander Leitsch: Normal Form Transformations. Handbook of Automated Reasoning 2001: 273-333
- [p1]Matthias Baaz, Christian G. Fermüller, Gernot Salzer: Automated Deduction for Many-Valued Logics. Handbook of Automated Reasoning 2001: 1355-1402
- [c37]
- [c36]Matthias Baaz, Christian G. Fermüller: A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity. Proof Theory in Computer Science 2001: 38-48
- [c35]Matthias Baaz, Alexander Leitsch: Comparing the Complexity of Cut-Elimination Methods. Proof Theory in Computer Science 2001: 49-67
- [c34]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic. ISMVL 2001: 181-186
- [c33]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving. LPAR 2001: 201-215
- 2000
- [j17]Matthias Baaz, Alexander Leitsch: Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. 29(2): 149-177 (2000)
- [c32]Matthias Baaz, Richard Zach: Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. CSL 2000: 187-201
- [c31]Matthias Baaz, Agata Ciabattoni, Richard Zach: Quantified Propositional Gödel Logics. LPAR 2000: 240-256
- [c30]Matthias Baaz, Christian G. Fermüller, Helmut Veith: An Analytic Calculus for Quantified Propositional Gödel Logic. TABLEAUX 2000: 112-126
1990 – 1999
- 1999
- [j16]
- [j15]Matthias Baaz, Alexander Leitsch: Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Logic 97(1-3): 127-177 (1999)
- [j14]Matthias Baaz: Note on the Generalization of Calculations. Theor. Comput. Sci. 224(1-2): 3-11 (1999)
- [c29]Matthias Baaz, Alexander Leitsch, Georg Moser: System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216
- [c28]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith: On the Undecidability of some Sub-Classical First-Order Logics. FSTTCS 1999: 258-268
- [c27]
- 1998
- [j13]Matthias Baaz, Richard Zach: Note on generalizing theorems in algebraically closed fields. Arch. Math. Log. 37(5-6): 297-307 (1998)
- [j12]Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach: Labeled Calculi and Finite-Valued Logics. Studia Logica 61(1): 7-33 (1998)
- [j11]Matthias Baaz, Petr Hájek, David Svejda, Jan Krajícek: Embedding Logics into Product Logic. Studia Logica 61(1): 35-47 (1998)
- [c26]
- [c25]
- [c24]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith: Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. MFCS 1998: 203-212
- 1997
- [c23]Matthias Baaz, Uwe Egly, Christian G. Fermüller: Lean Induction Principles for Tableaux. TABLEAUX 1997: 62-75
- 1996
- [j10]Matthias Baaz, Norbert Brunner, Karl Svozil: The Axiom of Choice in Quantum Theory. Math. Log. Q. 42: 319-340 (1996)
- [j9]Matthias Baaz, Alexander Leitsch, Richard Zach: Completeness of a First-Order Temporal Logic with Time-Gaps. Theor. Comput. Sci. 160(1&2): 241-270 (1996)
- [c22]Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach: MUltlog 1.0: Towards an Expert System for Many-Valued Logics. CADE 1996: 226-230
- [c21]
- [c20]Matthias Baaz, Christian G. Fermüller: Intuitionistic Counterparts of Finitely-Valued Logics. ISMVL 1996: 136-
- [c19]Matthias Baaz, Christian G. Fermüller: Combining Many-valued and Intuitionistic Tableaux. TABLEAUX 1996: 65-79
- 1995
- [j8]Matthias Baaz, Richard Zach: Generalizing Theorems in Real Closed Fields. Ann. Pure Appl. Logic 75(1-2): 3-23 (1995)
- [j7]Matthias Baaz, Christian G. Fermüller: Resolution-Based Theorem Proving for Manyvalued Logics. J. Symb. Comput. 19(4): 353-391 (1995)
- [c18]Matthias Baaz, Alexander Leitsch, Richard Zach: Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL 1995: 1-15
- [c17]Matthias Baaz, Christian G. Fermüller: Non-elementary Speedups between Different Versions of Tableaux. TABLEAUX 1995: 217-230
- 1994
- [j6]Matthias Baaz, Alexander Leitsch: On Skolemization and Proof Complexity. Fundam. Inform. 20(4): 353-379 (1994)
- [c16]Matthias Baaz, Gernot Salzer: Semi-Unification and Generalizations of a Particularly Simple Form. CSL 1994: 106-120
- [c15]Matthias Baaz, Richard Zach: Approximating Propositional Calculi by Finite-Valued Logics. ISMVL 1994: 257-263
- [c14]Matthias Baaz, Karin Hörwein: A New Frame For Common-Sense Reasoning - Towards Local Inconsistencies. KI 1994: 392
- [c13]Matthias Baaz, Christian G. Fermüller, Alexander Leitsch: A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation. LICS 1994: 213-219
- 1993
- [j5]Matthias Baaz, Christian G. Fermüller, Richard Zach: Dual systems of sequents and tableaux for many-valued logics. Bulletin of the EATCS 49: 192-197 (1993)
- [j4]Matthias Baaz, Christian G. Fermüller, Richard Zach: Dual systems of sequents and tableaux for many-valued logics. Bulletin of the EATCS 51: 192-197 (1993)
- [j3]Matthias Baaz, Christian G. Fermüller, Richard Zach: Elimination of Cuts in First-order Finite-valued Logics. Elektronische Informationsverarbeitung und Kybernetik 29(6): 333-355 (1993)
- [c12]Matthias Baaz, Richard Zach: Short Proofs of Tautologies Using the Schema of Equivalence. CSL 1993: 33-35
- [c11]Matthias Baaz, Fernando Galindo, Gerald Quirchmayr, Manuel Vázqez: The Application of Kripke-Type Structures to Regional Development Programs. DEXA 1993: 523-528
- [c10]Matthias Baaz, Christian G. Fermüller, Richard Zach: Systematic Construction of Natural Deduction Systems for Many-Valued Logics. ISMVL 1993: 208-213
- [c9]Matthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach: MULTILOG: A System for Axiomatizing Many-valued Logics. LPAR 1993: 345-347
- 1992
- [j2]Matthias Baaz, Alexander Leitsch: Complexity of Resolution Proofs and Function Introduction. Ann. Pure Appl. Logic 57(3): 181-215 (1992)
- [j1]Matthias Baaz, Richard Zach: Note on calculi for a three-valued logic for logic programming.. Bulletin of the EATCS 48: 157-164 (1992)
- [c8]
- [c7]
- 1991
- [c6]Matthias Baaz, Gerald Quirchmayr: A Formal Model for the Support of Analogical Reasoning in Legal Expert Systems. DEXA 1991: 431-435
- 1990
- [c5]Matthias Baaz, Alexander Leitsch: A Strong Problem Reduction Method Based on Function Introduction. ISSAC 1990: 30-37
1980 – 1989
- 1989
- [c4]
- 1987
- [c3]Matthias Baaz, Alexander Leitsch: Strong splitting rules in automated theorem proving. EUROCAL 1987: 424-425
- [c2]Matthias Baaz: Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können. ÖGAI 1987: 176-181
- 1985
- [c1]Matthias Baaz, Alexander Leitsch: Eine Methode zur automatischen Problemreduktion. ÖGAI 1985: 154-163
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:32 CET by the dblp team