English
Related papers

Related papers: Unification in pretabular extensions of S4

200 papers

Following a characterization [10] of locally tabular logics with finitary (or unitary) unification by their Kripke models we determine the unification types of some intermediate logics (extensions of {\sf INT}). There are exactly four…

Logic · Mathematics 2022-05-24 W. Dzik , S. Kost , P. Wojtylak

The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. When a unifiable formula has minimal complete…

Logic in Computer Science · Computer Science 2020-04-20 Philippe Balbiani , Çiğdem Gencer , Maryam Rostamigiv , Tinko Tinchev

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

A logic $L$ is called tabular if it is the logic of some finite frame and $L$ is pretabular if it is not tabular while all of its proper consistent extensions are tabular. In this work, we study pretabular tense logics in the lattice…

Logic · Mathematics 2025-09-30 Qian Chen

The unification problem in a normal modal logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. We shall say that a set of unifiers of a unifiable…

Logic in Computer Science · Computer Science 2019-02-12 Philippe Balbiani , Çiğdem Gencer

It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…

Logic · Mathematics 2007-06-13 Dmitry Sustretov

We show that the unification problem `is there a substitution instance of a given formula that is provable in a given logic?' is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the…

Logic in Computer Science · Computer Science 2007-05-23 Frank Wolter , Michael Zakharyaschev

We describe a family of decidable propositional dynamic logics, where atomic modalities satisfy some extra conditions (for example, given by axioms of the logics K5, S5, or K45 for different atomic modalities). It follows from recent…

Logic · Mathematics 2023-05-30 Daniel Rogozin , Ilya Shapirovsky

We investigate pre-local tabularity in normal extensions of the logic $\mathrm{S4}\times \mathrm{S4}$. We show that there are exactly four pre-locally tabular logics in normal extensions of products of finite height, and that every…

Logic · Mathematics 2026-01-01 Ilya B. Shapirovsky , Vladislav V. Sliusarev

We show that the polymodal provability logic GLP, in a language with at least two modalities and one variable, has nullary unification type. More specifically, we show that the formula [1]p does not have maximal unifiers, and exhibit an…

Logic · Mathematics 2024-04-09 Lev D. Beklemishev

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

Logic in Computer Science · Computer Science 2026-05-19 Hirohiko Kushida

We explicitly construct and list all unitary superconformal multiplets, along with their index contributions, in five and six dimensions. From this data, we uncover various unifying themes in the representation theory of five- and…

High Energy Physics - Theory · Physics 2016-12-21 Matthew Buican , Joseph Hayling , Constantinos Papageorgakis

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

Logic in Computer Science · Computer Science 2024-04-30 Hugo Férée , Iris van der Giessen , Sam van Gool , Ian Shillito

In previous articles, we showed that the category of profinite $L$-algebras (where $L$ is a normal modal logic with the finite model property) is monadic over $\textbf{Set}$. Then, we developed sequent calculi for extensions of the language…

Logic · Mathematics 2025-09-17 Matteo De Berardinis

We present the logic iJT4, which is an explicit version of intuitionistic S4 and establish soundness and completeness with respect to modular models.

Logic · Mathematics 2016-04-26 Michel Marti , Thomas Studer

In this paper we continue the study of representation theory of formal distribution Lie superalgebras initiated in q-alg/9706030. We study finite Verma-type conformal modules over the N=2, N=3 and the two N=4 superconformal algebras and…

Quantum Algebra · Mathematics 2009-10-31 Shun-Jen Cheng , Ngau Lam

Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…

Logic · Mathematics 2014-01-07 Tarek Sayed Ahmed

We present the first example of a grand unified theory (GUT) with a modular symmetry interpreted as a family symmetry. The theory is based on supersymmetric $SU(5)$ in 6d, where the two extra dimensions are compactified on a…

High Energy Physics - Phenomenology · Physics 2020-02-04 Francisco J. de Anda , Stephen F. King , Elena Perdomo

We show that in the extended modular group PGL(2,Z) there are exactly seven finite subgroups up to conjugacy; three subgroups of size 2, one subgroup each of size 3, 4, and 6, and the trivial subgroup of size 1.

Group Theory · Mathematics 2022-02-25 Gregory Dresden , Prakriti Panthi , Anukriti Shrestha , Jiahao Zhang

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli
‹ Prev 1 2 3 10 Next ›