The following pages link to Andrés Cordón-Franco (Q391144):
Displaying 26 items.
- A colouring protocol for the generalized Russian cards problem (Q391146) (← links)
- A geometric protocol for cryptography with cards (Q488255) (← links)
- (Q701731) (redirect page) (← links)
- On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction (Q701734) (← links)
- A Prolog simulator for deterministic P systems with active membranes (Q1762939) (← links)
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas (Q2449854) (← links)
- Local induction and provably total computable functions (Q2453069) (← links)
- (Q2869467) (← links)
- Local Induction and Provably Total Computable Functions: A Case Study (Q2904439) (← links)
- A note on parameter free Π<sub>1</sub> -induction and restricted exponentiation (Q3096079) (← links)
- (Q3172123) (← links)
- EXISTENTIALLY CLOSED MODELS IN THE FRAMEWORK OF ARITHMETIC (Q3188343) (← links)
- Envelopes, indicators and conservativeness (Q3376540) (← links)
- Existentially Closed Models and Conservation Results in Bounded Arithmetic (Q3611724) (← links)
- Fragments of Arithmetic and true sentences (Q4680381) (← links)
- Computer Science Logic (Q5311268) (← links)
- Membrane Computing (Q5316629) (← links)
- Membrane Computing (Q5316630) (← links)
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION (Q5359565) (← links)
- On the Optimality of Conservation Results for Local Reflection in Arithmetic (Q5407039) (← links)
- DYNAMIC CONSEQUENCE AND PUBLIC ANNOUNCEMENT (Q5414136) (← links)
- A note on Σ<sub>1</sub>-maximal models (Q5422319) (← links)
- On Rules and Parameter Free Systems in Bounded Arithmetic (Q5425319) (← links)
- Membrane Computing (Q5901885) (← links)
- Lipschitz and Wadge binary games in second order arithmetic (Q6109090) (← links)
- Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)
