Related papers: The Boolean Compactness Theorem for $\mathrm{L}_{\…
We prove a Tb Theorem that characterizes all Calderon-Zygmund operators that extend compactly on L^p(R^n), 1<p<\infty . The result, whose proof does not require the property of accretivity, can be used to prove compactness of the Double…
In this note we give a proof of the Sobolev and Morrey embedding theorems based on the representation of functions in terms of the fundamental solution of suitable partial differential operators. We also prove the compactness of the Sobolev…
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…
We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…
Functions, uniformly bounded in $BV$ norm in some bounded open set $U$ in $R^n$, are compact in $L_1(U)$. This result is known when $U$ has Lipschitz boundary [EG Th. 4 p. 176], [G 1.19 Th. p. 17], [Z 5.34 Cor. p. 227]; the proof for…
In the style of Lindstr\"om's theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract logic satisfying a certain form of…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
We ask, when is a property of a model a logical property? According to the so-called Tarski-Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics…
Every absolutely summing linear operator is weakly compact. However, for strongly summing multilinear operators and polynomials - one of the most natural extensions of the linear case to the non linear framework - weak compactness does not…
We introduce and develop a topological semantics of conservativity logics and interpretability logics. We prove the topological compactness theorem of consistent normal extensions of the conservativity logic $\mathbf{CL}$ by extending…
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…
This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…
Uhlenbeck's compactness theorem can be used to analyze sequences of connections with anti-self dual curvature on principal SU(2) bundles over oriented 4-dimensional manifolds. The theorems in this paper give an extension of Uhlenbeck's…
LECTURE GIVEN AT TH2002. Given a set of Boolean variables, and some constraints between them, is it possible to find a configuration of the variables which satisfies all constraints? This problem, which is at the heart of combinatorial…
A left order on a magma (e.g., semigroup) is a total order of its elements that is left invariant under the magma operation. A natural topology can be introduced on the set of all left orders of an arbitrary magma. We prove that this…
This paper has two parts. First, we complete the proof of the Kolmogorov extension theorem for unbounded random variables using compactness theorem of integral logic which was proved for bounded case in [8]. Second, we give a proof of the…
We study three kinds of compactness in some variants of G\"odel logic: compactness, entailment compactness, and approximate entailment compactness. For countable first-order underlying language we use the Henkin construction to prove the…
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…