Related papers: Compactness in Team Semantics
We like to develop model theory for $T$, a complete theory in $\mathbb{L}_{\theta,\theta}(\tau)$ when $\theta$ is a compact cardinal. By [Sh:300a] we have bare bones stability and it seemed we can go no further. Dealing with ultrapowers…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
We prove a T(1) Theorem to completely characterize compactness of Calderon-Zygmund operators. The result provides sufficient and necessary conditions for the compactness of singular integral operators acting on L^p(R).
We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…
We define a variant of team semantics called multiteam semantics based on multisets and study the properties of various logics in this framework. In particular, we define natural probabilistic versions of inclusion and independence atoms…
We prove a wavelet $T(1)$ theorem for compactness of multilinear Calder\'{o}n-Zygmund (CZ) operators. Our approach characterizes compactness in terms of testing conditions and yields a representation theorem for compact CZ forms in terms of…
Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…
In order to have a better description of homogenization for parabolic partial differential equations with periodic coefficients, we define the notion of parametric two-scale convergence. A compactness theorem is proved to justify this…
First Order Team Semantics is a generalization of Tarskian Semantics in which formulas are satisfied with respect to sets of assignments. In Team Semantics, it is possible to extend First Order Logic via new types of atoms that describe…
We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…
We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…
We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…
We analyse the two definitions of generalized quantifiers for logics of dependence and independence that have been proposed by F. Engstr\"om, comparing them with a more general, higher-order definition of team quantifier. We show that…
Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other…
In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analogue of one of the most studied problems in parameterized complexity, the notion of weighted…
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovasz to determine the Shannon capacity of the pentagon; to show a direct sum theorem for…
Category theory can be used to state formulas in First-Order Logic without using set membership. Several notable results in logic such as proof of the continuum hypothesis can be elegantly rewritten in category theory. We propose in this…
In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…