Andrés Cordón-Franco

According to our database1, Andrés Cordón-Franco authored at least 24 papers between 2003 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Predicativity through Transfinite Reflection.
J. Symb. Log., 2017

2016
Existentially Closed Models in the Framework of Arithmetic.
J. Symb. Log., 2016

2015
A geometric protocol for cryptography with cards.
Des. Codes Cryptogr., 2015

2014
Local induction and provably total computable functions.
Ann. Pure Appl. Logic, 2014

On axiom schemes for T-provably Δ1 formulas.
Arch. Math. Log., 2014

2013
A colouring protocol for the generalized Russian cards problem.
Theor. Comput. Sci., 2013

Dynamic Consequence and Public announcement.
Rev. Symb. Log., 2013

On the optimality of conservation results for local reflection in arithmetic.
J. Symb. Log., 2013

2012
A secure additive protocol for card players.
Australasian J. Combinatorics, 2012

Local Induction and Provably Total Computable Functions: A Case Study.
Proceedings of the How the World Computes, 2012

2011
A note on parameter free Π1-induction and restricted exponentiation.
Math. Log. Q., 2011

Secure Communication of Local States in Interpreted Systems.
Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2011

2009
Existentially Closed Models and Conservation Results in Bounded Arithmetic.
J. Log. Comput., 2009

2007
A note on Σ1-maximal models.
J. Symb. Log., 2007

On Rules and Parameter Free Systems in Bounded Arithmetic.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Envelopes, indicators and conservativeness.
Math. Log. Q., 2006

2005
Fragments of Arithmetic and true sentences.
Math. Log. Q., 2005

2004
A Prolog Simulator for Deterministic P Systems with Active Membranes.
New Generation Comput., 2004

A Note on Complexity Measures for Probabilistic P Systems.
J. UCS, 2004

On the quantifier complexity of bigtriangleupn+1 (T)? induction.
Arch. Math. Log., 2004

Approximating Non-discrete P Systems.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Exploring Computation Trees Associated with P Systems.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Provably Total Primitive Recursive Functions: Theories with Induction.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem.
Proceedings of the Membrane Computing, International Workshop, 2003


  Loading...