Related papers: The Blackwell relation defines no lattice
We conjecture a new correlation-like inequality for percolation probabilities and support our conjecture with numerical evidence and a few special cases which we prove. This inequality, if true, implies that there is no percolation at…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis (1973) earlier considered such a notion of relative likelihood in the…
Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…
A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz…
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
A lattice Maxwell system is developed with gauge-symmetry, symplectic structure and discrete space-time symmetry. Noether's theorem for Lie group symmetries is generalized to discrete symmetries for the lattice Maxwell system. As a result,…
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…
A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph has a Ramsey lift (expansion). This solves one of the old problems in the…
For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
Let $\Lambda$ be a lattice of rank $n$. A Lie algebra on the lattice $\Lambda$ is a Lie algebra ${\cal L}=\oplus_{\lambda\in\Lambda}\,{\cal L}_{\lambda}$ such that $\dim\,{\cal L}_\lambda=1$ for all $\lambda$. In this article, we classify…
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
The development of relational electromagnetism after Gauss appears to stop around 1870. Maxwell recognised relational electromagnetism as mathematically equivalent to his own formulae and called for an explanation of why so different…
The paper develops a general theory of orderability of quandles with a focus on link quandles of tame links and gives some general constructions of orderable quandles. We prove that knot quandles of many fibered prime knots are…
The relations between Bell's inequality and quantum probability trees are explained against the background offered by the concept of a quantum probability tree built in others works. It is shown that f we use a concept of probability tree…
Bell's theorem is a fundamental result in quantum mechanics: it discriminates between quantum mechanics and all theories where probabilities in measurement results arise from the ignorance of pre-existing local properties. We give an…
We take a resource-theoretic approach to the problem of quantifying nonclassicality in Bell scenarios. The resources are conceptualized as probabilistic processes from the setting variables to the outcome variables having a particular…
Let $\mathcal{C}$ be a finitely bicomplete category and $\mathcal{W}$ a subcategory. We prove that the existence of a model structure on $\mathcal{C}$ with $\mathcal{W}$ as subcategory of weak equivalence is not first order expressible.…