13 citations · 70 across the 51 of their papers we have counts for
6 papers · 1 filter
The Complexity of the Constructive Master Modality
Sofía Santiago-Fernández, David Fernández-Duque, Joost J. Joosten
We introduce the semantically-defined constructive master-modality logics and , extending the basic constructive modal logic and the Wijesekera-style…
Tree Rewriting Calculi for Strictly Positive Logics
Sofía Santiago-Fernández, David Fernández-Duque, Joost J. Joosten
We study strictly positive logics in the language , which constructs formulas from , propositional variables, conjunction, and diamond modalities. We begin wit…
Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561
Moritz Müller, Joost J. Joosten
We discuss model-checking problems as formal models of algorithmic law. Specifically, we ask for an algorithmically tractable general purpose model-checking problem that naturally…
Hidden variables simulating quantum contextuality increasingly violate the Holevo bound
Adán Cabello, Joost J. Joosten
In this paper from 2011 we approach some questions about quantum contextuality with tools from formal logic. In particular, we consider an experiment associated with the Peres-Merm…
Complexity fits the fittest
J. J. Joosten
In this paper we shall relate computational complexity to the principle of natural selection. We shall do this by giving a philosophical account of complexity versus universality.…
On the necessity of complexity
Joost J. Joosten
Wolfram's Principle of Computational Equivalence (PCE) implies that universal complexity abounds in nature. This paper comprises three sections. In the first section we consider th…