default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Baaz
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Matthias Baaz, Marcel Ertel, Reinhard Kahle, Thomas Piecha, Jan von Plato:
90 years of Gödel's incompleteness theorems: Logic and computation. J. Log. Comput. 34(6): 1003-1009 (2024)- [c73]Matthias Baaz, Anela Lolic:
On Translations of Epsilon Proofs to LK. LPAR 2024: 232-245 - [i2]Matthias Baaz, Mariami Gamsakhurdia:
Goedel logics: Prenex fragments. CoRR abs/2407.16683 (2024) - 2023
- [c72]Matthias Baaz
, Anela Lolic:
Effective Skolemization. WoLLIC 2023: 69-82 - 2022
- [j62]Juan P. Aguilera, Matthias Baaz, Jan Bydzovsky:
The number of axioms. Ann. Pure Appl. Log. 173(5): 103078 (2022) - [j61]Matthias Baaz, Anela Lolic:
Towards a proof theory for quantifier macros. Inf. Comput. 287: 104753 (2022) - [j60]Matthias Baaz, Richard Zach:
Epsilon theorems in Intermediate Logics. J. Symb. Log. 87(2): 682-720 (2022) - [c71]Matthias Baaz, Anela Lolic:
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily. LFCS 2022: 9-24 - 2021
- [j59]Matthias Baaz, Anela Lolic:
Towards a proof theory for Henkin quantifiers. J. Log. Comput. 31(1): 40-66 (2021) - 2020
- [j58]Matthias Baaz, Alexander Leitsch, Anela Lolic:
An abstract form of the first epsilon theorem. J. Log. Comput. 30(8): 1447-1468 (2020) - [j57]Matthias Baaz, Anela Lolic:
First-order interpolation derived from propositional interpolation. Theor. Comput. Sci. 837: 209-222 (2020) - [c70]Matthias Baaz, Anela Lolic:
A Globally Sound Analytic Calculus for Henkin Quantifiers. LFCS 2020: 128-143
2010 – 2019
- 2019
- [j56]Matthias Baaz, Norbert Preining:
On the classification of first order Gödel logics. Ann. Pure Appl. Log. 170(1): 36-57 (2019) - [j55]Juan P. Aguilera, Matthias Baaz:
Unsound Inferences Make Proofs Shorter. J. Symb. Log. 84(1): 102-122 (2019) - [c69]Matthias Baaz, Anela Lolic:
Note on Globally Sound Analytic Calculi for Quantifier Macros. WoLLIC 2019: 486-497 - 2018
- [c68]Matthias Baaz, Alexander Leitsch, Anela Lolic:
A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem. LFCS 2018: 55-71 - [c67]Matthias Baaz, Anela Lolic:
Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic. LPAR 2018: 95-110 - 2017
- [j54]Matthias Baaz, Alexander Leitsch:
On the Complexity of Translations from Classical to Intuitionistic Proofs. FLAP 4(4) (2017) - [j53]Matthias Baaz:
Preface. FLAP 4(10): 3117-3126 (2017) - [j52]Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Stefan Hetzl, Daniel Weller:
Preface. J. Log. Comput. 27(2): 415 (2017) - [j51]Juan P. Aguilera, Matthias Baaz:
Ten problems in Gödel logic. Soft Comput. 21(1): 149-152 (2017) - [c66]Matthias Baaz, Anela Lolic:
First-Order Interpolation of Non-classical Logics Derived from Propositional Interpolation. FroCoS 2017: 265-280 - [c65]Matthias Baaz, Norbert Preining:
Gödel logics and the fully boxed fragment of LTL. LPAR 2017: 404-416 - 2016
- [j50]Matthias Baaz, Rosalie Iemhoff:
Skolemization in intermediate logics with the finite model property. Log. J. IGPL 24(3): 224-237 (2016) - [j49]Matthias Baaz, Agata Ciabattoni:
Proof theory of witnessed Gödel logic: A negative result. J. Log. Comput. 26(1): 51-64 (2016) - [c64]Juan P. Aguilera, Matthias Baaz:
Cut Elimination for Gödel Logic with an Operator Adding a Constant. WoLLIC 2016: 36-51 - [i1]Juan P. Aguilera, Matthias Baaz:
Unsound Inferences Make Proofs Shorter. CoRR abs/1608.07703 (2016) - 2015
- [c63]Matthias Baaz, Christian G. Fermüller:
Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic. CSL 2015: 94-109 - [c62]Matthias Baaz, Alexander Leitsch, Giselle Reis:
A Note on the Complexity of Classical and Intuitionistic Proofs. LICS 2015: 657-666 - 2014
- [j48]Oliver Fasching, Matthias Baaz:
Monotone operators on Gödel logic. Arch. Math. Log. 53(3-4): 261-284 (2014) - [j47]Matthias Baaz, Alexander Leitsch:
Cut-Elimination: Syntax and Semantics. Stud Logica 102(6): 1217-1244 (2014) - [c61]Matthias Baaz, Thomas Eiter, Helmut Veith:
Vienna Summer of Logic. KR 2014 - 2013
- [j46]Matthias Baaz, Ori Lahav, Anna Zamansky:
Finite-valued Semantics for Canonical Labelled Calculi. J. Autom. Reason. 51(4): 401-430 (2013) - [e3]Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz, Christian G. Fermüller:
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 2013 [contents] - 2012
- [j45]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller:
Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability. Log. Methods Comput. Sci. 8(1) (2012) - [j44]Matthias Baaz, Oliver Fasching:
Gödel logics with monotone operators. Fuzzy Sets Syst. 197: 3-13 (2012) - [j43]Matthias Baaz, Stefan Hetzl, Daniel Weller:
On the complexity of proof deskolemization. J. Symb. Log. 77(2): 669-686 (2012) - [c60]Matthias Baaz, Ori Lahav, Anna Zamansky:
Effective Finite-Valued Semantics for Labelled Calculi. IJCAR 2012: 52-66 - 2011
- [j42]Matthias Baaz, Stefan Hetzl:
On the non-confluence of cut-elimination. J. Symb. Log. 76(1): 313-340 (2011) - [j41]Matthias Baaz, Rosalie Iemhoff:
Eskolemization in Intuitionistic Logic. J. Log. Comput. 21(4): 625-638 (2011) - [j40]Matthias Baaz, Agata Ciabattoni, Norbert Preining:
First-order satisfiability in Gödel logics: An NP-complete fragment. Theor. Comput. Sci. 412(47): 6612-6623 (2011) - 2010
- [j39]Matthias Baaz, George Metcalfe:
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic. J. Log. Comput. 20(1): 35-54 (2010) - [c59]Matthias Baaz, Christian G. Fermüller:
A Resolution Mechanism for Prenex Gödel Logic. CSL 2010: 67-79 - [c58]Matthias Baaz, Oliver Fasching:
Gödel logics with an operator shifting truth values. LPAR short papers(Yogyakarta) 2010: 13-14
2000 – 2009
- 2009
- [j38]Matthias Baaz:
Foreword. Ann. Pure Appl. Log. 157(2-3): 63 (2009) - [j37]Matthias Baaz, Oliver Fasching:
Note on witnessed Gödel logics with Delta. Ann. Pure Appl. Log. 161(2): 121-127 (2009) - [j36]Matthias Baaz, George Metcalfe:
Fuzzy Logic Corner. J. Log. Comput. 19(2): 343 (2009) - [c57]Matthias Baaz, Agata Ciabattoni, Norbert Preining:
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. WoLLIC 2009: 113-123 - 2008
- [j35]Matthias Baaz, Piotr Wojtylak:
Generalizing proofs in monadic languages. Ann. Pure Appl. Log. 154(2): 71-138 (2008) - [j34]Matthias Baaz, Rosalie Iemhoff:
On Skolemization in constructive theories. J. Symb. Log. 73(3): 969-998 (2008) - [j33]Matthias Baaz, Norbert Preining:
Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type omega. J. Log. Comput. 18(4): 649-668 (2008) - [j32]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) - [c56]Matthias Baaz, Richard Zach:
Effective Finite-Valued Approximations of General Propositional Logics. Pillars of Computer Science 2008: 107-129 - [c55]Matthias Baaz, George Metcalfe:
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics. CiE 2008: 22-31 - [c54]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller:
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution. LPAR 2008: 451-466 - 2007
- [j31]Matthias Baaz, Norbert Preining, Richard Zach:
First-order Gödel logics. Ann. Pure Appl. Log. 147(1-2): 23-47 (2007) - [c53]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller:
Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. LPAR 2007: 77-91 - [c52]Matthias Baaz, George Metcalfe:
Proof Theory for First Order Lukasiewicz Logic. TABLEAUX 2007: 28-42 - 2006
- [j30]Matthias Baaz, Georg Moser:
Herbrand's theorem and term induction. Arch. Math. Log. 45(4): 447-503 (2006) - [j29]Matthias Baaz, Rosalie Iemhoff:
The Skolemization of existential quantifiers in intuitionistic logic. Ann. Pure Appl. Log. 142(1-3): 269-295 (2006) - [j28]Matthias Baaz, Alexander Leitsch:
Towards a clausal analysis of cut-elimination. J. Symb. Comput. 41(3-4): 381-410 (2006) - [j27]Matthias Baaz, Rosalie Iemhoff:
Gentzen Calculi for the Existence Predicate. Stud Logica 82(1): 7-23 (2006) - [c51]Matthias Baaz:
Note on Conditional Constructivity. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 25-29 - [c50]Matthias Baaz, Norbert Preining, Richard Zach:
Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. ISMVL 2006: 9 - [c49]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr:
Proof Transformation by CERES. MKM 2006: 82-93 - 2005
- [j26]Matthias Baaz:
Controlling witnesses. Ann. Pure Appl. Log. 136(1-2): 22-29 (2005) - [j25]Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek:
Editorial. Log. J. IGPL 13(4): 363 (2005) - [j24]Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Petr Hájek:
Editorial. Log. J. IGPL 13(5): 491 (2005) - [j23]Sergei I. Adian, Matthias Baaz, Lev D. Beklemishev:
Editorial. J. Log. Comput. 15(4): 409 (2005) - [c48]Matthias Baaz, Rosalie Iemhoff:
On the Proof Theory of the Existence Predicate. We Will Show Them! (1) 2005: 125-166 - [c47]Matthias Baaz:
Note on Formal Analogical Reasoning in the Juridical Context. CSL 2005: 18-26 - [c46]Matthias Baaz, Rosalie Iemhoff:
On Interpolation in Existence Logics. LPAR 2005: 697-711 - 2004
- [j22]Matthias Baaz, Agata Ciabattoni, Franco Montagna:
Analytic Calculi for Monoidal T-norm Based Logic. Fundam. Informaticae 59(4): 315-332 (2004) - [c45]Matthias Baaz, Alexander Leitsch:
CERES in Many-Valued Logics. LPAR 2004: 1-20 - [c44]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr:
Cut-Elimination: Experiments with CERES. LPAR 2004: 481-495 - 2003
- [j21]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller:
Hypersequent Calculi for Gödel Logics - a Survey. J. Log. Comput. 13(6): 835-861 (2003) - [c43]Matthias Baaz, Norbert Preining, Richard Zach:
Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. ISMVL 2003: 175-180 - [c42]Matthias Baaz, Christian G. Fermüller:
A Translation Characterizing the Constructive Content of Classical Theories. LPAR 2003: 107-121 - [e2]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. Lecture Notes in Computer Science 2803, Springer 2003, ISBN 3-540-40801-0 [contents] - 2002
- [j20]Matthias Baaz, Georg Gottlob, Georg Moser:
Foreword. Theor. Comput. Sci. 288(1): 1 (2002) - [c41]Matthias Baaz:
Proof Analysis by Resolution. CADE 2002: 517-532 - [c40]Matthias Baaz, Georg Moser:
On Generalizations of Semi-terms of Particularly Simple Form. CSL 2002: 382-396 - [c39]Matthias Baaz:
Proof Analysis by Resolution. TABLEAUX 2002: 1 - [c38]Matthias Baaz, Agata Ciabattoni:
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic. TABLEAUX 2002: 24-37 - [e1]Matthias Baaz, Andrei Voronkov:
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 2002, ISBN 3-540-00010-0 [contents] - 2001
- [j19]Matthias Baaz, Petr Hájek, Franco Montagna, Helmut Veith:
Complexity of t-tautologies. Ann. Pure Appl. Log. 113(1-3): 3-11 (2001) - [c37]Matthias Baaz, Georg Moser:
On a Generalisation of Herbrand's Theorem. CSL 2001: 469-483 - [c36]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 - [c35]Matthias Baaz, Alexander Leitsch:
Comparing the Complexity of Cut-Elimination Methods. Proof Theory in Computer Science 2001: 49-67 - [c34]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller:
Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic. ISMVL 2001: 181-186 - [c33]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 - [p2]Matthias Baaz, Uwe Egly, Alexander Leitsch:
Normal Form Transformations. Handbook of Automated Reasoning 2001: 273-333 - [p1]Matthias Baaz, Christian G. Fermüller, Gernot Salzer:
Automated Deduction for Many-Valued Logics. Handbook of Automated Reasoning 2001: 1355-1402 - 2000
- [j18]Matthias Baaz, Alexander Leitsch:
Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. 29(2): 149-177 (2000) - [c32]Matthias Baaz, Richard Zach:
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. CSL 2000: 187-201 - [c31]Matthias Baaz, Agata Ciabattoni, Richard Zach:
Quantified Propositional Gödel Logics. LPAR 2000: 240-256 - [c30]Matthias Baaz, Christian G. Fermüller, Helmut Veith:
An Analytic Calculus for Quantified Propositional Gödel Logic. TABLEAUX 2000: 112-126
1990 – 1999
- 1999
- [j17]Matthias Baaz, Helmut Veith:
Interpolation in fuzzy logic. Arch. Math. Log. 38(7): 461-489 (1999) - [j16]Matthias Baaz, Alexander Leitsch:
Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Log. 97(1-3): 127-177 (1999) - [j15]Matthias Baaz:
Note on the Generalization of Calculations. Theor. Comput. Sci. 224(1-2): 3-11 (1999) - [c29]Matthias Baaz, Alexander Leitsch, Georg Moser:
System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216 - [c28]Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith:
On the Undecidability of some Sub-Classical First-Order Logics. FSTTCS 1999: 258-268 - [c27]Matthias Baaz, Christian G. Fermüller:
Analytic Calculi for Projective Logics. TABLEAUX 1999: 36-50 - 1998
- [j14]Matthias Baaz, Richard Zach:
Note on generalizing theorems in algebraically closed fields. Arch. Math. Log. 37(5-6): 297-307 (1998) - [j13]Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach:
Labeled Calculi and Finite-Valued Logics. Stud Logica 61(1): 7-33 (1998) - [j12]Matthias Baaz, Petr Hájek, David Svejda, Jan Krajícek:
Embedding Logics into Product Logic. Stud Logica 61(1): 35-47 (1998) - [c26]Matthias Baaz, Helmut Veith:
Quantifier Elimination in Fuzzy Logic. CSL 1998: 399-414 - [c25]Matthias Baaz, Richard Zach:
Compact Propositional Gödel Logics. ISMVL 1998: 108-113 - [c24]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 - 1997
- [c23]Matthias Baaz, Uwe Egly, Christian G. Fermüller:
Lean Induction Principles for Tableaux. TABLEAUX 1997: 62-75 - 1996
- [j11]Matthias Baaz, Norbert Brunner, Karl Svozil:
The Axiom of Choice in Quantum Theory. Math. Log. Q. 42: 319-340 (1996) - [j10]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) - [c22]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 - [c21]Matthias Baaz, Alexander Leitsch:
Fast Cut-Elimination by Projection. CSL 1996: 18-33 - [c20]Matthias Baaz, Christian G. Fermüller:
Intuitionistic Counterparts of Finitely-Valued Logics. ISMVL 1996: 136-143 - [c19]Matthias Baaz, Christian G. Fermüller:
Combining Many-valued and Intuitionistic Tableaux. TABLEAUX 1996: 65-79 - 1995
- [j9]Matthias Baaz, Richard Zach:
Generalizing Theorems in Real Closed Fields. Ann. Pure Appl. Log. 75(1-2): 3-23 (1995) - [j8]Matthias Baaz, Christian G. Fermüller:
Resolution-Based Theorem Proving for Manyvalued Logics. J. Symb. Comput. 19(4): 353-391 (1995) - [c18]Matthias Baaz, Alexander Leitsch, Richard Zach:
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL 1995: 1-15 - [c17]Matthias Baaz, Christian G. Fermüller:
Non-elementary Speedups between Different Versions of Tableaux. TABLEAUX 1995: 217-230 - 1994
- [j7]Matthias Baaz, Alexander Leitsch:
On Skolemization and Proof Complexity. Fundam. Informaticae 20(4): 353-379 (1994) - [c16]Matthias Baaz, Gernot Salzer:
Semi-Unification and Generalizations of a Particularly Simple Form. CSL 1994: 106-120 - [c15]Matthias Baaz, Richard Zach:
Approximating Propositional Calculi by Finite-Valued Logics. ISMVL 1994: 257-263 - [c14]Matthias Baaz, Karin Hörwein:
A New Frame For Common-Sense Reasoning - Towards Local Inconsistencies. KI 1994: 392 - [c13]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 - 1993
- [j6]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS 49: 192-197 (1993) - [j5]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS 51: 192-197 (1993) - [j4]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Elimination of Cuts in First-order Finite-valued Logics. J. Inf. Process. Cybern. 29(6): 333-355 (1993) - [c12]Matthias Baaz, Richard Zach:
Short Proofs of Tautologies Using the Schema of Equivalence. CSL 1993: 33-35 - [c11]Matthias Baaz, Fernando Galindo, Gerald Quirchmayr, Manuel Vázqez:
The Application of Kripke-Type Structures to Regional Development Programs. DEXA 1993: 523-528 - [c10]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Systematic Construction of Natural Deduction Systems for Many-Valued Logics. ISMVL 1993: 208-213 - [c9]Matthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach:
MULTILOG: A System for Axiomatizing Many-valued Logics. LPAR 1993: 345-347 - 1992
- [j3]Matthias Baaz, Alexander Leitsch:
Complexity of Resolution Proofs and Function Introduction. Ann. Pure Appl. Log. 57(3): 181-215 (1992) - [j2]Matthias Baaz, Richard Zach:
Note on calculi for a three-valued logic for logic programming.. Bull. EATCS 48: 157-164 (1992) - [c8]Matthias Baaz, Richard Zach:
Algorithmic Structuring of Cut-free Proofs. CSL 1992: 29-42 - [c7]Matthias Baaz, Christian G. Fermüller:
Resolution for Many-Valued Logics. LPAR 1992: 107-118 - 1991
- [c6]Matthias Baaz, Gerald Quirchmayr:
A Formal Model for the Support of Analogical Reasoning in Legal Expert Systems. DEXA 1991: 431-435 - 1990
- [c5]Matthias Baaz, Alexander Leitsch:
A Strong Problem Reduction Method Based on Function Introduction. ISSAC 1990: 30-37
1980 – 1989
- 1989
- [c4]Matthias Baaz:
An Effective Decision Algorithm for Propositional Temporal Logic. ÖGAI 1989: 106-113 - 1987
- [c3]Matthias Baaz, Alexander Leitsch:
Strong splitting rules in automated theorem proving. EUROCAL 1987: 424-425 - [c2]Matthias Baaz:
Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können. ÖGAI 1987: 176-181 - 1986
- [j1]Matthias Baaz:
Kripke-type semantics for da Costa's paraconsistent logic Cω. Notre Dame J. Formal Log. 27(4): 523-527 (1986) - 1985
- [c1]Matthias Baaz, Alexander Leitsch:
Eine Methode zur automatischen Problemreduktion. ÖGAI 1985: 154-163
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
