dblp.uni-trier.dewww.uni-trier.de

Matthias Baaz Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
95EEMatthias Baaz, Agata Ciabattoni, Norbert Preining: SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. WoLLIC 2009: 113-123
94EEMatthias Baaz: Foreword. Ann. Pure Appl. Logic 157(2-3): 63 (2009)
93EEMatthias Baaz, George Metcalfe: Fuzzy Logic Corner. J. Log. Comput. 19(2): 343 (2009)
2008
92EEMatthias Baaz, George Metcalfe: Herbrand Theorems and Skolemization for Prenex Fuzzy Logics. CiE 2008: 22-31
91EEMatthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Cut Elimination for First Order Gödel Logic by Hyperclause Resolution. LPAR 2008: 451-466
90EEMatthias Baaz, Richard Zach: Effective Finite-Valued Approximations of General Propositional Logics. Pillars of Computer Science 2008: 107-129
89EEMatthias Baaz, Piotr Wojtylak: Generalizing proofs in monadic languages. Ann. Pure Appl. Logic 154(2): 71-138 (2008)
88EEMatthias Baaz, Norbert Preining: Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type omega. J. Log. Comput. 18(4): 649-668 (2008)
87EEMatthias 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
86EEMatthias Baaz, Agata Ciabattoni, Christian G. Fermüller: Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. LPAR 2007: 77-91
85EEMatthias Baaz, George Metcalfe: Proof Theory for First Order Lukasiewicz Logic. TABLEAUX 2007: 28-42
84EEMatthias Baaz, Norbert Preining, Richard Zach: First-order Gödel logics. Ann. Pure Appl. Logic 147(1-2): 23-47 (2007)
2006
83EEMatthias Baaz: Note on Conditional Constructivity. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 25-29
82EEMatthias Baaz, Norbert Preining, Richard Zach: Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. ISMVL 2006: 9
81EEMatthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Proof Transformation by CERES. MKM 2006: 82-93
80EEMatthias Baaz, Rosalie Iemhoff: The Skolemization of existential quantifiers in intuitionistic logic. Ann. Pure Appl. Logic 142(1-3): 269-295 (2006)
79EEMatthias Baaz, Georg Moser: Herbrand's theorem and term induction. Arch. Math. Log. 45(4): 447-503 (2006)
78EEMatthias Baaz, Alexander Leitsch: Towards a clausal analysis of cut-elimination. J. Symb. Comput. 41(3-4): 381-410 (2006)
77EEMatthias Baaz, Rosalie Iemhoff: Gentzen Calculi for the Existence Predicate. Studia Logica 82(1): 7-23 (2006)
2005
76EEMatthias Baaz: Note on Formal Analogical Reasoning in the Juridical Context. CSL 2005: 18-26
75EEMatthias 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
73EEMatthias Baaz: Controlling witnesses. Ann. Pure Appl. Logic 136(1-2): 22-29 (2005)
72EESergei I. Adian, Matthias Baaz, Lev D. Beklemishev: Editorial. J. Log. Comput. 15(4): 409 (2005)
71EEMatthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek: Editorial. Logic Journal of the IGPL 13(4): 363 (2005)
70EEMatthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek: Editorial. Logic Journal of the IGPL 13(5): 491 (2005)
2004
69EEMatthias Baaz, Alexander Leitsch: CERES in Many-Valued Logics. LPAR 2004: 1-20
68EEMatthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr: Cut-Elimination: Experiments with CERES. LPAR 2004: 481-495
67EEMatthias 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
65EEMatthias Baaz, Norbert Preining, Richard Zach: Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. ISMVL 2003: 175-180
64EEMatthias Baaz, Christian G. Fermüller: A Translation Characterizing the Constructive Content of Classical Theories. LPAR 2003: 107-121
63EEMatthias 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
61EEMatthias Baaz: Proof Analysis by Resolution. CADE 2002: 517-532
60EEMatthias Baaz, Georg Moser: On Generalizations of Semi-terms of Particularly Simple Form. CSL 2002: 382-396
59EEMatthias Baaz: Proof Analysis by Resolution. TABLEAUX 2002: 1
58EEMatthias Baaz, Agata Ciabattoni: A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. TABLEAUX 2002: 24-37
2001
57EEMatthias 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
55EEMatthias 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
54EEMatthias 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
53EEMatthias 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
49EEMatthias Baaz, Richard Zach: Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. CSL 2000: 187-201
48EEMatthias 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
45EEMatthias Baaz, Alexander Leitsch, Georg Moser: System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216
44EEMatthias 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)
41EEMatthias Baaz, Helmut Veith: Interpolation in fuzzy logic. Arch. Math. Log. 38(7): 461-489 (1999)
40EEMatthias Baaz: Note on the Generalization of Calculations. Theor. Comput. Sci. 224(1-2): 3-11 (1999)
1998
39EEMatthias Baaz, Helmut Veith: Quantifier Elimination in Fuzzy Logic. CSL 1998: 399-414
38EEMatthias Baaz, Richard Zach: Compact Propositional Gödel Logics. ISMVL 1998: 108-113
37EEMatthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith: Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. MFCS 1998: 203-212
36EEMatthias 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
32EEMatthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach: MUltlog 1.0: Towards an Expert System for Many-Valued Logics. CADE 1996: 226-230
31EEMatthias Baaz, Alexander Leitsch: Fast Cut-Elimination by Projection. CSL 1996: 18-33
30EEMatthias 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)
27EEMatthias 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
26EEMatthias 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
22EEMatthias 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
17EEMatthias Baaz, Richard Zach: Short Proofs of Tautologies Using the Schema of Equivalence. CSL 1993: 33-35
16EEMatthias 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
14EEMatthias 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
10EEMatthias Baaz, Richard Zach: Algorithmic Structuring of Cut-free Proofs. CSL 1992: 29-42
9EEMatthias 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
5EEMatthias 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

Coauthor Index

1Sergei I. Adian [72]
2Lev D. Beklemishev [72]
3Norbert Brunner [28]
4Agata Ciabattoni [37] [44] [48] [55] [56] [58] [63] [67] [70] [71] [86] [91] [95]
5Uwe Egly [33] [51]
6Christian G. Fermüller [9] [11] [12] [13] [14] [15] [19] [23] [25] [29] [30] [32] [33] [34] [37] [43] [44] [47] [52] [54] [55] [56] [63] [64] [86] [91]
7Dov M. Gabbay [70] [71]
8Fernando Galindo [16]
9Petr Hájek [35] [50] [70] [71]
10Stefan Hetzl [68] [81] [87]
11Karin Hörwein [20]
12Rosalie Iemhoff [74] [75] [77] [80]
13Jan Krajícek [35]
14Alexander Leitsch [1] [2] [5] [8] [18] [19] [26] [27] [31] [42] [45] [46] [51] [53] [68] [69] [78] [81] [87]
15Johann A. Makowsky (Janos Makowsky) [66]
16George Metcalfe [85] [92] [93]
17Franco Montagna [50] [67]
18Georg Moser [45] [57] [60] [79]
19Arie Ovrutcki [14]
20Norbert Preining [65] [82] [84] [88] [95]
21Gerald Quirchmayr [6] [16]
22Clemens Richter [68] [81] [87]
23Gernot Salzer [22] [32] [34] [52]
24Hendrik Spohr [68] [81] [87]
25David Svejda [35]
26Karl Svozil [28]
27Manuel Vázqez [16]
28Helmut Veith [37] [39] [41] [44] [47] [50]
29Andrei Voronkov [62]
30Piotr Wojtylak [89]
31Richard Zach [7] [10] [11] [12] [13] [14] [15] [17] [21] [24] [26] [27] [32] [34] [36] [38] [48] [49] [65] [82] [84] [90]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)