Matthias Baaz - RankMe

146 papers A* 3A 4B 37C 7Misc 4Journal 67Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	An Analytic Representation of the Semantics of First-Order S5. FroCoS Matthias Baaz, Mariami Gamsakhurdia, Anela Lolic
2025	J	`jnl`	Skolemization In Intermediate Logics. CoRR Matthias Baaz, Mariami Gamsakhurdia, Rosalie Iemhoff, Raheleh Jalali
2025	J	`jnl`	Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics. CoRR Mariami Gamsakhurdia, Matthias Baaz, Anela Lolic
2024	J	`jnl`	90 years of Gödel's incompleteness theorems: Logic and computation. J. Log. Comput. Matthias Baaz, Marcel Ertel, Reinhard Kahle, Thomas Piecha, Jan von Plato
2024	J	`jnl`	Goedel logics: Prenex fragments. CoRR Matthias Baaz, Mariami Gamsakhurdia
2024	B	`conf`	On Translations of Epsilon Proofs to LK. LPAR Matthias Baaz, Anela Lolic
2023	C	`conf`	Effective Skolemization. WoLLIC Matthias Baaz, Anela Lolic
2022	Misc	`conf`	Andrews Skolemization May Shorten Resolution Proofs Non-elementarily. LFCS Matthias Baaz, Anela Lolic
2022	J	`jnl`	Epsilon theorems in Intermediate Logics. J. Symb. Log. Matthias Baaz, Richard Zach
2022	J	`jnl`	The number of axioms. Ann. Pure Appl. Log. Juan P. Aguilera, Matthias Baaz, Jan Bydzovsky
2022	J	`jnl`	Towards a proof theory for quantifier macros. Inf. Comput. Matthias Baaz, Anela Lolic
2021	J	`jnl`	Towards a proof theory for Henkin quantifiers. J. Log. Comput. Matthias Baaz, Anela Lolic
2020	Misc	`conf`	A Globally Sound Analytic Calculus for Henkin Quantifiers. LFCS Matthias Baaz, Anela Lolic
2020	J	`jnl`	An abstract form of the first epsilon theorem. J. Log. Comput. Matthias Baaz, Alexander Leitsch, Anela Lolic
2020	J	`jnl`	First-order interpolation derived from propositional interpolation. Theor. Comput. Sci. Matthias Baaz, Anela Lolic
2019	C	`conf`	Note on Globally Sound Analytic Calculi for Quantifier Macros. WoLLIC Matthias Baaz, Anela Lolic
2019	J	`jnl`	On the classification of first order Gödel logics. Ann. Pure Appl. Log. Matthias Baaz, Norbert Preining
2019	J	`jnl`	Unsound Inferences Make Proofs Shorter. J. Symb. Log. Juan P. Aguilera, Matthias Baaz
2018	Misc	`conf`	A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem. LFCS Matthias Baaz, Alexander Leitsch, Anela Lolic
2018	B	`conf`	Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic. LPAR Matthias Baaz, Anela Lolic
2017	—	`conf`	First-Order Interpolation of Non-classical Logics Derived from Propositional Interpolation. FroCoS Matthias Baaz, Anela Lolic
2017	B	`conf`	Gödel logics and the fully boxed fragment of LTL. LPAR Matthias Baaz, Norbert Preining
2017	J	`jnl`	On the Complexity of Translations from Classical to Intuitionistic Proofs. FLAP Matthias Baaz, Alexander Leitsch
2017	J	`jnl`	Preface. FLAP Matthias Baaz
2017	J	`jnl`	Preface. J. Log. Comput. Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Stefan Hetzl, Daniel Weller
2017	J	`jnl`	Ten problems in Gödel logic. Soft Comput. Juan P. Aguilera, Matthias Baaz
2016	C	`conf`	Cut Elimination for Gödel Logic with an Operator Adding a Constant. WoLLIC Juan P. Aguilera, Matthias Baaz
2016	J	`jnl`	Proof theory of witnessed Gödel logic: A negative result. J. Log. Comput. Matthias Baaz, Agata Ciabattoni
2016	J	`jnl`	Skolemization in intermediate logics with the finite model property. Log. J. IGPL Matthias Baaz, Rosalie Iemhoff
2016	J	`jnl`	Unsound Inferences Make Proofs Shorter. CoRR Juan P. Aguilera, Matthias Baaz
2015	A*	`conf`	A Note on the Complexity of Classical and Intuitionistic Proofs. LICS Matthias Baaz, Alexander Leitsch, Giselle Reis
2015	B	`conf`	Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic. CSL Matthias Baaz, Christian G. Fermüller
2014	J	`jnl`	Cut-Elimination: Syntax and Semantics. Stud Logica Matthias Baaz, Alexander Leitsch
2014	J	`jnl`	Monotone operators on Gödel logic. Arch. Math. Log. Oliver Fasching, Matthias Baaz
2014	A*	`conf`	Vienna Summer of Logic. KR Matthias Baaz, Thomas Eiter, Helmut Veith
2013	J	`jnl`	Finite-valued Semantics for Canonical Labelled Calculi. J. Autom. Reason. Matthias Baaz, Ori Lahav, Anna Zamansky
2013	—	`ed.`	Short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning, LPAR-17-short, Yogyakarta, Indonesia, October 10-15, 2010 LPAR short papers(Yogyakarta) Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz, Christian G. Fermüller
2012	A	`conf`	Effective Finite-Valued Semantics for Labelled Calculi. IJCAR Matthias Baaz, Ori Lahav, Anna Zamansky
2012	J	`jnl`	Gödel logics with monotone operators. Fuzzy Sets Syst. Matthias Baaz, Oliver Fasching
2012	J	`jnl`	On the complexity of proof deskolemization. J. Symb. Log. Matthias Baaz, Stefan Hetzl, Daniel Weller
2012	J	`jnl`	Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability Log. Methods Comput. Sci. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
2011	J	`jnl`	Eskolemization in Intuitionistic Logic. J. Log. Comput. Matthias Baaz, Rosalie Iemhoff
2011	J	`jnl`	First-order satisfiability in Gödel logics: An NP-complete fragment. Theor. Comput. Sci. Matthias Baaz, Agata Ciabattoni, Norbert Preining
2011	J	`jnl`	On the non-confluence of cut-elimination. J. Symb. Log. Matthias Baaz, Stefan Hetzl
2010	B	`conf`	A Resolution Mechanism for Prenex Gödel Logic. CSL Matthias Baaz, Christian G. Fermüller
2010	—	`conf`	Gödel logics with an operator shifting truth values. LPAR short papers(Yogyakarta) Matthias Baaz, Oliver Fasching
2010	J	`jnl`	Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic. J. Log. Comput. Matthias Baaz, George Metcalfe
2009	J	`jnl`	Foreword. Ann. Pure Appl. Log. Matthias Baaz
2009	J	`jnl`	Fuzzy Logic Corner. J. Log. Comput. Matthias Baaz, George Metcalfe
2009	J	`jnl`	Note on witnessed Gödel logics with Delta. Ann. Pure Appl. Log. Matthias Baaz, Oliver Fasching
2009	C	`conf`	SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. WoLLIC Matthias Baaz, Agata Ciabattoni, Norbert Preining
2008	J	`jnl`	CERES: An analysis of Fürstenberg's proof of the infinity of primes. Theor. Comput. Sci. Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
2008	B	`conf`	Cut Elimination for First Order Gödel Logic by Hyperclause Resolution. LPAR Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
2008	—	`conf`	Effective Finite-Valued Approximations of General Propositional Logics. Pillars of Computer Science Matthias Baaz, Richard Zach
2008	J	`jnl`	Generalizing proofs in monadic languages. Ann. Pure Appl. Log. Matthias Baaz, Piotr Wojtylak
2008	C	`conf`	Herbrand Theorems and Skolemization for Prenex Fuzzy Logics. CiE Matthias Baaz, George Metcalfe
2008	J	`jnl`	On Skolemization in constructive theories. J. Symb. Log. Matthias Baaz, Rosalie Iemhoff
2008	J	`jnl`	Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type omega. J. Log. Comput. Matthias Baaz, Norbert Preining
2007	J	`jnl`	First-order Gödel logics. Ann. Pure Appl. Log. Matthias Baaz, Norbert Preining, Richard Zach
2007	B	`conf`	Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. LPAR Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
2007	B	`conf`	Proof Theory for First Order Lukasiewicz Logic. TABLEAUX Matthias Baaz, George Metcalfe
2006	—	`conf`	Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. ISMVL Matthias Baaz, Norbert Preining, Richard Zach
2006	J	`jnl`	Gentzen Calculi for the Existence Predicate. Stud Logica Matthias Baaz, Rosalie Iemhoff
2006	J	`jnl`	Herbrand's theorem and term induction. Arch. Math. Log. Matthias Baaz, Georg Moser
2006	—	`conf`	Note on Conditional Constructivity. Algebraic and Proof-theoretic Aspects of Non-classical Logics Matthias Baaz
2006	—	`conf`	Proof Transformation by CERES. MKM Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
2006	J	`jnl`	The Skolemization of existential quantifiers in intuitionistic logic. Ann. Pure Appl. Log. Matthias Baaz, Rosalie Iemhoff
2006	J	`jnl`	Towards a clausal analysis of cut-elimination. J. Symb. Comput. Matthias Baaz, Alexander Leitsch
2005	J	`jnl`	Controlling witnesses. Ann. Pure Appl. Log. Matthias Baaz
2005	J	`jnl`	Editorial. Log. J. IGPL Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek
2005	J	`jnl`	Editorial. Log. J. IGPL Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek
2005	J	`jnl`	Editorial. J. Log. Comput. Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev
2005	B	`conf`	Note on Formal Analogical Reasoning in the Juridical Context. CSL Matthias Baaz
2005	B	`conf`	On Interpolation in Existence Logics. LPAR Matthias Baaz, Rosalie Iemhoff
2005	—	`conf`	On the Proof Theory of the Existence Predicate. We Will Show Them! (1) Matthias Baaz, Rosalie Iemhoff
2004	J	`jnl`	Analytic Calculi for Monoidal T-norm Based Logic. Fundam. Informaticae Matthias Baaz, Agata Ciabattoni, Franco Montagna
2004	B	`conf`	CERES in Many-Valued Logics. LPAR Matthias Baaz, Alexander Leitsch
2004	B	`conf`	Cut-Elimination: Experiments with CERES. LPAR Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
2003	B	`conf`	A Translation Characterizing the Constructive Content of Classical Theories. LPAR Matthias Baaz, Christian G. Fermüller
2003	—	`conf`	Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. ISMVL Matthias Baaz, Norbert Preining, Richard Zach
2003	B	`ed.`	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 CSL Matthias Baaz, Johann A. Makowsky
2003	J	`jnl`	Hypersequent Calculi for Gödel Logics - a Survey. J. Log. Comput. Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
2002	B	`conf`	A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. TABLEAUX Matthias Baaz, Agata Ciabattoni
2002	J	`jnl`	Foreword. Theor. Comput. Sci. Matthias Baaz, Georg Gottlob, Georg Moser
2002	B	`ed.`	Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings LPAR Matthias Baaz, Andrei Voronkov
2002	B	`conf`	On Generalizations of Semi-terms of Particularly Simple Form. CSL Matthias Baaz, Georg Moser
2002	A	`conf`	Proof Analysis by Resolution. CADE Matthias Baaz
2002	B	`conf`	Proof Analysis by Resolution. TABLEAUX Matthias Baaz
2001	—	`conf`	A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity. Proof Theory in Computer Science Matthias Baaz, Christian G. Fermüller
2001	—	`ch.`	Automated Deduction for Many-Valued Logics. Handbook of Automated Reasoning Matthias Baaz, Christian G. Fermüller, Gernot Salzer
2001	—	`conf`	Comparing the Complexity of Cut-Elimination Methods. Proof Theory in Computer Science Matthias Baaz, Alexander Leitsch
2001	J	`jnl`	Complexity of t-tautologies. Ann. Pure Appl. Log. Matthias Baaz, Petr Hájek, Franco Montagna, Helmut Veith
2001	—	`conf`	Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic. ISMVL Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
2001	B	`conf`	Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving. LPAR Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
2001	—	`ch.`	Normal Form Transformations. Handbook of Automated Reasoning Matthias Baaz, Uwe Egly, Alexander Leitsch
2001	B	`conf`	On a Generalisation of Herbrand's Theorem. CSL Matthias Baaz, Georg Moser
2000	B	`conf`	An Analytic Calculus for Quantified Propositional Gödel Logic. TABLEAUX Matthias Baaz, Christian G. Fermüller, Helmut Veith
2000	J	`jnl`	Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. Matthias Baaz, Alexander Leitsch
2000	B	`conf`	Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. CSL Matthias Baaz, Richard Zach
2000	B	`conf`	Quantified Propositional Gödel Logics. LPAR Matthias Baaz, Agata Ciabattoni, Richard Zach
1999	B	`conf`	Analytic Calculi for Projective Logics. TABLEAUX Matthias Baaz, Christian G. Fermüller
1999	J	`jnl`	Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Log. Matthias Baaz, Alexander Leitsch
1999	J	`jnl`	Interpolation in fuzzy logic. Arch. Math. Log. Matthias Baaz, Helmut Veith
1999	J	`jnl`	Note on the Generalization of Calculations. Theor. Comput. Sci. Matthias Baaz
1999	—	`conf`	On the Undecidability of some Sub-Classical First-Order Logics. FSTTCS Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith
1999	A	`conf`	System Description: CutRes 0.1: Cut Elimination by Resolution. CADE Matthias Baaz, Alexander Leitsch, Georg Moser
1998	—	`conf`	Compact Propositional Gödel Logics. ISMVL Matthias Baaz, Richard Zach
1998	J	`jnl`	Embedding Logics into Product Logic. Stud Logica Matthias Baaz, Petr Hájek, David Svejda, Jan Krajícek
1998	J	`jnl`	Labeled Calculi and Finite-Valued Logics. Stud Logica Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach
1998	J	`jnl`	Note on generalizing theorems in algebraically closed fields. Arch. Math. Log. Matthias Baaz, Richard Zach
1998	B	`conf`	Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. MFCS Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith
1998	B	`conf`	Quantifier Elimination in Fuzzy Logic. CSL Matthias Baaz, Helmut Veith
1997	B	`conf`	Lean Induction Principles for Tableaux. TABLEAUX Matthias Baaz, Uwe Egly, Christian G. Fermüller
1996	B	`conf`	Combining Many-valued and Intuitionistic Tableaux. TABLEAUX Matthias Baaz, Christian G. Fermüller
1996	J	`jnl`	Completeness of a First-Order Temporal Logic with Time-Gaps. Theor. Comput. Sci. Matthias Baaz, Alexander Leitsch, Richard Zach
1996	B	`conf`	Fast Cut-Elimination by Projection. CSL Matthias Baaz, Alexander Leitsch
1996	—	`conf`	Intuitionistic Counterparts of Finitely-Valued Logics. ISMVL Matthias Baaz, Christian G. Fermüller
1996	A	`conf`	MUltlog 1.0: Towards an Expert System for Many-Valued Logics. CADE Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach
1996	J	`jnl`	The Axiom of Choice in Quantum Theory. Math. Log. Q. Matthias Baaz, Norbert Brunner, Karl Svozil
1995	J	`jnl`	Generalizing Theorems in Real Closed Fields. Ann. Pure Appl. Log. Matthias Baaz, Richard Zach
1995	B	`conf`	Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL Matthias Baaz, Alexander Leitsch, Richard Zach
1995	B	`conf`	Non-elementary Speedups between Different Versions of Tableaux. TABLEAUX Matthias Baaz, Christian G. Fermüller
1995	J	`jnl`	Resolution-Based Theorem Proving for Manyvalued Logics. J. Symb. Comput. Matthias Baaz, Christian G. Fermüller
1994	Misc	`conf`	A New Frame For Common-Sense Reasoning - Towards Local Inconsistencies. KI Matthias Baaz, Karin Hörwein
1994	A*	`conf`	A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation LICS Matthias Baaz, Christian G. Fermüller, Alexander Leitsch
1994	—	`conf`	Approximating Propositional Calculi by Finite-Valued Logics. ISMVL Matthias Baaz, Richard Zach
1994	J	`jnl`	On Skolemization and Proof Complexity. Fundam. Informaticae Matthias Baaz, Alexander Leitsch
1994	B	`conf`	Semi-Unification and Generalizations of a Particularly Simple Form. CSL Matthias Baaz, Gernot Salzer
1993	J	`jnl`	Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS Matthias Baaz, Christian G. Fermüller, Richard Zach
1993	J	`jnl`	Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS Matthias Baaz, Christian G. Fermüller, Richard Zach
1993	J	`jnl`	Elimination of Cuts in First-order Finite-valued Logics. J. Inf. Process. Cybern. Matthias Baaz, Christian G. Fermüller, Richard Zach
1993	B	`conf`	MULTILOG: A System for Axiomatizing Many-valued Logics. LPAR Matthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach
1993	B	`conf`	Short Proofs of Tautologies Using the Schema of Equivalence. CSL Matthias Baaz, Richard Zach
1993	—	`conf`	Systematic Construction of Natural Deduction Systems for Many-Valued Logics. ISMVL Matthias Baaz, Christian G. Fermüller, Richard Zach
1993	C	`conf`	The Application of Kripke-Type Structures to Regional Development Programs. DEXA Matthias Baaz, Fernando Galindo, Gerald Quirchmayr, Manuel Vázqez
1992	B	`conf`	Algorithmic Structuring of Cut-free Proofs. CSL Matthias Baaz, Richard Zach
1992	J	`jnl`	Complexity of Resolution Proofs and Function Introduction. Ann. Pure Appl. Log. Matthias Baaz, Alexander Leitsch
1992	J	`jnl`	Note on calculi for a three-valued logic for logic programming.. Bull. EATCS Matthias Baaz, Richard Zach
1992	B	`conf`	Resolution for Many-Valued Logics. LPAR Matthias Baaz, Christian G. Fermüller
1991	C	`conf`	A Formal Model for the Support of Analogical Reasoning in Legal Expert Systems. DEXA Matthias Baaz, Gerald Quirchmayr
1990	B	`conf`	A Strong Problem Reduction Method Based on Function Introduction. ISSAC Matthias Baaz, Alexander Leitsch
1989	—	`conf`	An Effective Decision Algorithm for Propositional Temporal Logic. ÖGAI Matthias Baaz
1987	—	`conf`	Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können. ÖGAI Matthias Baaz
1987	—	`conf`	Strong splitting rules in automated theorem proving. EUROCAL Matthias Baaz, Alexander Leitsch
1986	J	`jnl`	Kripke-type semantics for da Costa's paraconsistent logic C Notre Dame J. Formal Log. Matthias Baaz
1985	—	`conf`	Eine Methode zur automatischen Problemreduktion. ÖGAI Matthias Baaz, Alexander Leitsch