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