English
Related papers

Related papers: Neighbourhood completeness for quantified pretrans…

200 papers

We generalize Kracht's theory of internal describability from classical modal logic to the family of all logics canonically associated with varieties of normal lattice expansions (LE algebras). We work in the purely algebraic setting of…

Logic · Mathematics 2024-05-03 Alessandra Palmigiano , Mattia Panettiere

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…

Logic · Mathematics 2015-07-01 George Metcalfe , Nicola Olivetti

Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.…

Logic in Computer Science · Computer Science 2017-03-08 Katsuhiko Sano , John G. Stell

In \cite{sp25}, continuous information frames were introduced that capture exactly all continuous domains. They are obtained from the information frames considered in \cite{sp21} by omitting the conservativity requirement. Information…

Logic in Computer Science · Computer Science 2025-07-29 Dieter Spreen

An open question in quantum complexity theory is whether or not the class $\operatorname{MIP}^{co}$, consisting of languages that can be efficiently verified using interacting provers sharing quantum resources according to the quantum…

Computational Complexity · Computer Science 2022-09-19 Isaac Goldbring , Bradd Hart

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

This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…

Logic in Computer Science · Computer Science 2025-12-30 Mikhail Rybakov

In this paper we prove complex bounds, also referred to as a priori bounds, for real analytic (and even C3) interval maps. This means that we associate to such a map a complex box mapping (which provides a kind of Markov structure),…

Dynamical Systems · Mathematics 2017-01-06 Trevor Clark , Sebastian van Strien , Sofia Trejo

Justification logic is a term used to identify a relatively new family of modal-like logics. There is an established literature about propositional justification logic, but incursions on the first-order case are scarce. In this paper we…

Logic in Computer Science · Computer Science 2018-08-30 Melvin Fitting , Felipe Salvatore

Let L be a strongly Z-graded ring, and let C be a bounded chain complex of finitely generated L-modules. We give a homological characterisation of when C is homotopy equivalent, over L_0, to a bounded complex of finitely generated…

K-Theory and Homology · Mathematics 2018-09-20 Thomas Huettemann , Luke Steers

We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…

Logic in Computer Science · Computer Science 2023-09-13 Philippe Balbiani , Han Gao , Çiğdem Gencer , Nicola Olivetti

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

We study mappings satisfying some estimate of distortion of modulus of families of paths. Under some conditions on definition and mapped domains, we have proved that these mappings are logarithmic H\"{o}lder continuous at boundary points.

Complex Variables · Mathematics 2023-04-04 Oleksandr Dovhopiatyi , Evgeny Sevost'yanov

Definite descriptions, such as 'the General Chair of KR 2024', are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for…

Logic in Computer Science · Computer Science 2024-09-12 Alessandro Artale , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…

Logic · Mathematics 2016-05-19 Tuomas A. Hakoniemi , Joost J. Joosten

Previous works by Gor\'e, Postniece and Tiu have provided sound and cut-free complete proof systems for modal logics extended with path axioms using the formalism of nested sequent. Our aim is to provide (i) a constructive cut-elimination…

Logic in Computer Science · Computer Science 2024-06-14 Sonia Marin , Paaras Padhiar

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

Logic in Computer Science · Computer Science 2021-09-20 Jan Rooduijn , Yde Venema

We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…

Combinatorics · Mathematics 2016-05-13 Matthias Hamann

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

It is proved that a map $\varphi\colon R\to S$ of commutative noetherian rings that is essentially of finite type and flat is locally complete intersection if and only $S$ is proxy small as a bimodule. This means that the thick subcategory…

Commutative Algebra · Mathematics 2021-02-09 Benjamin Briggs , Srikanth B. Iyengar , Janina C. Letz , Josh Pollitz
‹ Prev 1 8 9 10 Next ›