Andrés Cordón-Franco

From MaRDI portal
Revision as of 18:13, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Andrés Cordón-Franco to Andrés Cordón-Franco: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:391144

Available identifiers

zbMath Open cordon-franco.andresDBLP16/3135WikidataQ62577629 ScholiaQ62577629MaRDI QIDQ391144

List of research outcomes





PublicationDate of PublicationType
Semi-honest subrecursive degrees and the collection rule in arithmetic2024-01-18Paper
Lipschitz and Wadge binary games in second order arithmetic2023-07-26Paper
PREDICATIVITY THROUGH TRANSFINITE REFLECTION2017-09-26Paper
EXISTENTIALLY CLOSED MODELS IN THE FRAMEWORK OF ARITHMETIC2016-08-19Paper
A geometric protocol for cryptography with cards2015-01-23Paper
Local induction and provably total computable functions2014-06-06Paper
On axiom schemes for \(T\)-provably \(\Delta_1\) formulas2014-05-12Paper
DYNAMIC CONSEQUENCE AND PUBLIC ANNOUNCEMENT2014-05-02Paper
On the Optimality of Conservation Results for Local Reflection in Arithmetic2014-04-04Paper
A colouring protocol for the generalized Russian cards problem2014-01-10Paper
https://portal.mardi4nfdi.de/entity/Q28694672014-01-03Paper
Local Induction and Provably Total Computable Functions: A Case Study2012-08-14Paper
A note on parameter free Π1 -induction and restricted exponentiation2011-11-07Paper
https://portal.mardi4nfdi.de/entity/Q31721232011-10-05Paper
Membrane Computing2009-05-15Paper
Existentially Closed Models and Conservation Results in Bounded Arithmetic2009-03-02Paper
On Rules and Parameter Free Systems in Bounded Arithmetic2007-11-13Paper
A note on Σ1-maximal models2007-10-17Paper
Envelopes, indicators and conservativeness2006-03-24Paper
Membrane Computing2005-09-14Paper
Membrane Computing2005-09-14Paper
Computer Science Logic2005-08-22Paper
Fragments of Arithmetic and true sentences2005-06-01Paper
A Prolog simulator for deterministic P systems with active membranes2005-02-11Paper
On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction2004-12-16Paper

Research outcomes over time

This page was built for person: Andrés Cordón-Franco