| Publication | Date of Publication | Type |
|---|
Disjunctive syllogism without \textit{ex falso}
| 2024-10-01 | Paper |
Proof Compression and NP Versus PSPACE II: Addendum
Bulletin of the Section of Logic | 2024-02-29 | Paper |
Indexed and fibered structures for partial and total correctness assertions
Mathematical Structures in Computer Science | 2023-04-19 | Paper |
scientific article; zbMATH DE number 7599997 (Why is no real title available?)
| 2022-10-12 | Paper |
Exponentially huge natural deduction proofs are redundant: preliminary results on \(M_{\supset}\)
| 2022-10-12 | Paper |
scientific article; zbMATH DE number 7503136 (Why is no real title available?)
| 2022-04-04 | Paper |
DE ZOLT’S POSTULATE: AN ABSTRACT APPROACH
The Review of Symbolic Logic | 2022-03-18 | Paper |
Propositional logics complexity and the sub-formula property
| 2021-12-03 | Paper |
Finiteness and computation in toposes
| 2021-12-02 | Paper |
Proof-graphs for minimal implicational logic
| 2021-06-22 | Paper |
Proof compression and NP versus PSPACE. II
Bulletin of the Section of Logic | 2021-01-28 | Paper |
Indexed and fibred structures for Hoare logic
| 2021-01-19 | Paper |
scientific article; zbMATH DE number 7238913 (Why is no real title available?)
| 2020-08-25 | Paper |
On constructive fragments of classical logic
Dag Prawitz on Proofs and Meaning | 2020-02-04 | Paper |
Proof compression and NP versus PSPACE
Studia Logica | 2019-05-15 | Paper |
Propositional dynamic logic for Petri nets
Logic Journal of the IGPL | 2019-01-08 | Paper |
Towards reasoning about Petri nets: a propositional dynamic logic based approach
Theoretical Computer Science | 2018-09-24 | Paper |
On strong normalization in proof-graphs for propositional logic
| 2018-04-23 | Paper |
Defining effectiveness using finite sets. A study on computability
| 2017-05-19 | Paper |
A unified procedure for provability and counter-model generation in minimal implicational logic
| 2017-05-19 | Paper |
Propositional dynamic logic for Petri nets with iteration
Theoretical Aspects of Computing – ICTAC 2016 | 2016-12-21 | Paper |
How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning
| 2016-12-16 | Paper |
Yet another bijection between sequent calculus and natural deduction
| 2016-08-01 | Paper |
A calculus for automatic verification of Petri nets based on resolution and dynamic logics
| 2016-08-01 | Paper |
Extending propositional dynamic logic for Petri nets
| 2016-05-10 | Paper |
Finitely many-valued logics and natural deduction
Logic Journal of the IGPL | 2015-02-27 | Paper |
A Topos-Theoretic Approach to Counterfactual Logic
Electronic Notes in Theoretical Computer Science | 2014-07-23 | Paper |
On the computability of relations on \(\lambda \)-terms and Rice's theorem -- the case of the expansion problem for explicit substitutions
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Language-oriented formal analysis: a case study on protocols and distributed systems
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
Constructive description logics hybrid-style
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
A Fibonacci estimation for the height of Schütte-like cut-free proofs
| 2013-04-24 | Paper |
Quantifying in extensive games
| 2011-03-30 | Paper |
Mapping modular SOS to rewriting logic
Logic Based Program Synthesis and Transformation | 2011-03-04 | Paper |
Providing a proof-theoretical basis for explanation: A case study on UML and ALCQI reasoning
| 2011-02-10 | Paper |
A note on the size of minimal covers
Information Processing Letters | 2010-01-29 | Paper |
Proof compressions with circuit-structured substitutions
Journal of Mathematical Sciences (New York) | 2010-01-15 | Paper |
Action Algebras and Model Algebras in Denotational Semantics
Semantics and Algebraic Specification | 2009-10-22 | Paper |
Fibred and Indexed Categories for Abstract Model Theory
Logic Journal of the IGPL | 2008-01-18 | Paper |
Using the Internal Logic of a Topos to Model Search Spaces for Problems
Logic Journal of the IGPL | 2008-01-18 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Exploring Computational Contents of Intuitionist Proofs
Logic Journal of the IGPL | 2005-08-03 | Paper |
scientific article; zbMATH DE number 2097567 (Why is no real title available?)
| 2004-09-07 | Paper |
scientific article; zbMATH DE number 2015290 (Why is no real title available?)
| 2003-12-09 | Paper |
scientific article; zbMATH DE number 2015275 (Why is no real title available?)
| 2003-12-09 | Paper |
Code migration and program maintainability -- A categorical perspective
Information Processing Letters | 2002-07-14 | Paper |
scientific article; zbMATH DE number 1696903 (Why is no real title available?)
| 2002-01-28 | Paper |
Gentzen's second consistency proof and strong cut-elimination
Logique et Analyse. Nouvelle Série | 2001-09-04 | Paper |
scientific article; zbMATH DE number 1537943 (Why is no real title available?)
| 2000-12-03 | Paper |
scientific article; zbMATH DE number 1463257 (Why is no real title available?)
| 2000-07-25 | Paper |
scientific article; zbMATH DE number 1104395 (Why is no real title available?)
| 1998-02-02 | Paper |
A Concrete Categorical Model for the Lambek Syntactic Calculus
Mathematical Logic Quarterly | 1997-05-25 | Paper |
A formalization of Sambins's normalization for GL
Mathematical Logic Quarterly | 1994-08-31 | Paper |
scientific article; zbMATH DE number 4043813 (Why is no real title available?)
| 1988-01-01 | Paper |
