Francisco Félix Lara Martín

According to our database1, Francisco Félix Lara Martín authored at least 16 papers between 2001 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

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

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
On the optimality of conservation results for local reflection in arithmetic.
J. Symb. Log., 2013

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

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
Induction, minimization and collection for Deltan+1(T)-formulas.
Arch. Math. Log., 2004

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

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

2001
Some Results on L-Delta-- n+1.
Math. Log. Q., 2001


  Loading...