Related papers: Strict potentialism in modal mirrors
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem's combinatorial explosion, beyond the number of…
Quantum theory's irreducible empirical core is a probability calculus. While it presupposes the events to which (and on the basis of which) it serves to assign probabilities, and therefore cannot account for their occurrence, it has to be…
We analyze the informal notion of truth and conclude that it can be formalized in essentially two distinct ways: constructively, in terms of provability, or classically, as a hierarchy of concepts which satisfy Tarski's biconditional in…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ…
Peer prediction mechanisms incentivize agents to truthfully report their signals even in the absence of verification by comparing agents' reports with those of their peers. In the detail-free multi-task setting, agents respond to multiple…
We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…
We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…
The concept of informal mathematical proof considered in intuitionism is apparently vulnerable to a version of the liar paradox. However, a careful reevaluation of this concept reveals a subtle error whose correction blocks the…
By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly…
For the classical mind, quantum mechanics is boggling enough; nevertheless more bizarre behavior could be imagined, thereby concentrating on propositional structures (empirical logics) that transcend the quantum domain. One can also…
A long series of previous papers have been devoted to the (one-dimensional) moment problem with nonnegative rational measure. The rationality assumption is a complexity constraint motivated by applications where a parameterization of the…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…
Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…
We study a budget aggregation setting where voters express their preferred allocation of a fixed budget over a set of alternatives, and a mechanism aggregates these preferences into a single output allocation. Motivated by scenarios in…
We describe a family of decidable propositional dynamic logics, where atomic modalities satisfy some extra conditions (for example, given by axioms of the logics K5, S5, or K45 for different atomic modalities). It follows from recent…
Let $R$ be a commutative ring and $S \subseteq R$ be a multiplicative subset. We introduce and study the concept of $S$-purity based on the notion of $S$-strongly flat modules. The class of $S$-pure injective modules will be studied. We…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
In a series of papers, a many-minds interpretation of quantum theory has been developed. The aim in these papers is to present an explicit mathematical formalism which constitutes a complete theory compatible with relativistic quantum field…