The following pages link to David Fernández-Duque (Q385071):
Displaying 50 items.
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions (Q385073) (← links)
- A colouring protocol for the generalized Russian cards problem (Q391146) (← links)
- Evidence and plausibility in neighborhood structures (Q392275) (← links)
- On provability logics with linearly ordered modalities (Q456968) (← links)
- A geometric protocol for cryptography with cards (Q488255) (← links)
- A case study in almost-perfect security for unconditionally secure communication (Q517272) (← links)
- (Q763327) (redirect page) (← links)
- On the modal definability of simulability by finite transitive models (Q763328) (← links)
- Tangled modal logic for topological dynamics (Q764267) (← links)
- Dynamic topological logic interpreted over minimal systems (Q766293) (← links)
- To drive or not to drive: a logical and computational analysis of European transport regulations (Q821552) (← links)
- Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy (Q897593) (← links)
- Perfectly secure data aggregation via shifted projections (Q1615724) (← links)
- The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
- The dynamics of epistemic attitudes in resource-bounded agents (Q2001362) (← links)
- Ekeland's variational principle in weak and strong systems of arithmetic (Q2003985) (← links)
- Ackermannian Goodstein sequences of intermediate growth (Q2106602) (← links)
- A non-hyperarithmetical Gödel logic (Q2151390) (← links)
- Hyperarithmetical worm battles (Q2151396) (← links)
- Axiomatic systems and topological semantics for intuitionistic temporal logic (Q2296760) (← links)
- A self-contained provability calculus for \(\varGamma_0\) (Q2303588) (← links)
- The polytopologies of transfinite provability logic (Q2449857) (← links)
- Deducibility and independence in Beklemishev's autonomous provability calculus (Q2672664) (← links)
- (Q2869467) (← links)
- (Q2904049) (← links)
- Turing Progressions and Their Well-Orders (Q2904409) (← links)
- Tableaux for structural abduction (Q2909833) (← links)
- A modal framework for modelling abductive reasoning (Q2909837) (← links)
- A sound and complete axiomatization for Dynamic Topological Logic (Q2915900) (← links)
- On the definability of simulation and bisimulation in epistemic logic (Q2939298) (← links)
- On the Definability of Simulability and Bisimilarity by Finite Epistemic Models (Q3092294) (← links)
- (Q3305196) (← links)
- Dynamic Topological Completeness for (Q3442403) (← links)
- Verification logic (Q4555452) (← links)
- The intuitionistic temporal logic of dynamical systems (Q4580328) (← links)
- (Q4636023) (← links)
- (Q4636027) (← links)
- Well-orders in the transfinite Japaridze algebra (Q4644499) (← links)
- Forgetting complex propositions (Q4644607) (← links)
- STRONG COMPLETENESS OF PROVABILITY LOGIC FOR ORDINAL SPACES (Q4977222) (← links)
- (Q5000284) (← links)
- (Q5039160) (← links)
- Frame-validity Games and Lower Bounds on the Complexity of Modal Axioms (Q5066806) (← links)
- (Q5071250) (← links)
- COMPLETE INTUITIONISTIC TEMPORAL LOGICS FOR TOPOLOGICAL DYNAMICS (Q5100046) (← links)
- A Decidable Intuitionistic Temporal Logic (Q5111181) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
- Intuitionistic Linear Temporal Logics (Q5216145) (← links)
- (Q5224561) (← links)
- An intuitionistic axiomatization of `eventually' (Q5224567) (← links)
