| Publication | Date of Publication | Type |
|---|
Incompleteness of a first-order Gödel logic and some temporal logics of programs
| 2024-06-21 | Paper |
Effective Skolemization
Logic, Language, Information, and Computation | 2024-02-28 | Paper |
Andrews Skolemization may shorten resolution proofs non-elementarily
| 2022-07-01 | Paper |
EPSILON THEOREMS IN INTERMEDIATE LOGICS
Journal of Symbolic Logic | 2022-06-15 | Paper |
Towards a proof theory for quantifier macros
Information and Computation | 2022-06-13 | Paper |
The number of axioms
Annals of Pure and Applied Logic | 2022-04-01 | Paper |
Towards a proof theory for Henkin quantifiers
Journal Of Logic And Computation | 2022-02-08 | Paper |
An abstract form of the first epsilon theorem
Journal Of Logic And Computation | 2020-12-15 | Paper |
First-order interpolation derived from propositional interpolation
Theoretical Computer Science | 2020-08-25 | Paper |
Note on the benefit of proof representations by name
Mathesis Universalis, Computability and Proof | 2020-08-10 | Paper |
A globally sound analytic calculus for Henkin quantifiers
| 2020-05-06 | Paper |
Note on globally sound analytic calculi for quantifier macros
| 2020-03-04 | Paper |
Epsilon Theorems in Intermediate Logics
| 2019-07-09 | Paper |
Lyndon interpolation holds for the prenex \(\supset\) prenex fragment of Gödel logic
EPiC Series in Computing | 2019-07-04 | Paper |
Unsound inferences make proofs shorter
Journal of Symbolic Logic | 2019-03-15 | Paper |
Lean induction principles for tableaux
Lecture Notes in Computer Science | 2019-01-15 | Paper |
MUltlog 1.0: towards an expert system for many-valued logics
Automated Deduction — Cade-13 | 2019-01-15 | Paper |
Combining many-valued and intuitionistic tableaux
Theorem Proving with Analytic Tableaux and Related Methods | 2019-01-10 | Paper |
Gödel logics and the fully boxed fragment of FO-LTL
EPiC Series in Computing | 2019-01-10 | Paper |
Skolemization in intermediate logics with the finite model property
Logic Journal of the IGPL | 2019-01-08 | Paper |
On the classification of first order Gödel logics
Annals of Pure and Applied Logic | 2018-11-07 | Paper |
A note on the complexity of classical and intuitionistic proofs
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
A sequent-calculus based formulation of the extended first epsilon theorem
| 2018-04-06 | Paper |
An interpolant in predicate G\"odel logic
| 2018-03-08 | Paper |
Ten problems in Gödel logic
Soft Computing | 2018-02-23 | Paper |
First-order interpolation of non-classical logics derived from propositional interpolation
| 2018-01-04 | Paper |
Elementary elimination of prenex cuts in disjunction-free intuitionistic logic
| 2017-08-31 | Paper |
Cut elimination for Gödel logic with an operator adding a constant
Logic, Language, Information, and Computation | 2016-09-09 | Paper |
Proof theory of witnessed Gödel logic: a negative result
Journal of Logic and Computation | 2016-04-28 | Paper |
Finite-valued semantics for canonical labelled calculi
Journal of Automated Reasoning | 2015-06-23 | Paper |
Cut-elimination: syntax and semantics
Studia Logica | 2015-02-27 | Paper |
Monotone operators on Gödel logic
Archive for Mathematical Logic | 2014-05-12 | Paper |
scientific article; zbMATH DE number 6276272 (Why is no real title available?)
| 2014-04-01 | Paper |
Gödel logics with monotone operators
Fuzzy Sets and Systems | 2012-11-21 | Paper |
Effective finite-valued semantics for labelled calculi
Automated Reasoning | 2012-09-05 | Paper |
On the complexity of proof deskolemization
The Journal of Symbolic Logic | 2012-06-19 | Paper |
Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability
Logical Methods in Computer Science | 2012-04-03 | Paper |
First-order satisfiability in Gödel logics: an NP-complete fragment
Theoretical Computer Science | 2011-12-07 | Paper |
Eskolemization in intuitionistic logic
Journal Of Logic And Computation | 2011-10-21 | Paper |
On the proof theory of the existence predicate
| 2011-06-21 | Paper |
Fast cut-elimination by CERES
| 2011-05-31 | Paper |
scientific article; zbMATH DE number 5896228 (Why is no real title available?)
| 2011-05-18 | Paper |
Herbrand's theorem for prenex Gödel logic and its consequences for theorem proving
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Strong splitting rules in automated theorem proving
Lecture Notes in Computer Science | 2011-04-16 | Paper |
On the non-confluence of cut-elimination
Journal of Symbolic Logic | 2011-03-18 | Paper |
Methods of cut-elimination
Trends in Logic -- Studia Logica Library | 2010-11-30 | Paper |
A resolution mechanism for prenex Gödel logic
Computer Science Logic | 2010-09-03 | Paper |
A translation characterizing the constructive content of classical theories
| 2010-02-24 | Paper |
Herbrand's theorem, Skolemization and proof systems for first-order Łukasiewicz logic
Journal Of Logic And Computation | 2010-02-19 | Paper |
Note on witnessed Gödel logics with Delta
Annals of Pure and Applied Logic | 2009-11-04 | Paper |
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
Logic, Language, Information and Computation | 2009-07-02 | Paper |
On Skolemization in constructive theories
Journal of Symbolic Logic | 2009-03-23 | Paper |
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
scientific article; zbMATH DE number 5360299 (Why is no real title available?)
| 2008-11-03 | Paper |
CERES: An analysis of Fürstenberg's proof of the infinity of primes
Theoretical Computer Science | 2008-09-16 | Paper |
Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type
Journal Of Logic And Computation | 2008-08-15 | Paper |
Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).
Annals of Pure and Applied Logic | 2008-06-23 | Paper |
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
Logic and Theory of Algorithms | 2008-06-19 | Paper |
On Interpolation in Existence Logics
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Monadic Fragments of Gödel Logics: Decidability and Undecidability Results
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Effective Finite-Valued Approximations of General Propositional Logics
Pillars of Computer Science | 2008-03-25 | Paper |
Proof Theory for First Order Łukasiewicz Logic
Lecture Notes in Computer Science | 2008-01-04 | Paper |
Note on Conditional Constructivity
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Towards a clausal analysis of cut-elimination
Journal of Symbolic Computation | 2007-10-23 | Paper |
Proof Transformation by CERES
Lecture Notes in Computer Science | 2007-09-05 | Paper |
First-order Gödel logics
Annals of Pure and Applied Logic | 2007-06-25 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
The Skolemization of existential quantifiers in intuitionistic logic
Annals of Pure and Applied Logic | 2006-09-14 | Paper |
Herbrand's theorem and term induction
Archive for Mathematical Logic | 2006-05-26 | Paper |
Gentzen calculi for the existence predicate
Studia Logica | 2006-03-17 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Controlling witnesses
Annals of Pure and Applied Logic | 2005-09-22 | Paper |
scientific article; zbMATH DE number 2174394 (Why is no real title available?)
| 2005-06-08 | Paper |
scientific article; zbMATH DE number 2113968 (Why is no real title available?)
| 2004-11-05 | Paper |
Hypersequent Calculi for Godel Logics -- a Survey
Journal Of Logic And Computation | 2004-09-07 | Paper |
scientific article; zbMATH DE number 2090323 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2079021 (Why is no real title available?)
| 2004-07-21 | Paper |
scientific article; zbMATH DE number 2042614 (Why is no real title available?)
| 2004-02-15 | Paper |
scientific article; zbMATH DE number 2006629 (Why is no real title available?)
| 2003-11-23 | Paper |
scientific article; zbMATH DE number 2006630 (Why is no real title available?)
| 2003-11-23 | Paper |
scientific article; zbMATH DE number 1995176 (Why is no real title available?)
| 2003-10-21 | Paper |
scientific article; zbMATH DE number 1950249 (Why is no real title available?)
| 2003-07-17 | Paper |
scientific article; zbMATH DE number 1950251 (Why is no real title available?)
| 2003-07-17 | Paper |
scientific article; zbMATH DE number 1948175 (Why is no real title available?)
| 2003-07-10 | Paper |
A natural deduction system for intuitionistic fuzzy logic
| 2003-03-31 | Paper |
Complexity of t-tautologies
Annals of Pure and Applied Logic | 2003-03-06 | Paper |
Characterization of the Axiomatizable Prenex Fragments of First-Order Goedel Logics
| 2003-03-01 | Paper |
scientific article; zbMATH DE number 1841838 (Why is no real title available?)
| 2002-12-04 | Paper |
Automated deduction for many-valued logics
| 2002-09-05 | Paper |
Normal form transformations
| 2002-08-27 | Paper |
scientific article; zbMATH DE number 1696769 (Why is no real title available?)
| 2002-06-30 | Paper |
Approximating Propositional Calculi by Finite-valued Logics
| 2002-03-19 | Paper |
scientific article; zbMATH DE number 1670477 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1552519 (Why is no real title available?)
| 2001-07-03 | Paper |
scientific article; zbMATH DE number 1612546 (Why is no real title available?)
| 2001-07-01 | Paper |
Labeled calculi and finite-valued logics
Studia Logica | 2001-06-25 | Paper |
Embedding logics into product logic
Studia Logica | 2001-04-19 | Paper |
Cut-elimination and redundancy-elimination by resolution
Journal of Symbolic Computation | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1555175 (Why is no real title available?)
| 2001-01-22 | Paper |
scientific article; zbMATH DE number 1500655 (Why is no real title available?)
| 2001-01-11 | Paper |
scientific article; zbMATH DE number 1420834 (Why is no real title available?)
| 2000-09-05 | Paper |
Cut normal forms and proof complexity
Annals of Pure and Applied Logic | 2000-07-24 | Paper |
scientific article; zbMATH DE number 1342226 (Why is no real title available?)
| 2000-03-29 | Paper |
Note on the generalization of calculations
Theoretical Computer Science | 2000-01-12 | Paper |
Interpolation in fuzzy logic
Archive for Mathematical Logic | 2000-01-04 | Paper |
scientific article; zbMATH DE number 1341466 (Why is no real title available?)
| 1999-11-21 | Paper |
scientific article; zbMATH DE number 1324434 (Why is no real title available?)
| 1999-08-16 | Paper |
scientific article; zbMATH DE number 1222563 (Why is no real title available?)
| 1999-03-02 | Paper |
Note on generalizing theorems in algebraically closed fields
Archive for Mathematical Logic | 1998-10-13 | Paper |
scientific article; zbMATH DE number 1127072 (Why is no real title available?)
| 1998-06-14 | Paper |
scientific article; zbMATH DE number 1086658 (Why is no real title available?)
| 1998-06-14 | Paper |
The Axiom of Choice in Quantum Theory
Mathematical Logic Quarterly | 1997-08-19 | Paper |
scientific article; zbMATH DE number 922613 (Why is no real title available?)
| 1997-05-25 | Paper |
Completeness of a first-order temporal logic with time-gaps
Theoretical Computer Science | 1997-02-27 | Paper |
scientific article; zbMATH DE number 837782 (Why is no real title available?)
| 1996-07-01 | Paper |
Generalizing theorems in real closed fields
Annals of Pure and Applied Logic | 1996-01-21 | Paper |
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation | 1995-10-09 | Paper |
scientific article; zbMATH DE number 777292 (Why is no real title available?)
| 1995-07-20 | Paper |
scientific article; zbMATH DE number 627412 (Why is no real title available?)
| 1994-08-31 | Paper |
scientific article; zbMATH DE number 515726 (Why is no real title available?)
| 1994-08-28 | Paper |
scientific article; zbMATH DE number 517011 (Why is no real title available?)
| 1994-08-25 | Paper |
scientific article; zbMATH DE number 446843 (Why is no real title available?)
| 1994-01-09 | Paper |
scientific article; zbMATH DE number 440474 (Why is no real title available?)
| 1993-12-02 | Paper |
scientific article; zbMATH DE number 440473 (Why is no real title available?)
| 1993-11-28 | Paper |
Complexity of resolution proofs and function introduction
Annals of Pure and Applied Logic | 1992-09-27 | Paper |
scientific article; zbMATH DE number 19150 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 4135936 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4114593 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4043297 (Why is no real title available?)
| 1987-01-01 | Paper |
Kripke-type semantics for Da Costa's paraconsistent logic \(C_{\omega}\)
Notre Dame Journal of Formal Logic | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3959369 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3982555 (Why is no real title available?)
| 1985-01-01 | Paper |
Epsilon Calculus Provides Shorter Cut-Free Proofs
| N/A | Paper |
