English
Related papers

Related papers: A non-uniform view of Craig interpolation in modal…

200 papers

It is well known that one can find a rational normal curve in $\mathbb P^n$ through $n+3$ general points. We prove a generalization of this to higher dimensional varieties, showing that smooth varieties of minimal degree can be interpolated…

Algebraic Geometry · Mathematics 2017-01-30 Aaron Landesman

In this paper, we consider the problem of formal iteration. We construct an area preserving mapping which does not have any square root. This leads to a counterexample to Moser's existence theorem for an interpolation problem. We give…

Dynamical Systems · Mathematics 2020-08-20 O. V. Kaptsov

We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameter-free admissibility and unification to the setting with…

Logic in Computer Science · Computer Science 2015-05-20 Emil Jeřábek

In this paper, we give an extension of the J\'{o}nsson-Tarski representation theorem for both normal and non-normal modal algebras so that it preserves countably many infinitary meets and joins. To extend the J\'{o}nsson-Tarski…

Logic · Mathematics 2023-05-24 Yoshihito Tanaka

Existing techniques for Craig interpolation for the quantifier-free fragment of the theory of arrays are inefficient for computing sequence and tree interpolants: the solver needs to run for every partitioning $(A, B)$ of the interpolation…

Logic in Computer Science · Computer Science 2018-08-06 Jochen Hoenicke , Tanja Schindler

Inspired by Hintikka's treatment of question embedding verbs in [8] and the variations of noncontingency operator, we propose a logic with strong noncontingency operator $\blacktriangle$ as the only primitive modality. A proposition is…

Logic in Computer Science · Computer Science 2019-09-18 Jie Fan

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

Motivated by applications in data science, we study partial differential equations on graphs. By a classical fixed-point argument, we show existence and uniqueness of solutions to a class of nonlocal continuity equations on graphs. We…

Analysis of PDEs · Mathematics 2023-06-06 A. Esposito , F. S. Patacchini , A. Schlichting

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…

Logic · Mathematics 2026-03-19 Zalán Gyenis , Zalán Molnár , Övge Öztürk

We present a justification logic corresponding to the modal logic of transitive closure $\mathsf{K}^+$ and establish a normal realization theorem relating these two systems. The result is obtained by means of a sequent calculus allowing…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

We treat interpolation for various logics.

Logic · Mathematics 2009-07-22 Dov Gabbay , Karl Schlechta

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

Quantum Physics · Physics 2007-05-23 J. Maurice Rojas

A variety V is said to be coherent if any finitely generated subalgebra of a finitely presented member of V is finitely presented. It is shown here that V is coherent if and only if it satisfies a restricted form of uniform deductive…

Logic · Mathematics 2018-03-28 Tomasz Kowalski , George Metcalfe

Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of…

Logic · Mathematics 2025-02-13 Ivano Ciardelli , Martin Otto

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

Interpolation of jointly infeasible predicates plays important roles in various program verification techniques such as invariant synthesis and CEGAR. Intrigued by the recent result by Dai et al.\ that combines real algebraic geometry and…

Logic in Computer Science · Computer Science 2017-09-04 Takamasa Okudono , Yuki Nishida , Kensuke Kojima , Kohei Suenaga , Kengo Kido , Ichiro Hasuo

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of…

Logic in Computer Science · Computer Science 2019-11-19 Fabrizio M. Maggi , Marco Montali , Rafael Peñaloza

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak