Related papers: Fischer-Servi logic does not have interpolation

The Mickelsson-Faddeev (MF) algebra can naturally be embedded in a non-Lie algebra, which suggests that it has no Fock representations. The difficulties are due to the inhomogeneous term in the connection's transformation law. Omitting this…

In this chapter we give a basic overview of known results regarding Craig interpolation for first-order logic as well as for fragments of first-order logic. Our aim is to provide an entry point into the literature on interpolation theorems…

We complete Maksimova's classification of the normal extensions of S4 with interpolation. In particular, we prove Craig interpolation for the six extensions of S4 for which Craig interpolation was still open. The proof strategy builds upon…

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…

We provide an affine cellular structure on the extended affine Hecke algebra and affine $q$-Schur algebra of type $A_{n-1}$ that is defined over $\mathbb{Z}\left[q^{\pm1}\right]$, that is, without an adjoined $q^{\frac{1}{2}}$. This is with…

Craig's interpolation theorem (Craig 1957) is an important theorem known for propositional logic and first-order logic. It says that if a logical formula $\beta$ logically follows from a formula $\alpha$, then there is a formula $\gamma$,…

We obtain Krickeberg mixing for a class of Z extensions of Gibbs Markov semiflows with roof function and displacement function not in L2, where previous methods have not been employed. This is done via a 'smooth tail' estimate for the…

We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…

Using Vakarelov's theory of lattice logics with negation, we introduce the (co)quasiintuitionistic logic, and prove its soundness and completeness with respect to the class of (co)quasiintuitionistic algebras. Combining these algebras…

Earlier, the authors introduced the logic IntGC, which is an extension of intuitionistic propositional logic by two rules of inference mimicking the performance of Galois connections (Logic J. of the IGPL, 18:837-858, 2010). In this paper,…

We study the Hopf algebra H of Fliess operators coming from Control Theory in the one-dimensional case. We prove that it admits a graded, finte-dimensional, connected gradation. Dually, the vector space IR is both a pre-Lie algebra for the…

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means of finite Hilbert calculi. On the side of negative…

Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent…

Recently, E.Feigin introduced a very interesting contraction $\mathfrak q$ of a semisimple Lie algebra $\mathfrak g$ (see arXiv:1007.0646 and arXiv:1101.1898). We prove that these non-reductive Lie algebras retain good invariant-theoretic…

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely…

In this paper we consider, from a computational point of view, the problem of classifying logics within the Leibniz and Frege hierarchies typical of abstract algebraic logic. The main result states that, for logics presented syntactically,…

We show that Propositional Dynamic Logic (PDL) has the Craig Interpolation Property. This question has been open for many years. Three proof attempts were published, but later criticized in the literature or retracted. Our proof is based on…

Semiconic idempotent logic sCI is a common generalization of intuitionistic logic, semilinear idempotent logic sLI, and in particular relevance logic with mingle. We establish the projective Beth definability property and the deductive…

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…