Matthias Baaz

From MaRDI portal
Person:167059

Available identifiers

zbMath Open baaz.matthiasWikidataQ102122988 ScholiaQ102122988MaRDI QIDQ167059

List of research outcomes





PublicationDate of PublicationType
Incompleteness of a first-order Gödel logic and some temporal logics of programs2024-06-21Paper
Effective Skolemization2024-02-28Paper
Andrews Skolemization may shorten resolution proofs non-elementarily2022-07-01Paper
EPSILON THEOREMS IN INTERMEDIATE LOGICS2022-06-15Paper
Towards a proof theory for quantifier macros2022-06-13Paper
The number of axioms2022-04-01Paper
Towards a proof theory for Henkin quantifiers2022-02-08Paper
An abstract form of the first epsilon theorem2020-12-15Paper
First-order interpolation derived from propositional interpolation2020-08-25Paper
Note on the Benefit of Proof Representations by Name2020-08-10Paper
A globally sound analytic calculus for Henkin quantifiers2020-05-06Paper
Note on globally sound analytic calculi for quantifier macros2020-03-04Paper
Epsilon Theorems in Intermediate Logics2019-07-09Paper
Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic2019-07-04Paper
UNSOUND INFERENCES MAKE PROOFS SHORTER2019-03-15Paper
Lean induction principles for tableaux2019-01-15Paper
MUltlog 1.0: Towards an expert system for many-valued logics2019-01-15Paper
Combining many-valued and intuitionistic tableaux2019-01-10Paper
Gödel logics and the fully boxed fragment of LTL2019-01-10Paper
Skolemization in intermediate logics with the finite model property2019-01-08Paper
On the classification of first order Gödel logics2018-11-07Paper
A Note on the Complexity of Classical and Intuitionistic Proofs2018-04-23Paper
A sequent-calculus based formulation of the extended first epsilon theorem2018-04-06Paper
An interpolant in predicate G\"odel logic2018-03-08Paper
Ten problems in Gödel logic2018-02-23Paper
First-order interpolation of non-classical logics derived from propositional interpolation2018-01-04Paper
https://portal.mardi4nfdi.de/entity/Q53519522017-08-31Paper
Cut Elimination for Gödel Logic with an Operator Adding a Constant2016-09-09Paper
Proof theory of witnessed Gödel logic: a negative result2016-04-28Paper
Finite-valued semantics for canonical labelled calculi2015-06-23Paper
Cut-elimination: syntax and semantics2015-02-27Paper
Monotone operators on Gödel logic2014-05-12Paper
https://portal.mardi4nfdi.de/entity/Q54060382014-04-01Paper
Gödel logics with monotone operators2012-11-21Paper
Effective Finite-Valued Semantics for Labelled Calculi2012-09-05Paper
On the complexity of proof deskolemization2012-06-19Paper
Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability2012-04-03Paper
First-order satisfiability in Gödel logics: an NP-complete fragment2011-12-07Paper
Eskolemization in Intuitionistic Logic2011-10-21Paper
https://portal.mardi4nfdi.de/entity/Q30072452011-06-21Paper
https://portal.mardi4nfdi.de/entity/Q30010912011-05-31Paper
https://portal.mardi4nfdi.de/entity/Q29983802011-05-18Paper
Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving2011-05-06Paper
Strong splitting rules in automated theorem proving2011-04-16Paper
On the non-confluence of cut-elimination2011-03-18Paper
Methods of cut-elimination2010-11-30Paper
A Resolution Mechanism for Prenex Gödel Logic2010-09-03Paper
https://portal.mardi4nfdi.de/entity/Q34081332010-02-24Paper
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic2010-02-19Paper
Note on witnessed Gödel logics with Delta2009-11-04Paper
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability2009-07-02Paper
On Skolemization in constructive theories2009-03-23Paper
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution2009-01-27Paper
https://portal.mardi4nfdi.de/entity/Q35322752008-11-03Paper
CERES: An analysis of Fürstenberg's proof of the infinity of primes2008-09-16Paper
Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type2008-08-15Paper
Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).2008-06-23Paper
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics2008-06-19Paper
On Interpolation in Existence Logics2008-05-27Paper
Monadic Fragments of Gödel Logics: Decidability and Undecidability Results2008-05-15Paper
Effective Finite-Valued Approximations of General Propositional Logics2008-03-25Paper
Proof Theory for First Order Łukasiewicz Logic2008-01-04Paper
Note on Conditional Constructivity2007-11-15Paper
Towards a clausal analysis of cut-elimination2007-10-23Paper
Proof Transformation by CERES2007-09-05Paper
First-order Gödel logics2007-06-25Paper
Computer Science Logic2006-11-01Paper
The Skolemization of existential quantifiers in intuitionistic logic2006-09-14Paper
Herbrand's theorem and term induction2006-05-26Paper
Gentzen calculi for the existence predicate2006-03-17Paper
Logic for Programming, Artificial Intelligence, and Reasoning2005-11-10Paper
Logic for Programming, Artificial Intelligence, and Reasoning2005-11-10Paper
Controlling witnesses2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q46818972005-06-08Paper
https://portal.mardi4nfdi.de/entity/Q48257022004-11-05Paper
Hypersequent Calculi for Godel Logics -- a Survey2004-09-07Paper
https://portal.mardi4nfdi.de/entity/Q48090822004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44748332004-07-21Paper
https://portal.mardi4nfdi.de/entity/Q44504432004-02-15Paper
https://portal.mardi4nfdi.de/entity/Q44360252003-11-23Paper
https://portal.mardi4nfdi.de/entity/Q44360262003-11-23Paper
https://portal.mardi4nfdi.de/entity/Q44313862003-10-21Paper
https://portal.mardi4nfdi.de/entity/Q44128472003-07-17Paper
https://portal.mardi4nfdi.de/entity/Q44128492003-07-17Paper
https://portal.mardi4nfdi.de/entity/Q44118362003-07-10Paper
A natural deduction system for intuitionistic fuzzy logic2003-03-31Paper
Complexity of t-tautologies2003-03-06Paper
Characterization of the Axiomatizable Prenex Fragments of First-Order Goedel Logics2003-03-01Paper
https://portal.mardi4nfdi.de/entity/Q47833262002-12-04Paper
Automated deduction for many-valued logics2002-09-05Paper
Normal form transformations2002-08-27Paper
https://portal.mardi4nfdi.de/entity/Q27670232002-06-30Paper
Approximating Propositional Calculi by Finite-valued Logics2002-03-19Paper
https://portal.mardi4nfdi.de/entity/Q27536732001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45247792001-07-03Paper
https://portal.mardi4nfdi.de/entity/Q27211912001-07-01Paper
Labeled calculi and finite-valued logics2001-06-25Paper
Embedding logics into product logic2001-04-19Paper
Cut-elimination and redundancy-elimination by resolution2001-03-19Paper
https://portal.mardi4nfdi.de/entity/Q45252732001-01-22Paper
https://portal.mardi4nfdi.de/entity/Q45016772001-01-11Paper
https://portal.mardi4nfdi.de/entity/Q49449022000-09-05Paper
Cut normal forms and proof complexity2000-07-24Paper
https://portal.mardi4nfdi.de/entity/Q42638112000-03-29Paper
Note on the generalization of calculations2000-01-12Paper
Interpolation in fuzzy logic2000-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42630051999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42555051999-08-16Paper
https://portal.mardi4nfdi.de/entity/Q42181001999-03-02Paper
Note on generalizing theorems in algebraically closed fields1998-10-13Paper
https://portal.mardi4nfdi.de/entity/Q43801551998-06-14Paper
https://portal.mardi4nfdi.de/entity/Q43629081998-06-14Paper
The Axiom of Choice in Quantum Theory1997-08-19Paper
https://portal.mardi4nfdi.de/entity/Q48931331997-05-25Paper
Completeness of a first-order temporal logic with time-gaps1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48636901996-07-01Paper
Generalizing theorems in real closed fields1996-01-21Paper
Resolution-based theorem proving for many-valued logics1995-10-09Paper
https://portal.mardi4nfdi.de/entity/Q48401681995-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43047531994-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42832271994-08-28Paper
https://portal.mardi4nfdi.de/entity/Q42825351994-08-25Paper
https://portal.mardi4nfdi.de/entity/Q31425601994-01-09Paper
https://portal.mardi4nfdi.de/entity/Q31406311993-12-02Paper
https://portal.mardi4nfdi.de/entity/Q31406301993-11-28Paper
Complexity of resolution proofs and function introduction1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39765781992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q34691021988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47297591988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37804861987-01-01Paper
Kripke-type semantics for Da Costa's paraconsistent logic \(C_{\omega}\)1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37279491985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37469191985-01-01Paper
Epsilon Calculus Provides Shorter Cut-Free ProofsN/APaper

Research outcomes over time

This page was built for person: Matthias Baaz