Andrés Cordón-Franco

Axioms, May, 2024

Semi-honest subrecursive degrees and the collection rule in arithmetic.

[BibT_eX]

[DOI]

Arch. Math. Log., February, 2024

Lipschitz Determinacy and Arithmetic Transfinite Recursion.

[BibT_eX]

[DOI]

Manuel J. S. Loureiro

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

Lipschitz and Wadge binary games in second order arithmetic.

[BibT_eX]

[DOI]

Manuel J. S. Loureiro

Ann. Pure Appl. Log., October, 2023

2017

Predicativity through Transfinite Reflection.

[BibT_eX]

[DOI]

Joost J. Joosten

J. Symb. Log., 2017

2016

Existentially Closed Models in the Framework of Arithmetic.

[BibT_eX]

[DOI]

Zofia Adamowicz

J. Symb. Log., 2016

2015

A geometric protocol for cryptography with cards.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

2014

Local induction and provably total computable functions.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

On axiom schemes for T-provably Δ1 formulas.

[BibT_eX]

[DOI]

Arch. Math. Log., 2014

2013

A colouring protocol for the generalized Russian cards problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Dynamic Consequence and Public announcement.

[BibT_eX]

[DOI]

Ángel Nepomuceno-Fernández

Rev. Symb. Log., 2013

On the optimality of conservation results for local reflection in arithmetic.

[BibT_eX]

[DOI]

J. Symb. Log., 2013

2012

A secure additive protocol for card players.

[BibT_eX]

[DOI]

Joost J. Joosten

Australas. J Comb., 2012

Local Induction and Provably Total Computable Functions: A Case Study.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

2011

A note on parameter free Π1-induction and restricted exponentiation.

[BibT_eX]

[DOI]

Math. Log. Q., 2011

Secure Communication of Local States in Interpreted Systems.

[BibT_eX]

[DOI]

Michael H. Albert

Joost J. Joosten

Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2011

2009

Existentially Closed Models and Conservation Results in Bounded Arithmetic.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

2007

A note on Σ1-maximal models.

[BibT_eX]

[DOI]

J. Symb. Log., 2007

On Rules and Parameter Free Systems in Bounded Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

Envelopes, indicators and conservativeness.

[BibT_eX]

[DOI]

Math. Log. Q., 2006

2005

Fragments of Arithmetic and true sentences.

[BibT_eX]

[DOI]

Math. Log. Q., 2005

2004

A Prolog Simulator for Deterministic P Systems with Active Membranes.

[BibT_eX]

[DOI]

Miguel Angel Gutiérrez-Naranjo

Mario J. Pérez-Jiménez

New Gener. Comput., 2004

A Note on Complexity Measures for Probabilistic P Systems.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2004

On the quantifier complexity of bigtriangleupn+1 (T)? induction.

[BibT_eX]

[DOI]

Arch. Math. Log., 2004

Approximating Non-discrete P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 5th International Workshop, 2004

Exploring Computation Trees Associated with P Systems.

[BibT_eX]

[DOI]

Miguel Angel Gutiérrez-Naranjo

Mario J. Pérez-Jiménez

Agustin Riscos-Núñez

Proceedings of the Membrane Computing, 5th International Workshop, 2004

Provably Total Primitive Recursive Functions: Theories with Induction.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem.

[BibT_eX]

[DOI]

Miguel Angel Gutiérrez-Naranjo

Mario J. Pérez-Jiménez

Agustin Riscos-Núñez