English
Related papers

Related papers: Modal definability based on {\L}ukasiewicz validit…

200 papers

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

Given a class $\mathcal C$ of models, a binary relation ${\mathcal R}$ between models, and a model-theoretic language $L$, we consider the modal logic and the modal algebra of the theory of $\mathcal C$ in $L$ where the modal operator is…

Logic · Mathematics 2019-10-22 Denis I. Saveliev , Ilya B. Shapirovsky

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

Logic in Computer Science · Computer Science 2021-03-08 Ugo Dal Lago , Francesco Gavazzo

Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold…

Logic · Mathematics 2012-10-30 Lev Beklemishev , David Gabelaia

This paper from 2008 is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the foundations are laid for later results. These foundations consist of a thorough…

Logic · Mathematics 2020-04-16 Evan Goris , Joost J. Joosten

Let $\mathcal{L}\subseteq \mathcal{L}^{\prime }$ be first order languages, let $R\in \mathcal{L}^{\prime }-\mathcal{L}$ be a relation symbol, and let $% \mathcal{K}$ be a class of $\mathcal{L}^{\prime }$-structures. In this paper we present…

Logic · Mathematics 2015-06-25 Miguel Campercholi , Diego Vaggione

I overview the work of the Tbilisi school on intuitionistic modal logics of well-founded/scattered structures and its connections with contemporary theoretical computer science. Fixed-point theorems and their consequences are of particular…

Logic in Computer Science · Computer Science 2017-08-21 Tadeusz Litak

In "On o-minimal homotopy groups", o-minimal homotopy was developed for the definable category, proving o-minimal versions of the Hurewicz theorems and the Whitehead theorem. Here, we extend these results to the category of locally…

Logic · Mathematics 2008-12-12 Elias Baro , Margarita Otero

We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal form theorem for the logic, define a natural deduction proof…

Logic · Mathematics 2025-03-13 Aleksi Anttila , Matilda Häggblom , Fan Yang

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

Logic in Computer Science · Computer Science 2021-05-19 Alexandru Baltag , Nick Bezhanishvili , David Fernández-Duque

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of…

Logic · Mathematics 2024-02-13 Timo Eckhardt , David J. Pym

I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn

We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…

Logic · Mathematics 2019-11-12 Saeed Salehi

This paper studies the modal logical aspects of provability predicates and consistency statements for theories of arithmetic. First, we provide an overview of previous works on the correspondence between various derivability conditions for…

Logic · Mathematics 2025-11-20 Haruka Kogure , Taishi Kurahashi

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Classically, two propositions are logically equivalent precisely when they are true under the same logical valuations. Also, two logical valuations are distinct if, and only if, there is a formula that is true according to one valuation,…

Logic · Mathematics 2013-10-10 Stefano Aguzzoli , Vincenzo Marra