| Publication | Date of Publication | Type |
|---|
A simplified lower bound for implicational logic
The Bulletin of Symbolic Logic | 2025-04-25 | Paper |
A note on the theory of well orders
The Bulletin of Symbolic Logic | 2025-03-20 | Paper |
Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts
Mathematical Logic Quarterly | 2023-09-15 | Paper |
The theory of hereditarily bounded sets
Mathematical Logic Quarterly | 2023-09-12 | Paper |
Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\)
Annals of Pure and Applied Logic | 2023-04-27 | Paper |
| A simplified lower bound for implicational logic | 2023-03-27 | Paper |
On the proof complexity of logics of bounded branching
Annals of Pure and Applied Logic | 2022-10-14 | Paper |
Iterated multiplication in VTC^0
Archive for Mathematical Logic | 2022-07-15 | Paper |
Elementary analytic functions in $VTC^0$
(available as arXiv preprint) | 2022-06-24 | Paper |
On the complexity of the clone membership problem
Theory of Computing Systems | 2021-08-05 | Paper |
Rules with parameters in modal logic. II.
Annals of Pure and Applied Logic | 2020-10-07 | Paper |
Recursive functions and existentially closed structures
Journal of Mathematical Logic | 2020-06-26 | Paper |
Rigid models of Presburger arithmetic
Mathematical Logic Quarterly | 2020-05-06 | Paper |
On the proof complexity of logics of bounded branching
(available as arXiv preprint) | 2020-04-23 | Paper |
Induction rules in bounded arithmetic
Archive for Mathematical Logic | 2020-04-01 | Paper |
Galois connection for multiple-output operations
Algebra Universalis | 2018-07-16 | Paper |
Cluster expansion and the boxdot conjecture
Mathematical Logic Quarterly | 2017-02-01 | Paper |
Division by zero
Archive for Mathematical Logic | 2016-11-01 | Paper |
Proof complexity of intuitionistic implicational formulas
Annals of Pure and Applied Logic | 2016-10-26 | Paper |
A note on the substructural hierarchy
Mathematical Logic Quarterly (MLQ) | 2016-03-17 | Paper |
Integer factoring and modular square roots
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Blending margins: the modal logic K has nullary unification type
Journal Of Logic And Computation | 2015-11-03 | Paper |
Rules with parameters in modal logic. I.
Annals of Pure and Applied Logic | 2015-05-26 | Paper |
Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
Archive for Mathematical Logic | 2015-04-14 | Paper |
The foundation axiom and elementary self-embeddings of the universe
(available as arXiv preprint) | 2015-04-09 | Paper |
The complexity of admissible rules of Łukasiewicz logic
Journal Of Logic And Computation | 2013-06-27 | Paper |
Real closures of models of weak arithmetic
Archive for Mathematical Logic | 2013-02-15 | Paper |
The ubiquity of conservative translations
The Review of Symbolic Logic | 2013-01-10 | Paper |
Root finding with threshold circuits
Theoretical Computer Science | 2012-11-27 | Paper |
Sequence encoding without induction
Mathematical Logic Quarterly (MLQ) | 2012-06-01 | Paper |
Proofs with monotone cuts
Mathematical Logic Quarterly (MLQ) | 2012-06-01 | Paper |
On theories of bounded arithmetic for \(\mathrm{NC}^1\)
Annals of Pure and Applied Logic | 2011-09-12 | Paper |
A sorting network in bounded arithmetic
Annals of Pure and Applied Logic | 2011-09-12 | Paper |
Bases of admissible rules of Łukasiewicz logic
Journal Of Logic And Computation | 2011-01-19 | Paper |
Abelian groups and quadratic residues in weak arithmetic
Mathematical Logic Quarterly | 2010-06-10 | Paper |
Admissible Rules of Lukasiewicz Logic
Journal Of Logic And Computation | 2010-04-21 | Paper |
Canonical rules
Journal of Symbolic Logic | 2010-01-07 | Paper |
Approximate counting by hashing in bounded arithmetic
Journal of Symbolic Logic | 2009-09-29 | Paper |
Substitution Frege and extended Frege proof systems in non-classical logics
Annals of Pure and Applied Logic | 2009-06-10 | Paper |
Proof Complexity of the Cut-free Calculus of Structures
Journal Of Logic And Computation | 2009-04-16 | Paper |
Independent Bases of Admissible Rules
Logic Journal of the IGPL | 2008-06-27 | Paper |
On Independence of Variants of the Weak Pigeonhole Principle
Journal Of Logic And Computation | 2007-12-12 | Paper |
Approximate counting in bounded arithmetic
Journal of Symbolic Logic | 2007-10-17 | Paper |
Approximate counting in bounded arithmetic
Journal of Symbolic Logic | 2007-10-17 | Paper |
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
The Bulletin of Symbolic Logic | 2007-08-08 | Paper |
Complexity of admissible rules
Archive for Mathematical Logic | 2007-03-06 | Paper |
The strength of sharply bounded induction
MLQ | 2007-02-02 | Paper |
Frege systems for extensible modal logics
Annals of Pure and Applied Logic | 2006-09-14 | Paper |
Subdirectly irreducible non-idempotent left symmetric left distributive groupoids
Discussiones Mathematicae - General Algebra and Applications | 2006-07-14 | Paper |
Admissible Rules of Modal Logics
Journal Of Logic And Computation | 2005-10-18 | Paper |
Dual weak pigeonhole principle, Boolean complexity, and derandomization
Annals of Pure and Applied Logic | 2004-11-22 | Paper |
A note on Grzegorczyk's logic
Mathematical Logic Quarterly | 2004-08-06 | Paper |
On the theory of exponential integer parts
(available as arXiv preprint) | N/A | Paper |
