Related papers: Uniform Lyndon interpolation property in propositi…
Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The…
It is known that every function with a finite support over a given field can be interpolated by means of the Lagrangian polynomial. The question is if a similar interpolation is possible if one considers a unitary ring or a Boolean algebra…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The underlying synthesis problem, however, is challenging and…
Notions of higher Kazhdan property can be defined in terms of vanishing of unitary group cohomology in higher degrees. Garland's theorem for simple groups over non-archimedean fields provides the first examples of a higher Kazhdan property.…
We introduce the antipodal pairs property for probability measures on finite Boolean algebras and prove that conditional versions imply strong forms of log-concavity. We give several applications of this fact, including improvements of some…
Let $F$ be a totally real field, $\mathfrak{p}$ an unramified place of $F$ dividing $p$ and $\overline{r}: \mathrm{Gal}(\overline{F}/F)\rightarrow\mathrm{GL}_2(\overline{\mathbb{F}}_p)$ a continuous irreducible modular representation. The…
Let p be a prime number which is split in an imaginary quadratic field k. Let \mathfrak{p} be a place of k above p. Let k_\infty be the unique Z_p-extension of k which unramified outside of \mathfrak{p}, and let K_\intfy be a finite…
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…
We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
We exhaustively classify varieties of BL-algebras with the amalgamation property, showing that there are only countably many of them and solving an open problem of Montagna. As a consequence of this classification, we obtain a complete…
We study the problem of the existence and regularity of a probability density in an abstract framework based on a "balancing" with approximating absolutely continuous laws. Typically, the absolutely continuous property for the approximating…
We study complex interpolation of variable Triebel-Lizorkin spaces, especially we present the complex interpolation of $F_{p(\cdot),q}^{\alpha }$ and $F_{p(\cdot ),p(\cdot )}^{\alpha (\cdot )}$ spaces. Also, some limiting cases are given.
In sharp contrast to classical proof complexity we are currently short of lower bound techniques for QBF proof systems. In this paper we establish the feasible interpolation technique for all resolution-based QBF systems, whether modelling…
We consider \emph{bilinearly indexed random processes} (blirp) and study their interpolating comparative mechanisms. Generic introduction of the \emph{fully lifted} (fl) blirp interpolation in [105] was followed by a corresponding…
We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path…
In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In logics with the projective Beth definability property (PBDP), the existence of an…
We prove that the half plane version of the uniform infinite planar triangulation (UIPT) is recurrent. The key ingredients of the proof are a construction of a new full plane extension of the half plane UIPT, based on a natural…
We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…