English
Related papers

Related papers: Uniform Interpolation in Coalgebraic Modal Logic

200 papers

We define a notion of general uniform interpolant, generalizing the notions of cover and of uniform interpolant and identify situations in which symbol elimination can be used for computing general uniform interpolants. We investigate the…

Logic in Computer Science · Computer Science 2025-06-03 Viorica Sofronie-Stokkermans

The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that…

Logic · Mathematics 2019-12-17 Norihiro Yamada

There are exactly two maximal schematic extensions of the relevant logic R with the variable sharing property. We establish that one of them has a strong form of interpolation for deducibility, thereby giving an example of a well-known…

Logic · Mathematics 2025-12-01 Wesley Fussner , Andrew Tedder

Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…

Logic · Mathematics 2010-10-05 K. Dosen , Z. Petric

Tremendous research effort has been dedicated over the years to thoroughly investigate non-monotonic reasoning. With the abundance of non-monotonic logical formalisms, a unified theory that enables comparing the different approaches is much…

Logic in Computer Science · Computer Science 2019-07-23 Nourhan Ehab , Haythem O. Ismail

We study the fixed point property and the Craig interpolation property for sublogics of the interpretability logic $\mathbf{IL}$. We provide a complete description of these sublogics concerning the uniqueness of fixed points, the fixed…

Logic · Mathematics 2020-08-07 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…

Logic in Computer Science · Computer Science 2011-05-05 Edith Hemaspaandra , Henning Schnoor

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example,…

Logic in Computer Science · Computer Science 2013-04-01 Carlos Areces , Guillaume Hoffmann , Ezequiel Orbe

There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…

Logic in Computer Science · Computer Science 2023-06-16 Oliver Görlitz , Daniel Hausmann , Merlin Humml , Dirk Pattinson , Simon Prucker , Lutz Schröder

Theory interpolation has found several successful applications in model checking. We present a novel method for computing interpolants for ground formulas in the theory of equality. The method produces interpolants from colored congruence…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Fuchs , Amit Goel , Jim Grundy , Sava Krstić , Cesare Tinelli

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

Logic · Mathematics 2023-10-03 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

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…

We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides with the order in…

Logic in Computer Science · Computer Science 2022-06-24 Bartosz Bednarczyk , Reijo Jaakkola

We study interpolation properties for Shavrukov's bimodal logic $\mathbf{GR}$ of usual and Rosser provability predicates. For this purpose, we introduce a new sublogic $\mathbf{GR}^\circ$ of $\mathbf{GR}$ and its relational semantics. Based…

Logic · Mathematics 2023-11-20 Haruka Kogure , Taishi Kurahashi

High-dimensional Lagrange interpolation plays a pivotal role in finite element methods, where ensuring the unisolvence and symmetry of its interpolation space and nodes set is crucial. In this paper, we leverage group action and group…

Numerical Analysis · Mathematics 2024-05-24 Yulin Xie , Yifa Tang

We have recently presented a general method of proving the fundamental logical properties of Craig and Lyndon Interpolation (IPs) by induction on derivations in a wide class of internal sequent calculi, including sequents, hypersequents,…

Logic in Computer Science · Computer Science 2023-08-01 Roman Kuznets

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

Logic · Mathematics 2020-02-20 Eugenio Orlandelli
‹ Prev 1 4 5 6 7 8 10 Next ›