English
Related papers

Related papers: Interpolation in extensions of first-order logic

200 papers

In this paper we give a characterisation of trivial extension algebras in terms of quivers with relations. This result is based on a explicit description of the ideal of relations of the trivial extension of an algebra, given by the first…

Rings and Algebras · Mathematics 2022-06-22 Elsa Fernandez , Sibylle Schroll , Hipolito Treffinger , Sonia Trepode , Yadira Valdivieso

There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as…

Logic · Mathematics 2021-06-17 Nikolai L. Poliakov , Denis I. Saveliev

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Logic · Mathematics 2022-07-18 Reijo Jaakkola , Antti Kuusisto

In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate…

Logic in Computer Science · Computer Science 2015-03-18 Charles Grellois , Paul-André Melliès

In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of the guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem…

Logic in Computer Science · Computer Science 2021-10-15 Reijo Jaakkola

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

Logic · Mathematics 2021-12-09 Rob Egrot

We present a first-order probabilistic epistemic logic, which allows combining operators of knowledge and probability within a group of possibly infinitely many agents. The proposed framework is the first order extension of the logic of…

Logic in Computer Science · Computer Science 2019-01-23 Siniša Tomović , Zoran Ognjanović , Dragan Doder

This paper is a historical tour of occurrences of the Craig interpolation theorem and the Beth definability theorem in philosophy since the 1950s. We identify the notion of dependence as one major red thread behind these, and include some…

Logic in Computer Science · Computer Science 2026-02-10 Johan van Benthem

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

In this paper some proof theory for propositional Lax Logic is developed. A cut free terminating sequent calculus is introduced for the logic, and based on that calculus it is shown that the logic has uniform interpolation. Furthermore, a…

Logic · Mathematics 2022-09-20 Rosalie Iemhoff

Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…

Logic · Mathematics 2025-12-03 Derek Aoki

We present a first-order logic equipped with an "asymmetric" directed notion of equality, which can be thought of as rewrites between terms, allowing for types to be interpreted as preorders. The logic is equipped with a precise syntactic…

Logic in Computer Science · Computer Science 2026-05-12 Andrea Laretto , Fosco Loregian , Niccolò Veltri

The two-way modal mu-calculus is the extension of the (standard) one-way mu-calculus with converse (backward-looking) modalities. For this logic we introduce two new sequent-style proof calculi: a non-wellfounded system admitting infinite…

Logic in Computer Science · Computer Science 2025-08-12 Johannes Kloibhofer , Yde Venema

We study the Lyndon interpolation property (LIP) and the uniform Lyndon interpolation property (ULIP) for extensions of $\mathbf{S4}$ and intermediate propositional logics. We prove that among the 18 consistent normal modal logics of finite…

Logic · Mathematics 2025-05-20 Taishi Kurahashi

We show that there are exactly five quasivarieties of Sugihara algebras with the amalgamation property, and that all of these have the relative congruence extension property. As a consequence, we obtain that the amalgamation property and…

Logic · Mathematics 2025-12-05 Wesley Fussner , Krzysztof Krawczyk

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…

Logic · Mathematics 2012-08-28 Tapani Hyttinen , Kaisa Kangas , Jouko Väänänen

We prove the uniform Lyndon interpolation property (ULIP) of some extensions of the pure logic of necessitation $\mathbf{N}$. For any $m, n \in \mathbb{N}$, $\mathbf{N}^+\mathbf{A}_{m,n}$ is the logic obtained from $\mathbf{N}$ by adding a…

Logic · Mathematics 2025-08-19 Yuta Sato

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…

Logic · Mathematics 2024-10-30 Wesley Fussner , Simon Santschi

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

None of the first-order modal logics between $\mathsf{K}$ and $\mathsf{S5}$ under the constant domain semantics enjoys Craig interpolation or projective Beth definability, even in the language restricted to a single individual variable. It…

Logic in Computer Science · Computer Science 2025-10-15 Agi Kurucz , Frank Wolter , Michael Zakharyaschev
‹ Prev 1 3 4 5 6 7 10 Next ›