English
Related papers

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

200 papers

We introduce a modal logic, called Cone Logic, whose formulas describe properties of points in the plane and spatial relationships between them. Points are labelled by proposition letters and spatial relations are induced by the four…

Logic in Computer Science · Computer Science 2017-01-11 Angelo Montanari , Gabriele Puppis , Pietro Sala

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…

Algebraic Topology · Mathematics 2024-05-31 Brice Le Grignou , Victor Roca i Lucio

Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…

Logic · Mathematics 2020-05-28 Tomasz Witczak

We continue investigating the interaction between flatness and $\mathfrak{a}$-adic completion for infinitely generated modules over a commutative ring $A$. We introduce the concept of $\mathfrak{a}$-adic flatness, which is weaker than…

Commutative Algebra · Mathematics 2017-09-07 Amnon Yekutieli

We use techniques originating from the subdiscipline of mathematical logic called `proof mining' to provide rates of metastability and - under a metric regularity assumption - rates of convergence for a subgradient-type algorithm solving…

Optimization and Control · Mathematics 2021-09-02 Nicholas Pischke , Ulrich Kohlenbach

While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the…

Logic in Computer Science · Computer Science 2014-06-09 Daniel Gorín , Lutz Schröder

We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras, where $T$ is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least…

Logic in Computer Science · Computer Science 2023-06-22 Marta Bílková , Matěj Dostál

We use the canonical formalism developed together with David Robinson to st= udy the Einstein equations on a null surface. Coordinate and gauge conditions = are introduced to fix the triad and the coordinates on the null surface. Toget= her…

General Relativity and Quantum Cosmology · Physics 2010-11-01 J. N. Goldberg , C. Soteriou

An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…

General Relativity and Quantum Cosmology · Physics 2014-08-20 I. P. Costa e Silva , J. L. Flores

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…

Logic · Mathematics 2026-03-19 Zalán Gyenis , Zalán Molnár , Övge Öztürk

We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse…

Logic in Computer Science · Computer Science 2026-03-05 Ulrich Kohlenbach

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Functional Analysis · Mathematics 2010-06-02 Gordan Zitkovic

Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…

Logic in Computer Science · Computer Science 2009-12-15 Christine Tasson

In this article we reduce the geometric stability conjecture for the scalar torus rigidity theorem to the conformal case via the Yamabe problem. Then we are able to prove the case where a sequence of Riemannian manifolds is conformal to a…

Differential Geometry · Mathematics 2021-06-29 Brian Allen

Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…

Logic in Computer Science · Computer Science 2023-06-07 Zeinab Galal

This article re-examines Lawvere's abstract, category-theoretic proof of the fixed-point theorem whose contrapositive is a `universal' diagonal argument. The main result is that the necessary axioms for both the fixed-point theorem and the…

Category Theory · Mathematics 2024-08-07 David Michael Roberts

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…

Logic in Computer Science · Computer Science 2019-09-04 Wesley H. Holliday , Tadeusz Litak