| Publication | Date of Publication | Type |
|---|
| Analytic proof theory for Åqvist's system F | 2024-08-05 | Paper |
| Disambiguating permissions: a contribution from Mīmāṃsā | 2024-08-05 | Paper |
| Deontic equilibrium logic with explicit negation | 2024-05-29 | Paper |
| Internal and External Calculi: Ordering the Jungle without Being Lost in Translations | 2023-12-06 | Paper |
Deontic paradoxes in Mīmāṃsā logics: there and back again
Journal of Logic, Language and Information | 2023-08-16 | Paper |
| scientific article; zbMATH DE number 7668098 (Why is no real title available?) | 2023-03-24 | Paper |
| Sequent rules for reasoning and conflict resolution in conditional norms | 2023-02-21 | Paper |
| The gentle murder paradox in Sanskrit philosophy | 2023-02-21 | Paper |
Effective applicative structures
Category Theory and Computer Science | 2022-12-16 | Paper |
Display to Labeled Proofs and Back Again for Tense Logics
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
Display to Labeled Proofs and Back Again for Tense Logics
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
| scientific article; zbMATH DE number 7447733 (Why is no real title available?) | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7447733 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-17 | Paper |
Bilattice CADIAG-II: theory and experimental results
Soft Computing: Biomedical and Related Applications | 2021-12-08 | Paper |
| A normative supervisor for reinforcement learning agents | 2021-12-01 | Paper |
BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
Journal of Symbolic Logic | 2021-10-27 | Paper |
| Gödel logic. From natural deduction to parallel computation | 2021-01-19 | Paper |
Gödel logic. From natural deduction to parallel computation
(available as arXiv preprint) | 2021-01-19 | Paper |
| Bounded sequent calculi for non-classical logics via hypersequents | 2020-05-14 | Paper |
On the concurrent computational content of intermediate logics
Theoretical Computer Science | 2020-04-21 | Paper |
| Evaluating networks of arguments: a case study in Mīmāṃsā dialectics | 2020-01-30 | Paper |
| Resolving conflicting obligations in Mīmāṃsā: a sequent-based approach | 2019-07-24 | Paper |
Hypersequents and Systems of Rules
ACM Transactions on Computational Logic | 2018-08-10 | Paper |
| From cut-free calculi to automated deduction: the case of bounded contraction | 2018-04-23 | Paper |
| Embedding formalisms: hypersequents and two-level systems of rules | 2018-04-23 | Paper |
| From display to labelled proofs for tense logics | 2018-04-06 | Paper |
Proof search and co-NP completeness for many-valued logics
Fuzzy Sets and Systems | 2018-02-19 | Paper |
| Disjunctive Axioms and Concurrent $\lambda$-Calculi: a Curry-Howard Approach | 2018-02-03 | Paper |
Power and limits of structural display rules
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Algebraic proof theory: hypersequents and hypercompletions
Annals of Pure and Applied Logic | 2016-12-23 | Paper |
Proof theory of witnessed Gödel logic: a negative result
Journal of Logic and Computation | 2016-04-28 | Paper |
Automated support for the investigation of paraconsistent and other logics
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Mīmāṃsā Deontic Logic: Proof Theory and Applications
Lecture Notes in Computer Science | 2015-12-11 | Paper |
Uniform proofs of standard completeness for extensions of first-order MTL
Theoretical Computer Science | 2015-10-12 | Paper |
Taming paraconsistent (and other) logics: an algorithmic approach
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Hypersequent and display calculi -- a unified perspective
Studia Logica | 2015-02-27 | Paper |
Tools for the investigation of substructural and paraconsistent logics
Logics in Artificial Intelligence | 2015-01-14 | Paper |
Proof theory for locally finite many-valued logics: semi-projective logics
Theoretical Computer Science | 2013-11-29 | Paper |
Hypersequent and labelled calculi for intermediate logics
Lecture Notes in Computer Science | 2013-10-04 | Paper |
Structural extensions of display calculi: a general recipe
Logic, Language, Information, and Computation | 2013-09-17 | Paper |
Formal approaches to rule-based systems in medicine: the case of CADIAG-2
International Journal of Approximate Reasoning | 2013-06-13 | Paper |
Standard completeness for extensions of MTL: an automated approach
Logic, Language, Information and Computation | 2012-09-21 | Paper |
Algebraic proof theory for substructural logics: cut-elimination and completions
Annals of Pure and Applied Logic | 2012-04-13 | Paper |
Theorem proving for prenex Gödel logic with \(\Delta\): checking validity and unsatisfiability
Logical Methods in Computer Science | 2012-04-03 | Paper |
MacNeille completions of FL-algebras
Algebra Universalis | 2011-12-14 | Paper |
First-order satisfiability in Gödel logics: an NP-complete fragment
Theoretical Computer Science | 2011-12-07 | Paper |
Basic Constructive Connectives, Determinism and Matrix-Based Semantics
Lecture Notes in Computer Science | 2011-07-01 | 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 |
On the (fuzzy) logical content of CADIAG-2
Fuzzy Sets and Systems | 2010-07-28 | Paper |
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
Fuzzy Sets and Systems | 2010-03-18 | Paper |
Bounded Łukasiewicz logics
Lecture Notes in Computer Science | 2010-03-09 | Paper |
Expanding the Realm of Systematic Proof Theory
Computer Science Logic | 2009-11-12 | Paper |
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
Computer Science - Theory and Applications | 2009-08-18 | Paper |
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
Logic, Language, Information and Computation | 2009-07-02 | Paper |
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Density elimination
Theoretical Computer Science | 2008-09-16 | Paper |
Modular Cut-Elimination: Finding Proofs or Counterexamples
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 |
Towards an algorithmic construction of cut-elimination procedures
Mathematical Structures in Computer Science | 2008-04-10 | Paper |
Density Elimination and Rational Completeness for First-Order Logics
Logical Foundations of Computer Science | 2008-01-04 | Paper |
Towards a semantic characterization of cut-elimination
Studia Logica | 2006-03-17 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
A proof-theoretical investigation of global intuitionistic (fuzzy) logic
Archive for Mathematical Logic | 2005-05-26 | 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 2042614 (Why is no real title available?) | 2004-02-15 | Paper |
| scientific article; zbMATH DE number 1950251 (Why is no real title available?) | 2003-07-17 | Paper |
| A natural deduction system for intuitionistic fuzzy logic | 2003-03-31 | Paper |
Hypersequent calculi for some intermediate logics with bounded Kripke models
Journal of Logic and Computation | 2002-07-14 | Paper |
scientific article; zbMATH DE number 1696769 (Why is no real title available?)
(available as arXiv preprint) | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1612549 (Why is no real title available?) | 2001-07-01 | Paper |
| scientific article; zbMATH DE number 1500655 (Why is no real title available?) | 2001-01-11 | Paper |
Finiteness in infinite-valued Łukasiewicz logic
Journal of Logic, Language and Information | 2000-12-17 | Paper |
Sequent calculi for finite-valued Lukasiewicz logics via Boolean decompositions
Journal Of Logic And Computation | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1341471 (Why is no real title available?) | 2000-02-28 | Paper |
A sufficient condition for completability of partial combinatory algebras
Journal of Symbolic Logic | 1999-08-17 | Paper |
| scientific article; zbMATH DE number 1222563 (Why is no real title available?) | 1999-03-02 | Paper |
| scientific article; zbMATH DE number 1088196 (Why is no real title available?) | 1997-11-17 | Paper |
