13 citations · 72 across the 24 of their papers we have counts for
5 papers · 1 filter
Strong Completeness of Provability Logic for Ordinal Spaces
Juan P. Aguilera, David Fernández-Duque
Abashidze and Blass independently proved that the modal logic is complete for its topological interpretation over any ordinal greater than or equal to equipped with…
Forgetting complex propositions
David Fernández-Duque, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morrillo +2
This paper uses possible-world semantics to model the changes that may occur in an agent's knowledge as she loses information. This builds on previous work in which the agent may f…
Perfectly secure data aggregation via shifted projections
David Fernández-Duque
We study a general scenario where confidential information is distributed among a group of agents who wish to share it in such a way that the data becomes common knowledge among th…
A case study in almost-perfect security for unconditionally secure communication
Esteban Landerreche, David Fernández-Duque
In the Russian cards problem, Alice, Bob and Cath draw , and cards, respectively, from a publicly known deck. Alice and Bob must then communicate their cards to each oth…
Predicativity through transfinite reflection
Andrés Cordon Franco, David Fernández Duque, Joost J. Joosten +1
Peano Arithmetic is known to be provably equivalent to reflection over Elementary Arithmetic. We prove a characterization of Predicative Analysis in the guise of ATR0 in terms of s…