Author profile: Lara Martín, Francisco Félix
Institutional data
| Name | Lara Martín, Francisco Félix |
| Department | Ciencias de la Computación e Inteligencia Artificial |
| Knowledge area | Ciencia de la Computación e Inteligencia Artificial |
| Professional category | Profesor Titular de Universidad |
| Request | |
 |
|
Statistics
-
No. publications
24
-
No. visits
3231
-
No. downloads
8821
| Publications |
|---|
Final Degree Project
 Teoría de conjuntos finitos
(2023)
La Teoría de Conjuntos es un área del conocimiento comprendida entre la Lógica y las Matemáticas dedicada a la fundamentación ... |
Final Degree Project
La lógica de la demostrabilidad
(2021)
Our main goal in this work is the study of the arithmetical completeness theorem for GL (presented for first time by Solovay ... |
Final Degree Project
El teorema de Goodstein
(2021)
Este trabajo se centra en el Teorema de Goodstein. El primer objetivo será demostrarlo. Para ello, debemos introducir al ... |
Final Degree Project
El Axioma de Determinación
(2020)
The aim of this work is to study the consequences of assuming the axiom of determinacy regarding perfect set property, ... |
Final Degree Project
Fundamentos de IA para el ajedrez
(2019)
El presente trabajo tiene como objetivo la introducción y desarrollo de los fundamentos teóricos de algunas técnicas ... |
Final Degree Project
Lógica minimal, intuicionista y clásica
(2018)
The classical systems traditionally accepted within formal mathematical reasoning coexists with other branches of logic ... |
Article
Predicativity through Transfinite Reflection
(The Association for Symbolic Logic, 2017)
Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use as a formalization of “φ is provable ... |
Final Degree Project
Complejidad computacional y álgebra de funciones
(2016)
Usually, computational complexity classes are given explicitly using computation models and certain restrictions on available ... |
Article
Existentially Closed Models in the Framework of Arithmetic
(The Association for Symbolic Logic, 2016)
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (parameter free) П1–formula. ... |
Article
On axiom schemes for T-provably Δ1 formulas
(Springer, 2014)
This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and ... |
Article
Local induction and provably total computable functions
(Elsevier, 2014)
Let I¦− 2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to parameter free ¦2 formulas. ... |
Article
On the Optimality of Conservation Results for Local Reflection in Arithmetic
(Association for Symbolic Logic, 2013)
Let T be a recursively enumerable theory extending Elementary Arithmetic EA. L. D. Beklemishev proved that the Σ2 local ... |
Presentation
Local Induction and Provably Total Computable Functions: A Case Study
(Springer, 2012)
Let IΠ−2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to parameter free Π2 ... |
Article
A note on parameter free Π1-induction and restricted exponentiation
(Wiley, 2011)
We characterize the sets of all Π2 and all $\mathcal {B}(\Sigma _{1})$equation image (= Boolean combinations of Σ1) theorems ... |
Article
Existentially Closed Models and Conservation Results in Bounded Arithmetic
(Oxford Academic, 2009)
We develop model-theoretic techniques to obtain conservation results for first order Bounded Arithmetic theories, based ... |
Presentation
On Rules and Parameter Free Systems in Bounded Arithmetic
(Springer, 2007)
We present model–theoretic techniques to obtain conservation results for first order bounded arithmetic theories, based on a hierarchical version of the well known notion of an existentially closed model. |
Article
A Note on Σ₁-Maximal Models
(Association for Symbolic Logic, 2007)
Let T be a recursive theory in the language of first order Arithmetic. We prove that if T extends: (a) the scheme of ... |
Article
Envelopes, indicators and conservativeness
(Wiley, 2006)
A well known theorem proved (independently) by J. Paris and H. Friedman states that BΣn +1 (the fragment of Arithmetic ... |
Article
Fragments of Arithmetic and true sentences
(Wiley, 2005)
By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is ... |
Article
Induction, minimization and collection for Δ n+1 (T)–formulas
(Springer, 2004)
For a theory T, we study relationships among IΔ n +1 (T), LΔ n+1 (T) and B * Δ n+1 (T). These theories are obtained ... |
Article
On the quantifier complexity of Δ n+1 (T)– induction
(Springer, 2004)
In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity ... |
Presentation
Provably Total Primitive Recursive Functions: Theories with Induction
(Springer, 2004)
A natural example of a function algebra is R (T), the class of provably total computable functions (p.t.c.f.) of a theory ... |
Article
Some Results on LΔ n+1
(Wiley, 2001)
We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas. |
PhD Thesis
Inducción y recursión las teorías IDelta n+1(T) /
(1999)
En este trabajo se realiza un análisis de la conjetura de Friedman-Paris, acerca de la equivalencia entre los fragmentos ... |