Related papers: Three Variables Suffice for Real-Time Specificatio…
In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic…
Four sets of necessary and sufficient conditions are obtained for the first-order rigidity of a periodic bond-node framework \C in R^d which is of crystallographic type. In particular, an extremal rank characterisation is obtained which…
Many-valued logics in general, and fuzzy logics in particular, usually focus on a notion of consequence based on preservation of full truth, typical represented by the value 1 in the semantics given the real unit interval [0,1]. In a recent…
Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a…
We study covariant models for vacuum spherical gravity within a canonical setting. Starting from a general ansatz, we derive the most general family of Hamiltonian constraints that are quadratic in first-order and linear in second-order…
Some superstring theories have more than one effective low-energy limit, corresponding to classical spacetimes with different dimensionalities. We argue that all but the 3+1-dimensional one might correspond to ``dead worlds'', devoid of…
The problem of time in canonical quantum gravity is related to the fact that the canonical description is based on the prior choice of a spacelike foliation, hence making a reference to a spacetime metric. However, the metric is expected to…
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
Simulations of specifications are introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations. A specification implements another specification…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
The system is described by three mass-shell constraints. After a nonlinear transformation of the momenta, the analytic form taken by admissible interactions (allowing compatibility) is characterized in terms of the new variables. These…
The canonical description is based on the prior choice of a spacelike foliation, hence making a reference to a spacetime metric. However, the metric is expected to be a dynamical, fluctuating quantity in quantum gravity. After presenting…
Understanding and quantifying causal relationships between variables is essential for reasoning about the physical world. In this work, we develop a resource-theoretic framework to do so. Here, we focus on the simplest nontrivial setting --…
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
The regular models of a normal logic program are a particular type of partial (i.e. 3-valued) models which correspond to stable partial models with minimal undefinedness. In this paper, we explore graphical conditions on the dependency…
For formulas F of propositional calculus I introduce a "metavariable" MF and show how it can be used to define an algorithm for testing satisfiability. MF is a formula which is true/false under all possible truth assignments iff F is…
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…