English
Related papers

Related papers: Flat modal fixpoint logics with the converse modal…

200 papers

We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an…

Logic in Computer Science · Computer Science 2024-05-02 Ezra Schoen , Clemens Kupke , Jurriaan Rot , Ruben Turkenburg

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational…

Logic in Computer Science · Computer Science 2018-01-22 Ranald Clouston

We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and…

Logic · Mathematics 2022-10-19 Tiziano Dalmonte

An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm…

Logic · Mathematics 2019-10-04 Sándor Jenei

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

We prove the algorithmic canonicity of two classes of $\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\mu$-inequalities based on a…

Logic · Mathematics 2016-03-22 Willem Conradie , Andrew Craig , Alessandra Palmigiano , Zhiguang Zhao

Solovay's arithmetical completeness theorem states that the modal logic of provability coincides with the modal logic $\mathbf{GL}$. Hamkins and L\"owe studied the modal logical aspects of set theoretic multiverse and proved that the modal…

Logic · Mathematics 2023-11-02 Taishi Kurahashi , Rihito Takase

In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…

Logic in Computer Science · Computer Science 2021-07-30 José Espírito Santo , Ralph Matthes , Luís Pinto

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

The aim of this paper is to generalize some fixed point theorems in the class of convex contraction of order $m$ on a complete suprametric space. Then, we will prove that the class of convex contraction of order m is strong enough to…

General Mathematics · Mathematics 2026-05-11 Nicola Fabiano , Sedigheh Barootkoob , Hossein Lakzian

We classify the reflexive modules of rank one over rational and minimally elliptic singularities. Equivalently, we classify full line bundles on the resolutions of rational and minimally elliptic singularities. As an application, we…

Algebraic Geometry · Mathematics 2023-05-11 András Némethi , Agustín Romano-Velázquez

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

Logic · Mathematics 2023-11-08 Robert Goldblatt , Ian Hodkinson

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

Functional Analysis · Mathematics 2025-09-10 Babu G. V. R. , Alemayehu Negash , Sandhya M. L. , Meaza Bogale

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

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

Given a Henselian and Japanese discrete valuation ring $A$ and a flat and projective $A$-scheme $X$, we follow the approach of Biswas-dos Santos to introduce a full subcategory of coherent modules on $X$ which is then shown to be Tannakian.…

Algebraic Geometry · Mathematics 2019-04-25 Phung Ho Hai , Joao Pedro dos Santos

There has been a significant interest in extending various modal logics with intersection, the most prominent examples being epistemic and doxastic logics with distributed knowledge. Completeness proofs for such logics tend to be…

Logic in Computer Science · Computer Science 2020-04-07 Yì N. Wáng , Thomas Ågotnes

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibility to generalize what is arguably one of the most successful…

Logic in Computer Science · Computer Science 2015-11-02 Fredrik Dahlqvist