iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.uni-trier.de/pid/32/2031.rss
dblp: Matthias Baaz https://dblp.org/pid/32/2031.html dblp person page RSS feed Wed, 16 Oct 2024 21:22:47 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Matthias Baazhttps://dblp.org/pid/32/2031.html14451 90 years of Gödel's incompleteness theorems: Logic and computation.https://doi.org/10.1093/logcom/exae026, , , , :
90 years of Gödel's incompleteness theorems: Logic and computation. J. Log. Comput. 34(6): 1003-1009 ()]]>https://dblp.org/rec/journals/logcom/BaazEKPP24Mon, 01 Jan 2024 00:00:00 +0100 On Translations of Epsilon Proofs to LK.https://doi.org/10.29007/9pts, :
On Translations of Epsilon Proofs to LK. LPAR : 232-245]]>https://dblp.org/rec/conf/lpar/BaazL24Mon, 01 Jan 2024 00:00:00 +0100 Goedel logics: Prenex fragments.https://doi.org/10.48550/arXiv.2407.16683, :
Goedel logics: Prenex fragments. CoRR abs/2407.16683 ()]]>https://dblp.org/rec/journals/corr/abs-2407-16683Mon, 01 Jan 2024 00:00:00 +0100 Effective Skolemization.https://doi.org/10.1007/978-3-031-39784-4_5, :
Effective Skolemization. WoLLIC : 69-82]]>https://dblp.org/rec/conf/wollic/BaazL23Sun, 01 Jan 2023 00:00:00 +0100 The number of axioms.https://doi.org/10.1016/j.apal.2021.103078, , :
The number of axioms. Ann. Pure Appl. Log. 173(5): 103078 ()]]>https://dblp.org/rec/journals/apal/AguileraBB22Sat, 01 Jan 2022 00:00:00 +0100 Towards a proof theory for quantifier macros.https://doi.org/10.1016/j.ic.2021.104753, :
Towards a proof theory for quantifier macros. Inf. Comput. 287: 104753 ()]]>https://dblp.org/rec/journals/iandc/BaazL22Sat, 01 Jan 2022 00:00:00 +0100 Epsilon theorems in Intermediate Logics.https://doi.org/10.1017/jsl.2021.103, :
Epsilon theorems in Intermediate Logics. J. Symb. Log. 87(2): 682-720 ()]]>https://dblp.org/rec/journals/jsyml/BaazZ22Sat, 01 Jan 2022 00:00:00 +0100 Andrews Skolemization May Shorten Resolution Proofs Non-elementarily.https://doi.org/10.1007/978-3-030-93100-1_2, :
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily. LFCS : 9-24]]>https://dblp.org/rec/conf/lfcs/BaazL22Sat, 01 Jan 2022 00:00:00 +0100 Towards a proof theory for Henkin quantifiers.https://doi.org/10.1093/logcom/exaa071, :
Towards a proof theory for Henkin quantifiers. J. Log. Comput. 31(1): 40-66 ()]]>https://dblp.org/rec/journals/logcom/BaazL21Fri, 01 Jan 2021 00:00:00 +0100 An abstract form of the first epsilon theorem.https://doi.org/10.1093/logcom/exaa044, , :
An abstract form of the first epsilon theorem. J. Log. Comput. 30(8): 1447-1468 ()]]>https://dblp.org/rec/journals/logcom/BaazLL20Wed, 01 Jan 2020 00:00:00 +0100 First-order interpolation derived from propositional interpolation.https://doi.org/10.1016/j.tcs.2020.07.043, :
First-order interpolation derived from propositional interpolation. Theor. Comput. Sci. 837: 209-222 ()]]>https://dblp.org/rec/journals/tcs/BaazL20Wed, 01 Jan 2020 00:00:00 +0100 A Globally Sound Analytic Calculus for Henkin Quantifiers.https://doi.org/10.1007/978-3-030-36755-8_9, :
A Globally Sound Analytic Calculus for Henkin Quantifiers. LFCS : 128-143]]>https://dblp.org/rec/conf/lfcs/BaazL20Wed, 01 Jan 2020 00:00:00 +0100 On the classification of first order Gödel logics.https://doi.org/10.1016/j.apal.2018.08.010, :
On the classification of first order Gödel logics. Ann. Pure Appl. Log. 170(1): 36-57 ()]]>https://dblp.org/rec/journals/apal/BaazP19Tue, 01 Jan 2019 00:00:00 +0100 Unsound Inferences Make Proofs Shorter.https://doi.org/10.1017/jsl.2018.51, :
Unsound Inferences Make Proofs Shorter. J. Symb. Log. 84(1): 102-122 ()]]>https://dblp.org/rec/journals/jsyml/AguileraB19Tue, 01 Jan 2019 00:00:00 +0100 Note on Globally Sound Analytic Calculi for Quantifier Macros.https://doi.org/10.1007/978-3-662-59533-6_29, :
Note on Globally Sound Analytic Calculi for Quantifier Macros. WoLLIC : 486-497]]>https://dblp.org/rec/conf/wollic/BaazL19Tue, 01 Jan 2019 00:00:00 +0100 A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem.https://doi.org/10.1007/978-3-319-72056-2_4, , :
A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem. LFCS : 55-71]]>https://dblp.org/rec/conf/lfcs/BaazLL18Mon, 01 Jan 2018 00:00:00 +0100 Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic.https://doi.org/10.29007/bmlf, :
Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic. LPAR : 95-110]]>https://dblp.org/rec/conf/lpar/BaazL18Mon, 01 Jan 2018 00:00:00 +0100 On the Complexity of Translations from Classical to Intuitionistic Proofs.http://www.collegepublications.co.uk/downloads/ifcolog00013.pdf, :
On the Complexity of Translations from Classical to Intuitionistic Proofs. FLAP 4(4) ()]]>https://dblp.org/rec/journals/flap/BaazL17Sun, 01 Jan 2017 00:00:00 +0100 Preface.http://collegepublications.co.uk/ifcolog/?00019:
Preface. FLAP 4(10): 3117-3126 ()]]>https://dblp.org/rec/journals/flap/Baaz17Sun, 01 Jan 2017 00:00:00 +0100 Preface.https://doi.org/10.1093/logcom/exu076, , , , :
Preface. J. Log. Comput. 27(2): 415 ()]]>https://dblp.org/rec/journals/logcom/BaazCGHW17Sun, 01 Jan 2017 00:00:00 +0100 Ten problems in Gödel logic.https://doi.org/10.1007/s00500-016-2366-9, :
Ten problems in Gödel logic. Soft Comput. 21(1): 149-152 ()]]>https://dblp.org/rec/journals/soco/AguileraB17Sun, 01 Jan 2017 00:00:00 +0100 First-Order Interpolation of Non-classical Logics Derived from Propositional Interpolation.https://doi.org/10.1007/978-3-319-66167-4_15, :
First-Order Interpolation of Non-classical Logics Derived from Propositional Interpolation. FroCoS : 265-280]]>https://dblp.org/rec/conf/frocos/BaazL17Sun, 01 Jan 2017 00:00:00 +0100 Gödel logics and the fully boxed fragment of LTL.https://doi.org/10.29007/bdbm, :
Gödel logics and the fully boxed fragment of LTL. LPAR : 404-416]]>https://dblp.org/rec/conf/lpar/BaazP17Sun, 01 Jan 2017 00:00:00 +0100 Skolemization in intermediate logics with the finite model property.https://doi.org/10.1093/jigpal/jzw010, :
Skolemization in intermediate logics with the finite model property. Log. J. IGPL 24(3): 224-237 ()]]>https://dblp.org/rec/journals/igpl/BaazI16Fri, 01 Jan 2016 00:00:00 +0100 Proof theory of witnessed Gödel logic: A negative result.https://doi.org/10.1093/logcom/ext018, :
Proof theory of witnessed Gödel logic: A negative result. J. Log. Comput. 26(1): 51-64 ()]]>https://dblp.org/rec/journals/logcom/BaazC16Fri, 01 Jan 2016 00:00:00 +0100 Cut Elimination for Gödel Logic with an Operator Adding a Constant.https://doi.org/10.1007/978-3-662-52921-8_3, :
Cut Elimination for Gödel Logic with an Operator Adding a Constant. WoLLIC : 36-51]]>https://dblp.org/rec/conf/wollic/AguileraB16Fri, 01 Jan 2016 00:00:00 +0100 Unsound Inferences Make Proofs Shorter.http://arxiv.org/abs/1608.07703, :
Unsound Inferences Make Proofs Shorter. CoRR abs/1608.07703 ()]]>https://dblp.org/rec/journals/corr/AguileraB16Fri, 01 Jan 2016 00:00:00 +0100 Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic.https://doi.org/10.4230/LIPIcs.CSL.2015.94, :
Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic. CSL : 94-109]]>https://dblp.org/rec/conf/csl/BaazF15Thu, 01 Jan 2015 00:00:00 +0100 A Note on the Complexity of Classical and Intuitionistic Proofs.https://doi.org/10.1109/LICS.2015.66, , :
A Note on the Complexity of Classical and Intuitionistic Proofs. LICS : 657-666]]>https://dblp.org/rec/conf/lics/BaazLR15Thu, 01 Jan 2015 00:00:00 +0100 Monotone operators on Gödel logic.https://doi.org/10.1007/s00153-013-0365-4, :
Monotone operators on Gödel logic. Arch. Math. Log. 53(3-4): 261-284 ()]]>https://dblp.org/rec/journals/aml/FaschingB14Wed, 01 Jan 2014 00:00:00 +0100 Cut-Elimination: Syntax and Semantics.https://doi.org/10.1007/s11225-014-9563-2, :
Cut-Elimination: Syntax and Semantics. Stud Logica 102(6): 1217-1244 ()]]>https://dblp.org/rec/journals/sLogica/BaazL14Wed, 01 Jan 2014 00:00:00 +0100 Vienna Summer of Logic.http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/8701, , :
Vienna Summer of Logic. KR ]]>https://dblp.org/rec/conf/kr/BaazEV14Wed, 01 Jan 2014 00:00:00 +0100 Finite-valued Semantics for Canonical Labelled Calculi.https://doi.org/10.1007/s10817-013-9273-x, , :
Finite-valued Semantics for Canonical Labelled Calculi. J. Autom. Reason. 51(4): 401-430 ()]]>https://dblp.org/rec/journals/jar/BaazLZ13Tue, 01 Jan 2013 00:00:00 +0100 Short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning, LPAR-17-short, Yogyakarta, Indonesia, October 10-15, 2010.https://easychair.org/publications/volume/LPAR-17-short, , , :
Short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning, LPAR-17-short, Yogyakarta, Indonesia, October 10-15, 2010. EPiC Series in Computing 13, EasyChair [contents]]]>https://dblp.org/rec/conf/lpar/2010ysTue, 01 Jan 2013 00:00:00 +0100 Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability.https://doi.org/10.2168/LMCS-8(1:20)2012, , :
Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability. Log. Methods Comput. Sci. 8(1) ()]]>https://dblp.org/rec/journals/corr/abs-1202-6352Sun, 01 Jan 2012 00:00:00 +0100 Gödel logics with monotone operators.https://doi.org/10.1016/j.fss.2011.04.012, :
Gödel logics with monotone operators. Fuzzy Sets Syst. 197: 3-13 ()]]>https://dblp.org/rec/journals/fss/BaazF12Sun, 01 Jan 2012 00:00:00 +0100 On the complexity of proof deskolemization.https://doi.org/10.2178/jsl/1333566645, , :
On the complexity of proof deskolemization. J. Symb. Log. 77(2): 669-686 ()]]>https://dblp.org/rec/journals/jsyml/BaazHW12Sun, 01 Jan 2012 00:00:00 +0100 Effective Finite-Valued Semantics for Labelled Calculi.https://doi.org/10.1007/978-3-642-31365-3_7, , :
Effective Finite-Valued Semantics for Labelled Calculi. IJCAR : 52-66]]>https://dblp.org/rec/conf/cade/BaazLZ12Sun, 01 Jan 2012 00:00:00 +0100 On the non-confluence of cut-elimination.https://doi.org/10.2178/jsl/1294171002, :
On the non-confluence of cut-elimination. J. Symb. Log. 76(1): 313-340 ()]]>https://dblp.org/rec/journals/jsyml/BaazH11Sat, 01 Jan 2011 00:00:00 +0100 Eskolemization in Intuitionistic Logic.https://doi.org/10.1093/logcom/exp040, :
Eskolemization in Intuitionistic Logic. J. Log. Comput. 21(4): 625-638 ()]]>https://dblp.org/rec/journals/logcom/BaazI11Sat, 01 Jan 2011 00:00:00 +0100 First-order satisfiability in Gödel logics: An NP-complete fragment.https://doi.org/10.1016/j.tcs.2011.07.015, , :
First-order satisfiability in Gödel logics: An NP-complete fragment. Theor. Comput. Sci. 412(47): 6612-6623 ()]]>https://dblp.org/rec/journals/tcs/BaazCP11Sat, 01 Jan 2011 00:00:00 +0100 Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic.https://doi.org/10.1093/logcom/exn059, :
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic. J. Log. Comput. 20(1): 35-54 ()]]>https://dblp.org/rec/journals/logcom/BaazM10Fri, 01 Jan 2010 00:00:00 +0100 A Resolution Mechanism for Prenex Gödel Logic.https://doi.org/10.1007/978-3-642-15205-4_9, :
A Resolution Mechanism for Prenex Gödel Logic. CSL : 67-79]]>https://dblp.org/rec/conf/csl/BaazF10Fri, 01 Jan 2010 00:00:00 +0100 Gödel logics with an operator shifting truth values.https://doi.org/10.29007/1gvp, :
Gödel logics with an operator shifting truth values. LPAR short papers(Yogyakarta) : 13-14]]>https://dblp.org/rec/conf/lpar/BaazF10Fri, 01 Jan 2010 00:00:00 +0100 Foreword.https://doi.org/10.1016/j.apal.2008.09.016:
Foreword. Ann. Pure Appl. Log. 157(2-3): 63 ()]]>https://dblp.org/rec/journals/apal/Baaz09Thu, 01 Jan 2009 00:00:00 +0100 Note on witnessed Gödel logics with Delta.https://doi.org/10.1016/j.apal.2009.05.011, :
Note on witnessed Gödel logics with Delta. Ann. Pure Appl. Log. 161(2): 121-127 ()]]>https://dblp.org/rec/journals/apal/BaazF09Thu, 01 Jan 2009 00:00:00 +0100 Fuzzy Logic Corner.https://doi.org/10.1093/logcom/exn053, :
Fuzzy Logic Corner. J. Log. Comput. 19(2): 343 ()]]>https://dblp.org/rec/journals/logcom/BaazM09Thu, 01 Jan 2009 00:00:00 +0100 SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability.https://doi.org/10.1007/978-3-642-02261-6_10, , :
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. WoLLIC : 113-123]]>https://dblp.org/rec/conf/wollic/BaazCP09Thu, 01 Jan 2009 00:00:00 +0100 Generalizing proofs in monadic languages.https://doi.org/10.1016/j.apal.2007.10.010, :
Generalizing proofs in monadic languages. Ann. Pure Appl. Log. 154(2): 71-138 ()]]>https://dblp.org/rec/journals/apal/BaazW08Tue, 01 Jan 2008 00:00:00 +0100 On Skolemization in constructive theories.https://doi.org/10.2178/jsl/1230396760, :
On Skolemization in constructive theories. J. Symb. Log. 73(3): 969-998 ()]]>https://dblp.org/rec/journals/jsyml/BaazI08Tue, 01 Jan 2008 00:00:00 +0100 Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type omega.https://doi.org/10.1093/logcom/exn004, :
Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type omega. J. Log. Comput. 18(4): 649-668 ()]]>https://dblp.org/rec/journals/logcom/BaazP08Tue, 01 Jan 2008 00:00:00 +0100 CERES: An analysis of Fürstenberg's proof of the infinity of primes.https://doi.org/10.1016/j.tcs.2008.02.043, , , , :
CERES: An analysis of Fürstenberg's proof of the infinity of primes. Theor. Comput. Sci. 403(2-3): 160-175 ()]]>https://dblp.org/rec/journals/tcs/BaazHLRS08Tue, 01 Jan 2008 00:00:00 +0100 Effective Finite-Valued Approximations of General Propositional Logics.https://doi.org/10.1007/978-3-540-78127-1_7, :
Effective Finite-Valued Approximations of General Propositional Logics. Pillars of Computer Science : 107-129]]>https://dblp.org/rec/conf/birthday/BaazZ08Tue, 01 Jan 2008 00:00:00 +0100 Herbrand Theorems and Skolemization for Prenex Fuzzy Logics.https://doi.org/10.1007/978-3-540-69407-6_3, :
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics. CiE : 22-31]]>https://dblp.org/rec/conf/cie/BaazM08Tue, 01 Jan 2008 00:00:00 +0100 Cut Elimination for First Order Gödel Logic by Hyperclause Resolution.https://doi.org/10.1007/978-3-540-89439-1_32, , :
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution. LPAR : 451-466]]>https://dblp.org/rec/conf/lpar/BaazCF08Tue, 01 Jan 2008 00:00:00 +0100 First-order Gödel logics.https://doi.org/10.1016/j.apal.2007.03.001, , :
First-order Gödel logics. Ann. Pure Appl. Log. 147(1-2): 23-47 ()]]>https://dblp.org/rec/journals/apal/BaazPZ07Mon, 01 Jan 2007 00:00:00 +0100 Monadic Fragments of Gödel Logics: Decidability and Undecidability Results.https://doi.org/10.1007/978-3-540-75560-9_8, , :
Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. LPAR : 77-91]]>https://dblp.org/rec/conf/lpar/BaazCF07Mon, 01 Jan 2007 00:00:00 +0100 Proof Theory for First Order Lukasiewicz Logic.https://doi.org/10.1007/978-3-540-73099-6_5, :
Proof Theory for First Order Lukasiewicz Logic. TABLEAUX : 28-42]]>https://dblp.org/rec/conf/tableaux/BaazM07Mon, 01 Jan 2007 00:00:00 +0100 Herbrand's theorem and term induction.https://doi.org/10.1007/s00153-005-0327-6, :
Herbrand's theorem and term induction. Arch. Math. Log. 45(4): 447-503 ()]]>https://dblp.org/rec/journals/aml/BaazM06Sun, 01 Jan 2006 00:00:00 +0100 The Skolemization of existential quantifiers in intuitionistic logic.https://doi.org/10.1016/j.apal.2006.02.001, :
The Skolemization of existential quantifiers in intuitionistic logic. Ann. Pure Appl. Log. 142(1-3): 269-295 ()]]>https://dblp.org/rec/journals/apal/BaazI06Sun, 01 Jan 2006 00:00:00 +0100 Towards a clausal analysis of cut-elimination.https://doi.org/10.1016/j.jsc.2003.10.005, :
Towards a clausal analysis of cut-elimination. J. Symb. Comput. 41(3-4): 381-410 ()]]>https://dblp.org/rec/journals/jsc/BaazL06Sun, 01 Jan 2006 00:00:00 +0100 Gentzen Calculi for the Existence Predicate.https://doi.org/10.1007/s11225-006-6603-6, :
Gentzen Calculi for the Existence Predicate. Stud Logica 82(1): 7-23 ()]]>https://dblp.org/rec/journals/sLogica/BaazI06Sun, 01 Jan 2006 00:00:00 +0100 Note on Conditional Constructivity.https://doi.org/10.1007/978-3-540-75939-3_2:
Note on Conditional Constructivity. Algebraic and Proof-theoretic Aspects of Non-classical Logics : 25-29]]>https://dblp.org/rec/conf/birthday/Baaz06Sun, 01 Jan 2006 00:00:00 +0100 Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta.https://doi.org/10.1109/ISMVL.2006.16, , :
Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. ISMVL : 9]]>https://dblp.org/rec/conf/ismvl/BaazPZ06Sun, 01 Jan 2006 00:00:00 +0100 Proof Transformation by CERES.https://doi.org/10.1007/11812289_8, , , , :
Proof Transformation by CERES. MKM : 82-93]]>https://dblp.org/rec/conf/mkm/BaazHLRS06Sun, 01 Jan 2006 00:00:00 +0100 Controlling witnesses.https://doi.org/10.1016/j.apal.2005.05.003:
Controlling witnesses. Ann. Pure Appl. Log. 136(1-2): 22-29 ()]]>https://dblp.org/rec/journals/apal/Baaz05Sat, 01 Jan 2005 00:00:00 +0100 Editorial.https://doi.org/10.1093/jigpal/jzi029, , , :
Editorial. Log. J. IGPL 13(4): 363 ()]]>https://dblp.org/rec/journals/igpl/BaazCGH05Sat, 01 Jan 2005 00:00:00 +0100 Editorial.https://doi.org/10.1093/jigpal/jzi036, , , :
Editorial. Log. J. IGPL 13(5): 491 ()]]>https://dblp.org/rec/journals/igpl/BaazCGH05aSat, 01 Jan 2005 00:00:00 +0100 Editorial.https://doi.org/10.1093/logcom/exi036, , :
Editorial. J. Log. Comput. 15(4): 409 ()]]>https://dblp.org/rec/journals/logcom/AdianBB05Sat, 01 Jan 2005 00:00:00 +0100 On the Proof Theory of the Existence Predicate.https://dblp.org/pid/32/2031.html, :
On the Proof Theory of the Existence Predicate. We Will Show Them! (1) : 125-166]]>https://dblp.org/rec/conf/birthday/BaazI05Sat, 01 Jan 2005 00:00:00 +0100 Note on Formal Analogical Reasoning in the Juridical Context.https://doi.org/10.1007/11538363_3:
Note on Formal Analogical Reasoning in the Juridical Context. CSL : 18-26]]>https://dblp.org/rec/conf/csl/Baaz05Sat, 01 Jan 2005 00:00:00 +0100 On Interpolation in Existence Logics.https://doi.org/10.1007/11591191_48, :
On Interpolation in Existence Logics. LPAR : 697-711]]>https://dblp.org/rec/conf/lpar/BaazI05Sat, 01 Jan 2005 00:00:00 +0100 Analytic Calculi for Monoidal T-norm Based Logic.http://content.iospress.com/articles/fundamenta-informaticae/fi59-4-01, , :
Analytic Calculi for Monoidal T-norm Based Logic. Fundam. Informaticae 59(4): 315-332 ()]]>https://dblp.org/rec/journals/fuin/BaazCM04Thu, 01 Jan 2004 00:00:00 +0100 CERES in Many-Valued Logics.https://doi.org/10.1007/978-3-540-32275-7_1, :
CERES in Many-Valued Logics. LPAR : 1-20]]>https://dblp.org/rec/conf/lpar/BaazL04Thu, 01 Jan 2004 00:00:00 +0100 Cut-Elimination: Experiments with CERES.https://doi.org/10.1007/978-3-540-32275-7_32, , , , :
Cut-Elimination: Experiments with CERES. LPAR : 481-495]]>https://dblp.org/rec/conf/lpar/BaazHLRS04Thu, 01 Jan 2004 00:00:00 +0100 Hypersequent Calculi for Gödel Logics - a Survey.https://doi.org/10.1093/logcom/13.6.835, , :
Hypersequent Calculi for Gödel Logics - a Survey. J. Log. Comput. 13(6): 835-861 ()]]>https://dblp.org/rec/journals/logcom/BaazCF03Wed, 01 Jan 2003 00:00:00 +0100 Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics.https://doi.org/10.1109/ISMVL.2003.1201403, , :
Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. ISMVL : 175-180]]>https://dblp.org/rec/conf/ismvl/BaazPZ03Wed, 01 Jan 2003 00:00:00 +0100 A Translation Characterizing the Constructive Content of Classical Theories.https://doi.org/10.1007/978-3-540-39813-4_7, :
A Translation Characterizing the Constructive Content of Classical Theories. LPAR : 107-121]]>https://dblp.org/rec/conf/lpar/BaazF03Wed, 01 Jan 2003 00:00:00 +0100 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.https://doi.org/10.1007/b13224, :
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 , ISBN 3-540-40801-0 [contents]]]>https://dblp.org/rec/conf/csl/2003Wed, 01 Jan 2003 00:00:00 +0100 Foreword.https://doi.org/10.1016/S0304-3975(01)00142-6, , :
Foreword. Theor. Comput. Sci. 288(1): 1 ()]]>https://dblp.org/rec/journals/tcs/Moser02Tue, 01 Jan 2002 00:00:00 +0100 Proof Analysis by Resolution.https://doi.org/10.1007/3-540-45620-1_40:
Proof Analysis by Resolution. CADE : 517-532]]>https://dblp.org/rec/conf/cade/Baaz02Tue, 01 Jan 2002 00:00:00 +0100 On Generalizations of Semi-terms of Particularly Simple Form.https://doi.org/10.1007/3-540-45793-3_26, :
On Generalizations of Semi-terms of Particularly Simple Form. CSL : 382-396]]>https://dblp.org/rec/conf/csl/BaazM02Tue, 01 Jan 2002 00:00:00 +0100 Proof Analysis by Resolution.https://doi.org/10.1007/3-540-45616-3_1:
Proof Analysis by Resolution. TABLEAUX : 1]]>https://dblp.org/rec/conf/tableaux/Baaz02Tue, 01 Jan 2002 00:00:00 +0100 A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic.https://doi.org/10.1007/3-540-45616-3_3, :
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. TABLEAUX : 24-37]]>https://dblp.org/rec/conf/tableaux/BaazC02Tue, 01 Jan 2002 00:00:00 +0100 Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings.https://doi.org/10.1007/3-540-36078-6, :
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 , ISBN 3-540-00010-0 [contents]]]>https://dblp.org/rec/conf/lpar/2002Tue, 01 Jan 2002 00:00:00 +0100 Complexity of t-tautologies.https://doi.org/10.1016/S0168-0072(01)00048-3, , , :
Complexity of t-tautologies. Ann. Pure Appl. Log. 113(1-3): 3-11 ()]]>https://dblp.org/rec/journals/apal/BaazH01Mon, 01 Jan 2001 00:00:00 +0100 On a Generalisation of Herbrand's Theorem.https://doi.org/10.1007/3-540-44802-0_33, :
On a Generalisation of Herbrand's Theorem. CSL : 469-483]]>https://dblp.org/rec/conf/csl/BaazM01Mon, 01 Jan 2001 00:00:00 +0100 A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity.https://doi.org/10.1007/3-540-45504-3_3, :
A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity. Proof Theory in Computer Science : 38-48]]>https://dblp.org/rec/conf/dagstuhl/BaazF01Mon, 01 Jan 2001 00:00:00 +0100 Comparing the Complexity of Cut-Elimination Methods.https://doi.org/10.1007/3-540-45504-3_4, :
Comparing the Complexity of Cut-Elimination Methods. Proof Theory in Computer Science : 49-67]]>https://dblp.org/rec/conf/dagstuhl/BaazL01Mon, 01 Jan 2001 00:00:00 +0100 Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic.https://doi.org/10.1109/ISMVL.2001.924570, , :
Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic. ISMVL : 181-186]]>https://dblp.org/rec/conf/ismvl/BaazCF01Mon, 01 Jan 2001 00:00:00 +0100 Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving.https://doi.org/10.1007/3-540-45653-8_14, , :
Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving. LPAR : 201-215]]>https://dblp.org/rec/conf/lpar/BaazCF01Mon, 01 Jan 2001 00:00:00 +0100 Normal Form Transformations.https://doi.org/10.1016/b978-044450813-3/50007-2, , :
Normal Form Transformations. Handbook of Automated Reasoning : 273-333]]>https://dblp.org/rec/books/el/RV01/BaazEL01Mon, 01 Jan 2001 00:00:00 +0100 Automated Deduction for Many-Valued Logics.https://doi.org/10.1016/b978-044450813-3/50022-9, , :
Automated Deduction for Many-Valued Logics. Handbook of Automated Reasoning : 1355-1402]]>https://dblp.org/rec/books/el/RV01/BaazFS01Mon, 01 Jan 2001 00:00:00 +0100 Cut-elimination and Redundancy-elimination by Resolution.https://doi.org/10.1006/jsco.1999.0359, :
Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. 29(2): 149-177 ()]]>https://dblp.org/rec/journals/jsc/BaazL00Sat, 01 Jan 2000 00:00:00 +0100 Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic.https://doi.org/10.1007/3-540-44622-2_12, :
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. CSL : 187-201]]>https://dblp.org/rec/conf/csl/BaazZ00Sat, 01 Jan 2000 00:00:00 +0100 Quantified Propositional Gödel Logics.https://doi.org/10.1007/3-540-44404-1_16, , :
Quantified Propositional Gödel Logics. LPAR : 240-256]]>https://dblp.org/rec/conf/lpar/BaazCZ00Sat, 01 Jan 2000 00:00:00 +0100 An Analytic Calculus for Quantified Propositional Gödel Logic.https://doi.org/10.1007/10722086_12, , :
An Analytic Calculus for Quantified Propositional Gödel Logic. TABLEAUX : 112-126]]>https://dblp.org/rec/conf/tableaux/BaazFV00Sat, 01 Jan 2000 00:00:00 +0100 Interpolation in fuzzy logic.https://doi.org/10.1007/s001530050151, :
Interpolation in fuzzy logic. Arch. Math. Log. 38(7): 461-489 ()]]>https://dblp.org/rec/journals/aml/BaazV99Fri, 01 Jan 1999 00:00:00 +0100 Cut Normal Forms and Proof Complexity.https://doi.org/10.1016/S0168-0072(98)00026-8, :
Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Log. 97(1-3): 127-177 ()]]>https://dblp.org/rec/journals/apal/BaazL99Fri, 01 Jan 1999 00:00:00 +0100 Note on the Generalization of Calculations.https://doi.org/10.1016/S0304-3975(98)00304-1:
Note on the Generalization of Calculations. Theor. Comput. Sci. 224(1-2): 3-11 ()]]>https://dblp.org/rec/journals/tcs/Baaz99Fri, 01 Jan 1999 00:00:00 +0100 System Description: CutRes 0.1: Cut Elimination by Resolution.https://doi.org/10.1007/3-540-48660-7_16, , :
System Description: CutRes 0.1: Cut Elimination by Resolution. CADE : 212-216]]>https://dblp.org/rec/conf/cade/BaazLM99Fri, 01 Jan 1999 00:00:00 +0100 On the Undecidability of some Sub-Classical First-Order Logics.https://doi.org/10.1007/3-540-46691-6_20, , , :
On the Undecidability of some Sub-Classical First-Order Logics. FSTTCS : 258-268]]>https://dblp.org/rec/conf/fsttcs/BaazCFV99Fri, 01 Jan 1999 00:00:00 +0100 Analytic Calculi for Projective Logics.https://doi.org/10.1007/3-540-48754-9_8, :
Analytic Calculi for Projective Logics. TABLEAUX : 36-50]]>https://dblp.org/rec/conf/tableaux/BaazF99Fri, 01 Jan 1999 00:00:00 +0100 Note on generalizing theorems in algebraically closed fields.https://doi.org/10.1007/s001530050100, :
Note on generalizing theorems in algebraically closed fields. Arch. Math. Log. 37(5-6): 297-307 ()]]>https://dblp.org/rec/journals/aml/BaazZ98Thu, 01 Jan 1998 00:00:00 +0100 Labeled Calculi and Finite-Valued Logics.https://doi.org/10.1023/A:1005022012721, , , :
Labeled Calculi and Finite-Valued Logics. Stud Logica 61(1): 7-33 ()]]>https://dblp.org/rec/journals/sLogica/BaazFSZ98Thu, 01 Jan 1998 00:00:00 +0100 Embedding Logics into Product Logic.https://doi.org/10.1023/A:1005026229560, , , :
Embedding Logics into Product Logic. Stud Logica 61(1): 35-47 ()]]>https://dblp.org/rec/journals/sLogica/BaazHSK98Thu, 01 Jan 1998 00:00:00 +0100 Quantifier Elimination in Fuzzy Logic.https://doi.org/10.1007/10703163_27, :
Quantifier Elimination in Fuzzy Logic. CSL : 399-414]]>https://dblp.org/rec/conf/csl/BaazV98Thu, 01 Jan 1998 00:00:00 +0100 Compact Propositional Gödel Logics.https://doi.org/10.1109/ISMVL.1998.679315, :
Compact Propositional Gödel Logics. ISMVL : 108-113]]>https://dblp.org/rec/conf/ismvl/BaazZ98Thu, 01 Jan 1998 00:00:00 +0100 Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics.https://doi.org/10.1007/BFb0055769, , , :
Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. MFCS : 203-212]]>https://dblp.org/rec/conf/mfcs/BaazCFV98Thu, 01 Jan 1998 00:00:00 +0100 Lean Induction Principles for Tableaux.https://doi.org/10.1007/BFb0027405, , :
Lean Induction Principles for Tableaux. TABLEAUX : 62-75]]>https://dblp.org/rec/conf/tableaux/BaazEF97Wed, 01 Jan 1997 00:00:00 +0100 The Axiom of Choice in Quantum Theory.https://doi.org/10.1002/malq.19960420128, , :
The Axiom of Choice in Quantum Theory. Math. Log. Q. 42: 319-340 ()]]>https://dblp.org/rec/journals/mlq/BaazBS96Mon, 01 Jan 1996 00:00:00 +0100 Completeness of a First-Order Temporal Logic with Time-Gaps.https://doi.org/10.1016/0304-3975(95)00107-7, , :
Completeness of a First-Order Temporal Logic with Time-Gaps. Theor. Comput. Sci. 160(1&2): 241-270 ()]]>https://dblp.org/rec/journals/tcs/BaazLZ96Mon, 01 Jan 1996 00:00:00 +0100 MUltlog 1.0: Towards an Expert System for Many-Valued Logics.https://doi.org/10.1007/3-540-61511-3_84, , , :
MUltlog 1.0: Towards an Expert System for Many-Valued Logics. CADE : 226-230]]>https://dblp.org/rec/conf/cade/BaazFSZ96Mon, 01 Jan 1996 00:00:00 +0100 Fast Cut-Elimination by Projection.https://doi.org/10.1007/3-540-63172-0_30, :
Fast Cut-Elimination by Projection. CSL : 18-33]]>https://dblp.org/rec/conf/csl/BaazL96Mon, 01 Jan 1996 00:00:00 +0100 Intuitionistic Counterparts of Finitely-Valued Logics.https://doi.org/10.1109/ISMVL.1996.508349, :
Intuitionistic Counterparts of Finitely-Valued Logics. ISMVL : 136-143]]>https://dblp.org/rec/conf/ismvl/BaazF96Mon, 01 Jan 1996 00:00:00 +0100 Combining Many-valued and Intuitionistic Tableaux.https://doi.org/10.1007/3-540-61208-4_5, :
Combining Many-valued and Intuitionistic Tableaux. TABLEAUX : 65-79]]>https://dblp.org/rec/conf/tableaux/BaazF96Mon, 01 Jan 1996 00:00:00 +0100 Generalizing Theorems in Real Closed Fields.https://doi.org/10.1016/0168-0072(94)00054-7, :
Generalizing Theorems in Real Closed Fields. Ann. Pure Appl. Log. 75(1-2): 3-23 ()]]>https://dblp.org/rec/journals/apal/BaazZ95Sun, 01 Jan 1995 00:00:00 +0100 Resolution-Based Theorem Proving for Manyvalued Logics.https://doi.org/10.1006/jsco.1995.1021, :
Resolution-Based Theorem Proving for Manyvalued Logics. J. Symb. Comput. 19(4): 353-391 ()]]>https://dblp.org/rec/journals/jsc/BaazF95Sun, 01 Jan 1995 00:00:00 +0100 Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs.https://doi.org/10.1007/3-540-61377-3_28, , :
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL : 1-15]]>https://dblp.org/rec/conf/csl/BaazLZ95Sun, 01 Jan 1995 00:00:00 +0100 Non-elementary Speedups between Different Versions of Tableaux.https://doi.org/10.1007/3-540-59338-1_38, :
Non-elementary Speedups between Different Versions of Tableaux. TABLEAUX : 217-230]]>https://dblp.org/rec/conf/tableaux/BaazF95Sun, 01 Jan 1995 00:00:00 +0100 On Skolemization and Proof Complexity.https://doi.org/10.3233/FI-1994-2044, :
On Skolemization and Proof Complexity. Fundam. Informaticae 20(4): 353-379 ()]]>https://dblp.org/rec/journals/fuin/BaazL94Sat, 01 Jan 1994 00:00:00 +0100 Semi-Unification and Generalizations of a Particularly Simple Form.https://doi.org/10.1007/BFb0022250, :
Semi-Unification and Generalizations of a Particularly Simple Form. CSL : 106-120]]>https://dblp.org/rec/conf/csl/BaazS94Sat, 01 Jan 1994 00:00:00 +0100 Approximating Propositional Calculi by Finite-Valued Logics.https://doi.org/10.1109/ISMVL.1994.302193, :
Approximating Propositional Calculi by Finite-Valued Logics. ISMVL : 257-263]]>https://dblp.org/rec/conf/ismvl/BaazZ94Sat, 01 Jan 1994 00:00:00 +0100 A New Frame For Common-Sense Reasoning - Towards Local Inconsistencies.https://doi.org/10.1007/3-540-58467-6_35, :
A New Frame For Common-Sense Reasoning - Towards Local Inconsistencies. KI : 392]]>https://dblp.org/rec/conf/ki/BaazH94Sat, 01 Jan 1994 00:00:00 +0100 A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation.https://doi.org/10.1109/LICS.1994.316070, , :
A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation. LICS : 213-219]]>https://dblp.org/rec/conf/lics/BaazFL94Sat, 01 Jan 1994 00:00:00 +0100 Dual systems of sequents and tableaux for many-valued logics.https://dblp.org/pid/32/2031.html, , :
Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS 49: 192-197 ()]]>https://dblp.org/rec/journals/eatcs/BaazFZ93aFri, 01 Jan 1993 00:00:00 +0100 Dual systems of sequents and tableaux for many-valued logics.https://dblp.org/pid/32/2031.html, , :
Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS 51: 192-197 ()]]>https://dblp.org/rec/journals/eatcs/BaazFZ93Fri, 01 Jan 1993 00:00:00 +0100 Elimination of Cuts in First-order Finite-valued Logics.https://dblp.org/pid/32/2031.html, , :
Elimination of Cuts in First-order Finite-valued Logics. J. Inf. Process. Cybern. 29(6): 333-355 ()]]>https://dblp.org/rec/journals/eik/BaazFZ93Fri, 01 Jan 1993 00:00:00 +0100 Short Proofs of Tautologies Using the Schema of Equivalence.https://doi.org/10.1007/BFb0049322, :
Short Proofs of Tautologies Using the Schema of Equivalence. CSL : 33-35]]>https://dblp.org/rec/conf/csl/BaazZ93Fri, 01 Jan 1993 00:00:00 +0100 The Application of Kripke-Type Structures to Regional Development Programs.https://doi.org/10.1007/3-540-57234-1_53, , , :
The Application of Kripke-Type Structures to Regional Development Programs. DEXA : 523-528]]>https://dblp.org/rec/conf/dexa/BaazGQV93Fri, 01 Jan 1993 00:00:00 +0100 Systematic Construction of Natural Deduction Systems for Many-Valued Logics.https://doi.org/10.1109/ISMVL.1993.289558, , :
Systematic Construction of Natural Deduction Systems for Many-Valued Logics. ISMVL : 208-213]]>https://dblp.org/rec/conf/ismvl/BaazFZ93Fri, 01 Jan 1993 00:00:00 +0100 MULTILOG: A System for Axiomatizing Many-valued Logics.https://doi.org/10.1007/3-540-56944-8_66, , , :
MULTILOG: A System for Axiomatizing Many-valued Logics. LPAR : 345-347]]>https://dblp.org/rec/conf/lpar/BaazFOZ93Fri, 01 Jan 1993 00:00:00 +0100 Complexity of Resolution Proofs and Function Introduction.https://doi.org/10.1016/0168-0072(92)90042-X, :
Complexity of Resolution Proofs and Function Introduction. Ann. Pure Appl. Log. 57(3): 181-215 ()]]>https://dblp.org/rec/journals/apal/BaazL92Wed, 01 Jan 1992 00:00:00 +0100 Note on calculi for a three-valued logic for logic programming..https://dblp.org/pid/32/2031.html, :
Note on calculi for a three-valued logic for logic programming.. Bull. EATCS 48: 157-164 ()]]>https://dblp.org/rec/journals/eatcs/BaazZ92Wed, 01 Jan 1992 00:00:00 +0100 Algorithmic Structuring of Cut-free Proofs.https://doi.org/10.1007/3-540-56992-8_4, :
Algorithmic Structuring of Cut-free Proofs. CSL : 29-42]]>https://dblp.org/rec/conf/csl/BaazZ92Wed, 01 Jan 1992 00:00:00 +0100 Resolution for Many-Valued Logics.https://doi.org/10.1007/BFb0013053, :
Resolution for Many-Valued Logics. LPAR : 107-118]]>https://dblp.org/rec/conf/lpar/BaazF92Wed, 01 Jan 1992 00:00:00 +0100 A Formal Model for the Support of Analogical Reasoning in Legal Expert Systems.https://dblp.org/pid/32/2031.html, :
A Formal Model for the Support of Analogical Reasoning in Legal Expert Systems. DEXA : 431-435]]>https://dblp.org/rec/conf/dexa/BaazQ91Tue, 01 Jan 1991 00:00:00 +0100 A Strong Problem Reduction Method Based on Function Introduction.https://doi.org/10.1145/96877.96888, :
A Strong Problem Reduction Method Based on Function Introduction. ISSAC : 30-37]]>https://dblp.org/rec/conf/issac/BaazL90Mon, 01 Jan 1990 00:00:00 +0100 An Effective Decision Algorithm for Propositional Temporal Logic.https://doi.org/10.1007/978-3-642-74688-8_12:
An Effective Decision Algorithm for Propositional Temporal Logic. ÖGAI : 106-113]]>https://dblp.org/rec/conf/ogai/Baaz89Sun, 01 Jan 1989 00:00:00 +0100 Strong splitting rules in automated theorem proving.https://doi.org/10.1007/3-540-51517-8_147, :
Strong splitting rules in automated theorem proving. EUROCAL : 424-425]]>https://dblp.org/rec/conf/eurocal/BaazL87Thu, 01 Jan 1987 00:00:00 +0100 Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können.https://doi.org/10.1007/978-3-642-46620-5_17:
Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können. ÖGAI : 176-181]]>https://dblp.org/rec/conf/ogai/Baaz87Thu, 01 Jan 1987 00:00:00 +0100 Kripke-type semantics for da Costa's paraconsistent logic Cω.https://doi.org/10.1305/ndjfl/1093636764:
Kripke-type semantics for da Costa's paraconsistent logic Cω. Notre Dame J. Formal Log. 27(4): 523-527 ()]]>https://dblp.org/rec/journals/ndjfl/Baaz86Wed, 01 Jan 1986 00:00:00 +0100 Eine Methode zur automatischen Problemreduktion.https://doi.org/10.1007/978-3-642-46552-9_18, :
Eine Methode zur automatischen Problemreduktion. ÖGAI : 154-163]]>https://dblp.org/rec/conf/ogai/BaazL85Tue, 01 Jan 1985 00:00:00 +0100