| Publication | Date of Publication | Type |
|---|
Semi-honest subrecursive degrees and the collection rule in arithmetic
Archive for Mathematical Logic | 2024-01-18 | Paper |
Lipschitz and Wadge binary games in second order arithmetic
Annals of Pure and Applied Logic | 2023-07-26 | Paper |
PREDICATIVITY THROUGH TRANSFINITE REFLECTION
Journal of Symbolic Logic | 2017-09-26 | Paper |
PREDICATIVITY THROUGH TRANSFINITE REFLECTION
Journal of Symbolic Logic | 2017-09-26 | Paper |
Existentially closed models in the framework of arithmetic
Journal of Symbolic Logic | 2016-08-19 | Paper |
A geometric protocol for cryptography with cards
Designs, Codes and Cryptography | 2015-01-23 | Paper |
Local induction and provably total computable functions
Annals of Pure and Applied Logic | 2014-06-06 | Paper |
On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
Archive for Mathematical Logic | 2014-05-12 | Paper |
DYNAMIC CONSEQUENCE AND PUBLIC ANNOUNCEMENT
The Review of Symbolic Logic | 2014-05-02 | Paper |
On the optimality of conservation results for local reflection in arithmetic
Journal of Symbolic Logic | 2014-04-04 | Paper |
On the optimality of conservation results for local reflection in arithmetic
Journal of Symbolic Logic | 2014-04-04 | Paper |
A colouring protocol for the generalized Russian cards problem
Theoretical Computer Science | 2014-01-10 | Paper |
A secure additive protocol for card players
The Australasian Journal of Combinatorics | 2014-01-03 | Paper |
Local induction and provably total computable functions: a case study
Lecture Notes in Computer Science | 2012-08-14 | Paper |
A note on parameter free \(\Pi _{1}\)-induction and restricted exponentiation
Mathematical Logic Quarterly | 2011-11-07 | Paper |
| Conservation results for parameter-free \(\Pi_n\)-induction | 2011-10-05 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2009-05-15 | Paper |
Existentially Closed Models and Conservation Results in Bounded Arithmetic
Journal Of Logic And Computation | 2009-03-02 | Paper |
On Rules and Parameter Free Systems in Bounded Arithmetic
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A note on Σ1-maximal models
Journal of Symbolic Logic | 2007-10-17 | Paper |
Envelopes, indicators and conservativeness
MLQ | 2006-03-24 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2005-09-14 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2005-09-14 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Fragments of Arithmetic and true sentences
Mathematical Logic Quarterly | 2005-06-01 | Paper |
A Prolog simulator for deterministic P systems with active membranes
New Generation Computing | 2005-02-11 | Paper |
On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
Archive for Mathematical Logic | 2004-12-16 | Paper |
