David Fernández-Duque

Well-orders in the transfinite Japaridze algebra

This paper studies the transfinite propositional provability logics

Strong completeness of provability logic for ordinal spaces

\glp_\Lambda

Perfectly secure data aggregation via shifted projections

and their corresponding algebras. These logics have for each ordinal

PREDICATIVITY THROUGH TRANSFINITE REFLECTION

\xi< \Lambda

Secure aggregation of distributed information

a modality

The polytopologies of transfinite provability logic

\la \alpha \ra

A Logical Theory of Belief Dynamics for Resource-Bounded Agents

. We will focus on the closed fragment of

A Decidable Intuitionistic Temporal Logic.

\glp_\Lambda

Almost-perfect security for the Russian cards problem

(i.e., where no propositional variables occur) and \emph{worms} therein. Worms are iterated consistency expressions of the form

Frame-validity games and lower bounds on the complexity of modal axioms.

\la \xi_n\ra \ldots \la \xi_1 \ra \top