Related papers: Compactness in Team Semantics
We study the data complexity of model-checking for logics with team semantics. We focus on dependence, inclusion, and independence logic formulas under both strict and lax team semantics. Our results delineate a clear…
We prove the first rigidity and classification theorems for crossed product von Neumann algebras given by actions of non-discrete, locally compact groups. We prove that for arbitrary free probability measure preserving actions of connected…
Affine continuous logic is extended to affine integration logic. Affine compactness theorem is proved by both the ultramean construction and Henkin's method. Also, a proof system and a completeness theorem are given. An appropriate variant…
We provide a mathematically rigorous definition of local approximation and demonstrate its applicability to some interesting classes of structures. In particular, we prove that any compact simple Lie group is locally approximated by finite…
We extend the treatment of functional dependence, the basic concept of dependence logic, to include the possibility of dependence with a limited number of exceptions. We call this approximate dependence. The main result of the paper is a…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…
We present a natural standard translation of inquisitive modal logic InqML into first-order logic over the natural two-sorted relational representations of the intended models, which captures the built-in higher-order features of InqML.…
We find many conditions equivalent to the model-theoretical property $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in [L1]. Our conditions involve uniformity of ultrafilters, compactness properties of products of topological…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural…
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…
We consider the one-variable fragment of first-order logic extended with Presburger constraints. The logic is designed in such a way that it subsumes the previously-known fragments extended with counting, modulo counting or cardinality…
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…
The paper studies the containment companion of a logic $\vdash$. This consists of the consequence relation $\vdash^{r}$ which satisfies all the inferences of $\vdash$, where the variables of the conclusion are \emph{contained} into those of…
Simple argument in favour of unitarity, to all orders, of space-like noncommutative theory is given.
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…
Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a…
Many economic theory models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness…
In this paper, we use two-variable Laurent polynomials attached to matrices to encode properties of compositions of sequences. The Lagrange identity in the ring of Laurent polynomials is then used to give a short and transparent proof of a…