English
Related papers

Related papers: Unification types and union splittings in intermed…

200 papers

Metric Temporal Logic, $\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval…

Logic in Computer Science · Computer Science 2013-11-28 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh K. Pandya

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

Programming Languages · Computer Science 2024-08-22 Michał J. Gajda

Recently, authors have proposed under-approximate logics for reasoning about programs. So far, all such logics have been confined to reasoning about individual program behaviours. Yet there exist many over-approximate relational logics for…

Logic in Computer Science · Computer Science 2020-03-12 Toby Murray

Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with $\mathsf{K}$. This paper shows that the property of being a union-splitting in…

Logic · Mathematics 2025-10-17 Tenyo Takahashi

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 introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

This report aims at giving a general overview on the classification of the maximal subgroups of compact Lie groups (not necessarily connected). In the first part, it is shown that these fall naturally into three types: (1) those of trivial…

Rings and Algebras · Mathematics 2014-02-11 Fernando Antoneli , Michael Forger , Paola Gaviria

By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…

Logic · Mathematics 2024-08-23 Seyed-Mohammad Bagheri

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Logic · Mathematics 2024-12-19 Carlos Caleiro , Pedro Filipe , Sérgio Marcelino

Despite significant efforts towards extending the AGM paradigm of belief change beyond finitary logics, the computational aspects of AGM have remained almost untouched. We investigate the computability of AGM contraction on non-finitary…

Logic in Computer Science · Computer Science 2025-08-06 Dominik Klumpp , Jandson S. Ribeiro

In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…

Logic in Computer Science · Computer Science 2013-12-11 Marta Cialdea Mayer

Unitally nondistributive quantales are unital quantales such that the unit is approximable by the totally below relation and does not meet-distribute over arbitrary joins. It is shown that the underlying nondistributive complete lattice…

General Topology · Mathematics 2024-12-02 Javier Gutiérrez García , Ulrich Höhle

It is well-known that intuitionistic logics can be formalized by means of Brouwerian semilattices, i.e. relatively pseudocomplemented semilattices. Then the logical connective implication is considered to be the relative pseudocomplement…

Logic · Mathematics 2023-01-06 Ivan Chajda , Helmut Länger

Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…

Logic in Computer Science · Computer Science 2022-07-11 Luca Ciccone , Luca Padovani

It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X+ over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals…

Logic · Mathematics 2013-11-12 Guram Bezhanisevili , David Gabelaia , Joel Lucero-Bryan

We investigate involutive commutative residuated lattices without unit, which are commutative residuated lattice-ordered semigroups enriched with a unary involutive negation operator. The logic of this structure is discussed and the…

Logic · Mathematics 2023-03-13 Yiheng Wang , Hao Zhan , Yu Peng , Zhe Lin

We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…

Logic · Mathematics 2021-09-07 Nicholas Pischke

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of…

Logic · Mathematics 2018-12-19 Rosalie Iemhoff , Fan Yang

Non-iterative normal modal logics are defined by axioms of modal degree 1. In this paper we use calculations with normal forms to determine the set of all possible non-iterative normal modal logics, unimodal propositional extensions of K.…

Logic · Mathematics 2021-03-26 Adrian Soncodi