| Publication | Date of Publication | Type |
|---|
Towards recursion schemata for the probabilistic class PP
Boletim da Sociedade Portuguesa de Matemática | 2026-04-28 | Paper |
| Enumerating error bounded polytime algorithms through arithmetical theories | 2026-02-19 | Paper |
Frege's axiomatization of implication and the proof of the tautology \(\varphi\to\varphi\)
Boletim da Sociedade Portuguesa de Matemática | 2025-12-08 | Paper |
Numeral completeness of weak theories of arithmetic
Journal of Logic and Computation | 2025-10-15 | Paper |
| Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories | 2023-11-25 | Paper |
| scientific article; zbMATH DE number 7724208 (Why is no real title available?) | 2023-08-08 | Paper |
Implicit recursion-theoretic characterizations of counting classes
Archive for Mathematical Logic | 2022-10-18 | Paper |
| A recursion-theoretic characterisation of the positive polynomial-time functions | 2022-05-28 | Paper |
Lorenzen Between Gentzen and Schütte
Paul Lorenzen -- Mathematician and Logician | 2022-01-27 | Paper |
The polynomial hierarchy of functions and its levels
Theoretical Computer Science | 2021-12-22 | Paper |
scientific article; zbMATH DE number 7317230 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-03 | Paper |
| scientific article; zbMATH DE number 7317230 (Why is no real title available?) | 2021-03-03 | Paper |
| From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) | 2017-02-02 | Paper |
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
Information and Computation | 2016-05-03 | Paper |
Applicative theories for the polynomial hierarchy of time and its levels
Annals of Pure and Applied Logic | 2013-04-15 | Paper |
Monotonicity constraints in characterizations of PSPACE
Journal of Logic and Computation | 2012-05-07 | Paper |
A recursion-theoretic approach to NP
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
| Logspace without bounds | 2011-03-09 | Paper |
Towards an Implicit Characterization of NC k
Computer Science Logic | 2009-03-12 | Paper |
Recursion Schemata for NC k
Computer Science Logic | 2008-11-20 | Paper |
Characterizing PSPACE with pointers
Mathematical Logic Quarterly | 2008-06-12 | Paper |
An interpretation of \(S_2^1\) in \(\Sigma_1^b\)-NIA
Portugaliae Mathematica. Nova Série | 2007-09-05 | Paper |
Separating NC along the \(\delta\) axis
Theoretical Computer Science | 2004-08-06 | Paper |
Characterizing <i>NC</i> with tier 0 pointers
Mathematical Logic Quarterly | 2004-03-15 | Paper |
| scientific article; zbMATH DE number 2006637 (Why is no real title available?) | 2003-11-23 | Paper |
A term rewriting characterization of the functions computable in polynomial space
Archive for Mathematical Logic | 2003-09-16 | Paper |
| scientific article; zbMATH DE number 1018349 (Why is no real title available?) | 1997-06-09 | Paper |
