English
Related papers

Related papers: Uniform Lyndon interpolation property in propositi…

200 papers

Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…

Functional Analysis · Mathematics 2007-05-23 Loukas Grafakos , Terence Tao

Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to reason about objects, classes of objects, and relations.…

Logic in Computer Science · Computer Science 2012-05-14 Geoffrey Gordon , Sue Ann Hong , Miroslav Dudik

Interpolation by various types of splines is the standard procedure in many applications. In this paper we shall discuss harmonic spline "interpolation" (on the lines of a grid) as an alternative to polynomial spline interpolation (at…

Numerical Analysis · Mathematics 2011-01-17 Yuliya Babenko , Tatyana Leskevich

The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig…

Logic in Computer Science · Computer Science 2024-04-04 Frank Wolter , Michael Zakharyaschev

We formalise and mechanise a construtive, proof theoretic proof of Craig's Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal…

Logic in Computer Science · Computer Science 2007-05-23 Tom Ridge

We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…

Computational Complexity · Computer Science 2012-03-19 Hugues Randriambololona

We investigate properties of the formula $p \to \Box p$ in the basic modal logic K. We show that K satisfies an infinitary weaker variant of the rule of margins $\phi \to \Box\phi / \phi, \neg\phi$, and as a consequence, we obtain various…

Logic in Computer Science · Computer Science 2015-12-22 Emil Jeřábek

Traditionally, research on Craig interpolation is concerned with (a) establishing the Craig interpolation property (CIP) of a logic saying that every valid implication in the logic has a Craig interpolant and (b) designing algorithms that…

Logic in Computer Science · Computer Science 2025-12-04 Agi Kurucz , Frank Wolter , Michael Zakharyaschev

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We prove that all these logics are expressively complete, and we introduce sound and complete systems of…

Logic · Mathematics 2022-02-16 Fan Yang

We investigate {\bf explicit} universal estimate of finite Morse index solutions to polyharmonic equations. \,Differently to previous works \cite{BL2, DDF, fa, H1}, propose here a direct proof using a new interpolation inequality and a…

Analysis of PDEs · Mathematics 2024-01-23 Abdellaziz Harrabi

We bring an abstract model theory perspective to interpolation. We ask, what is the role of interpolation in the study of extensions of first order logic, such as infinitary logics, generalized quantifiers and higher order logics? The…

Logic · Mathematics 2025-07-28 Jouko Väänänen

In this paper, we study geometric properties of $\ell^{p}$-spaces associated with the unitary dual of a compact group. More precisely, we prove uniform smoothness, uniform convexity, Clarkson type inequalities, Kadec-Klee property, as well…

Functional Analysis · Mathematics 2025-12-01 Meiram Akhymbek , Michael Ruzhansky

In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.

Logic in Computer Science · Computer Science 2025-03-25 Philippe Balbiani , Cigdem Gencer

We prove an interpolation result for homogeneous polynomials over the integers, or more generally for PIDs with finite residue fields. Previous proofs of this result use the well-known but nontrivial fact that class groups of rings of…

Commutative Algebra · Mathematics 2020-09-24 John Berman , Daniel Erman

We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…

Logic · Mathematics 2011-10-12 Xavier Caicedo , Ricardo Oscar Rodriguez

It is well known that the propositional modal logic $\mathbf{GL}$ of provability satisfies the de Jongh-Sambin fixed-point property. On the other hand, Montagna showed that the predicate modal system $\mathbf{QGL}$, which is the natural…

Logic · Mathematics 2019-11-25 Sohei Iwata , Taishi Kurahashi

In this article, a model-theoretic approach is proposed to prove that the first-order G\"odel logic, $\mathbf{G}$, as well as its extension $\mathbf{G}^\Delta$ associated with first-order relational languages enjoy the Craig interpolation…

Polynomial and spline quasi-interpolants (QIs) are practical and effective approximation operators. Among their remarkable properties, let us cite for example: good shape properties, easy computation and evaluation (no linear system to…

Numerical Analysis · Mathematics 2025-10-20 Paul Sablonniere

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also…

Computation and Language · Computer Science 2020-09-23 Richard Moot , Symon Stevens-Guille