| Publication | Date of Publication | Type |
|---|
| Realizability at work: separating two constructive notions of finiteness | 2026-02-20 | Paper |
| A normalizing computation rule for propositional extensionality in higher-order minimal logic | 2026-02-20 | Paper |
| On symmetries of spheres in univalent foundations | 2025-06-18 | Paper |
| Type theory with explicit universe polymorphism | 2024-11-26 | Paper |
On generalized algebraic theories and categories with families
Mathematical Structures in Computer Science | 2022-06-24 | Paper |
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Theoretical Computer Science | 2022-04-07 | Paper |
Construction of the circle in \textit{UniMath}
Journal of Pure and Applied Algebra | 2021-06-09 | Paper |
A Note on Generalized Algebraic Theories and Categories with Families
(available as arXiv preprint) | 2020-12-15 | Paper |
Skolem’s Theorem in Coherent Logic
Fundamenta Informaticae | 2020-01-24 | Paper |
Construction of the Circle in UniMath
(available as arXiv preprint) | 2019-10-04 | Paper |
The univalence axiom in cubical sets
Journal of Automated Reasoning | 2019-08-21 | Paper |
| Completeness of cutting planes revisited | 2019-07-24 | Paper |
Syntactic forcing models for coherent logic
Indagationes Mathematicae. New Series | 2018-10-08 | Paper |
Improving IntSat by expressing disjunctions of bounds as linear constraints
AI Communications | 2017-11-07 | Paper |
| Non-constructivity in Kan simplicial sets | 2017-07-12 | Paper |
| scientific article; zbMATH DE number 6694181 (Why is no real title available?) | 2017-03-13 | Paper |
A Kripke model for simplicial sets
Theoretical Computer Science | 2015-02-24 | Paper |
A vernacular for coherent logic
Lecture Notes in Computer Science | 2014-08-07 | Paper |
On streams that are finitely red
Logical Methods in Computer Science | 2012-10-22 | Paper |
Expressive power of digraph solvability
Annals of Pure and Applied Logic | 2012-04-13 | Paper |
Hard problems in max-algebra, control theory, hypergraphs and other areas
Information Processing Letters | 2010-09-02 | Paper |
| scientific article; zbMATH DE number 5604075 (Why is no real title available?) | 2009-09-15 | Paper |
Developing bounded reasoning
Journal of Logic, Language and Information | 2009-03-24 | Paper |
Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
Discrete Applied Mathematics | 2009-03-04 | Paper |
The Max-Atom Problem and Its Relevance
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Automating Coherent Logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Completeness and Decidability in Sequence Logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
On the mechanization of the proof of Hessenberg's theorem in coherent logic
Journal of Automated Reasoning | 2008-02-18 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
| scientific article; zbMATH DE number 2185652 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2155188 (Why is no real title available?) | 2005-04-11 | Paper |
A descriptive characterisation of even linear languages
Grammars | 2004-05-27 | Paper |
Automated proof construction in type theory using resolution
Journal of Automated Reasoning | 2003-04-27 | Paper |
| scientific article; zbMATH DE number 1841821 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1614692 (Why is no real title available?) | 2001-07-05 | Paper |
| scientific article; zbMATH DE number 1368923 (Why is no real title available?) | 2000-04-09 | Paper |
On the computational content of the axiom of choice
Journal of Symbolic Logic | 1999-06-21 | Paper |
Diagram techniques for confluence
Information and Computation | 1998-11-10 | Paper |
Two finite specifications of a queue
Theoretical Computer Science | 1998-07-23 | Paper |
Formalizing process algebraic verifications in the calculus of constructions
Formal Aspects of Computing | 1997-08-17 | Paper |
Polymorphic extensions of simple type structures. With an application to a bar recursive minimization
Annals of Pure and Applied Logic | 1997-05-28 | Paper |
A simple proof of the undecidability of inhabitation in λP
Journal of Functional Programming | 1997-03-18 | Paper |
Undecidable goals for completed acyclic programs
New Generation Computing | 1995-01-12 | Paper |
Strong termination of logic programs
The Journal of Logic Programming | 1993-05-16 | Paper |
Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
Journal of the London Mathematical Society | 1993-01-01 | Paper |
Semantics and Consistency of Rule based Expert Systems
Journal Of Logic And Computation | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 25189 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4147550 (Why is no real title available?) | 1990-01-01 | Paper |
Completeness of resolution revisited
Theoretical Computer Science | 1990-01-01 | Paper |
Compact and majorizable functionals of finite type
Journal of Symbolic Logic | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4080960 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4076677 (Why is no real title available?) | 1988-01-01 | Paper |
Equivalence of bar recursors in the theory of functionals of finite type
Archive for Mathematical Logic | 1988-01-01 | Paper |
On estimating the complexity of logarithmic decomposition
Information Processing Letters | 1988-01-01 | Paper |
Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
Journal of Symbolic Logic | 1985-01-01 | Paper |
Isomorphisms between HEO and HRO<sup>E</sup>, ECF and ICF<sup>E</sup>
Journal of Symbolic Logic | 1985-01-01 | Paper |
Strong normalization of barrecursive terms without using infinite terms
Archiv für Mathematische Logik und Grundlagenforschung | 1985-01-01 | Paper |
