The standard semantics of multi-agent epistemic logic S5 is based on Kripke models whose
accessibility relations are reflexive, symmetric and transitive. This one dimensional structure …

Simplicial complexes are a versatile and convenient paradigm on which to build all the tools
and techniques of the logic of knowledge, on the assumption that initial epistemic models …

Baryshnikov presented a remarkable algebraic topology proof of Arrow's impossibility
theorem trying to understand the underlying reason behind the numerous proofs of this …

In this paper we study the solvability of the equality negation task in a simple wait-free model
where two processes communicate by reading and writing shared variables or exchanging …

In recent years, a new class of models for multi-agent epistemic logic has emerged, based
on simplicial complexes. Since then, many variants of these simplicial models have been …

In this paper we study the solvability of the equality negation task in a simple wait-free model
where processes communicate by reading and writing shared variables or exchanging …

The field of fault-tolerant protocols studies which concurrent tasks are solvable in various
computational models where processes may crash. To answer these questions, powerful …

The logical method proposed by Goubault, Ledent, and Rajsbaum provides a means of
demonstrating the unsolvability of distributed tasks within the epistemic logic framework. To …

Pseudospheres are simplicial complexes defined in the late 1990s to model some aspects
of distributed systems. Since then, combinatorial properties of pseudospheres combined …

Much discussion exists about what is computation, but less about is a computational
problem. Turing's definition of computation was based on computing functions. When we …