English
Related papers

Related papers: Uniform Interpolation in provability logics

200 papers

Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.

Numerical Analysis · Mathematics 2025-10-20 H. Hakopian , M. Tonoyan

We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…

Logic · Mathematics 2019-12-30 Christian Espíndola

Most discussions of G\"odel's theorems fall into one of two types: either they emphasize perceived philosophical, cultural "meanings" of the theorems, and perhaps sketch some of the ideas of the proofs, usually relating G\"odel's proofs to…

Logic · Mathematics 2014-11-20 Dan Gusfield

We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and…

Logic in Computer Science · Computer Science 2022-10-20 Tiziano Dalmonte , Marianna Girlando

Hypersequent calculus G{\L}$\forall$ for first-order {\L}ukasiewicz logic was first introduced by Baaz and Metcalfe, along with a proof of its approximate completeness with respect to standard $[0,1]$-semantics. The completeness result was…

Logic · Mathematics 2024-12-09 Jin Wei

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…

Logic in Computer Science · Computer Science 2020-11-20 Aldo Figallo-Orellano , Juan Sebastian Slagter

In arXiv:1604.08705 the authors introduced the propositional modal logic $\textbf{TSC}$ (which stands for Turing Schmerl Calculus) which adequately describes the provable interrelations between different kinds of Turing progressions. The…

Logic · Mathematics 2018-04-30 Eduardo Hermo Reyes , Joost J. Joosten

We show that for integral operators of general form the norm bounds in Lorentz spaces imply certain norm bounds for the maximal function. As a consequence, the a.e. convergence for the integral operators on the Lorentz spaces follows from…

Classical Analysis and ODEs · Mathematics 2008-02-03 Alexander Kiselev

We introduce proof nets for PiL, an extension of first-order multiplicative additive linear logic with new operators allowing a shallow encoding of processes in the {\pi}-calculus as formulas. We provide correctness criterion,…

Logic in Computer Science · Computer Science 2026-05-15 Matteo Acclavio , Giulia Manara

The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…

Algebraic Topology · Mathematics 2024-05-31 Brice Le Grignou , Victor Roca i Lucio

We prove the following uniformity principle: if one of the Galois representations in the family attached to a genus two Siegel cusp form of weight $k>3$, "semistable" and with multiplicity one, is reducible (for an odd prime $p$),then all…

Number Theory · Mathematics 2007-05-23 Luis Dieulefait

In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…

Quantum Algebra · Mathematics 2023-09-27 Timo Kluck , Ana Ros Camacho

Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen…

Logic · Mathematics 2017-02-15 Jan Krajicek

Continuous logic extends the multi-valued Lukasiewicz logic by adding a halving operator on propositions. This extension is designed to give a more satisfactory model theory for continuous structures. The semantics of these logics can be…

Artificial Intelligence · Computer Science 2013-10-15 Rob Arthan , Paulo Oliva

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

Logic · Mathematics 2018-02-08 Filippo Calderoni , Luca Motto Ros

In this paper, we introduce a new sequence of operators based on the Gr\"unwald interpolation operators on Chebyshev nodes on the space $L^p[0,{\pi}]$. The operators we consider are integral variants of the Gr\"unwald interpolation…

Functional Analysis · Mathematics 2026-04-21 P. C. Vinaya

We prove analogues of the Craig interpolation theorem for the continuous model theory of metric structures.

Logic · Mathematics 2025-01-17 H. Jerome Keisler

We present a simple proof of some interpolation inequalities between H\"{o}lder and Lebesgue's spaces. As an example, to demonstrate the simplicity of their applications to nonlinear PDE, we give also a simple proof of an a-priory estimate…

Analysis of PDEs · Mathematics 2024-09-24 Sergey P. Degtyarev

We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…

Commutative Algebra · Mathematics 2024-01-17 Xue Jiang , Yihe Gong
‹ Prev 1 8 9 10 Next ›