Perfil del autor: Cordón Franco, Andrés
Datos institucionales
| Nombre | Cordón Franco, Andrés |
| Departamento | Ciencias de la Computación e Inteligencia Artificial |
| Área de conocimiento | Ciencia de la Computación e Inteligencia Artificial |
| Categoría profesional | Profesor Titular de Universidad |
| Correo electrónico | Solicitar |
 |
|
Estadísticas
-
Nº publicaciones
37
-
Nº visitas
5014
-
Nº descargas
6586
| Publicaciones |
|---|
Trabajo Fin de Grado
 Lógica Epistémica Dinámica
(2023)
En este trabajo hacemos un repaso de algunas de las principales propuestas en el área de la lógica epistémica dinámica, ... |
Trabajo Fin de Grado
Una introducción a la programación con conjuntos de respuesta. Aplicaciones
(2022)
The main objective of this paper is to present the answer set programming paradigm as a tool to model and solve combinatorial ... |
Trabajo Fin de Grado
Eliminación de cuantificadores para cuerpos algebraicamente cerrados y cuerpos reales cerrados
(2022)
El proyecto tiene como objetivo estudiar la Teor´ıa de Modelos de los cuerpos algebraicamente cerrados y los cuerpos reales ... |
Trabajo Fin de Grado
Subsistemas de la Aritmética de Segundo Orden y Matemática Inversa
(2022)
Este trabajo de fin de grado consiste en una introducción a la matemática inversa. En ´el introduciremos la aritmética de ... |
Trabajo Fin de Grado
Lógica epistémica: sintaxis y semántica, completitud, expresabilidad.
(2020)
A lo largo de este trabajo nos centraremos en presentar, desarrollar y estudiar diferentes lógicas epistémicas y algunas ... |
Trabajo Fin de Grado
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, ... |
Trabajo Fin de Grado
Aspectos matemáticos de la semántica de los programas lógicos normales
(2020)
El presente trabajo se enmarca en el campo de la Programación Lógica y, más concretamente, en el estudio de la semántica ... |
Trabajo Fin de Grado
Fundamentos lógicos de la Inteligencia Artificial: razonamiento no monótono
(2019)
La lógica tradicional resulta muy útil para formalizar razonamientos matemáticos: teoremas, definiciones... en los que se ... |
Artículo
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 ... |
Tesis Doctoral
Semilinear order property and infinite games
(2016)
En este trabajo se analiza la determinación de juegos de Lipschitz y Wadge, junto con la propiedad de ordenación semilineal, ... |
Artículo
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. ... |
Artículo
A geometric protocol for cryptography with cards
(Springer, 2015)
In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a, b and c cards, respectively, from ... |
Artículo
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 ... |
Artículo
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. ... |
Artículo
Dynamic consequence and public announcement
(Cambridge University Press, 2013)
|
Artículo
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 ... |
Artículo
A colouring protocol for the generalized Russian cards problem
(Elsevier, 2013)
In the generalized Russian cards problem, Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of size a ... |
Artículo
A secure additive protocol for card players
(University of Queensland, 2012)
Consider three players Alice, Bob and Cath who hold a, b and c cards, respectively, from a deck of d=a+b+c cards. The cards ... |
Ponencia
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 ... |
Ponencia
Secure Communication of Local States in Interpreted Systems
(Springer, 2011)
Given an interpreted system, we investigate ways for two agents to communicate secrets by public announcements. For card ... |
Artículo
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 ... |
Artículo
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 ... |
Ponencia
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. |
Artículo
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 ... |
Artículo
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 ... |
Artículo
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 ... |
Capítulo de Libro
Exploring Computation Trees Associated with P Systems
(Springer, 2005)
Usually, the evolution of a P system generates a computation tree too large to be efficiently handled with present–day ... |
Capítulo de Libro
Cellular solutions to some numerical NP-complete problems: A prolog implementation
(Idea Group Inc., 2005)
This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, ... |
Ponencia
Looking for P Truth
(Fénix Editora, 2004)
In a general sense, Logic studies how to derive new pieces of in- formation from previous ones. In this paper we explore ... |
Ponencia
Approximating Non-discrete P Systems
(Springer, 2004)
The main goal of this paper is to propose some geometric approaches to the computations of non-discrete P systems. The ... |
Capítulo de Libro
Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem
(Springer, 2004)
In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division. |
Artículo
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 ... |
Ponencia
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 ... |
Artículo
A Prolog Simulator for Deterministic P Systems with Active Membranes
(Springer, 2004)
In this paper we propose a new way to represent P systems with active membranes based on Logic Programming techniques. ... |
Ponencia
Weak Metrics on Configurations of a P System
(Fénix Editora, 2004)
The evolution of a P system generates a tree of computation po- tentially in¯nite where it is very difficult to set the ... |
Artículo
A Note on Complexity Measures for Probabilistic P Systems
(J.UCS.org, 2004)
In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in ... |
Tesis Doctoral
Extensiones de fragmentos de la Aritmética
(2003)
El presente trabajo se enmarca dentro del campo de estudio de los Modelos de la Aritmética de Peano: PA. En líneas generales, ... |