English
Related papers

Related papers: Negation and Identity in a Modal Mode Theory

200 papers

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 consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

Fundamental duality is a concept which refers to two irreducible, heterogeneous principles which are in opposite and complementary of each other. The complementary principle in quantum mechanics is also praised by Bohr. This important…

General Physics · Physics 2023-01-31 B. T. T. Wong

Homotopy type theory is a formal language for doing abstract homotopy theory -- the study of identifications. But in unmodified homotopy type theory, there is no way to say that these identifications come from identifying the path-connected…

Category Theory · Mathematics 2022-04-06 David Jaz Myers

A sequential pattern with negation, or negative sequential pattern, takes the form of a sequential pattern for which the negation symbol may be used in front of some of the pattern's itemsets. Intuitively, such a pattern occurs in a…

Machine Learning · Computer Science 2023-09-22 Thomas Guyet

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

We explore end-to-end trained differentiable models that integrate natural logic with neural networks, aiming to keep the backbone of natural language reasoning based on the natural logic formalism while introducing subsymbolic vector…

Computation and Language · Computer Science 2020-11-11 Yufei Feng , Zi'ou Zheng , Quan Liu , Michael Greenspan , Xiaodan Zhu

This article supplements recent work of the authors. (1) A criterion for failure of covariant finiteness of a full subcategory of $\Lambda\text{-mod}$ is given, where $\Lambda$ is a finite dimensional algebra. The criterion is applied to…

Representation Theory · Mathematics 2014-07-10 B. Huisgen-Zimmermann , S. O. Smalø

Using Quillen-Lurie deformation theory formalism we develop an obstruction theory for studying the stable $\infty$-category of modules over a given geometric $\infty$-stack. The obstruction theory studies the problem of lifting compact…

Algebraic Geometry · Mathematics 2012-12-11 Romie Banerjee

We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category $\mathbb{EFF}$. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as…

Category Theory · Mathematics 2018-08-02 Benno van den Berg

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

This note gives a unifying characterization and exposition of strongly irreducible elements and their duals in lattices. The interest in the study of strong irreducibility stems from commutative ring theory, while the dual concept of strong…

Rings and Algebras · Mathematics 2016-09-16 Jawad Abuhlail , Christian Lomp

The aim of the paper is to study the topological modal logic of $T_0$ spaces, with the difference modality (for $T_n$, where $n\geq1 $ the corresponding logics were known). We consider propositional modal logic with two modal operators…

Logic · Mathematics 2019-12-03 Rajab Aghamov

Let $\frak g$ be a semisimple Lie algebra and $\frak k\subset\frak g$ be a reductive subalgebra. We say that a $\frak g$-module $M$ is a bounded $(\frak g, \frak k)$-module if $M$ is a direct sum of simple finite-dimensional $\frak…

Representation Theory · Mathematics 2017-10-11 Alexey Petukhov

This paper analyses the declarative readings of logic programming. Logic programming - and negation as failure - has no unique declarative reading. One common view is that logic programming is a logic for default reasoning, a sub-formalism…

Logic in Computer Science · Computer Science 2007-05-23 Marc Denecker

Coalition Logic is primarily concerned with what coalitions can achieve, whereas what coalitions cannot achieve -- their \emph{inability} -- has received comparatively little explicit attention. This asymmetry matters in artificial…

Logic in Computer Science · Computer Science 2026-05-01 Shanxia Wang

This work was intended to be an attempt to introduce the meta-language for working with multiple-conclusion inference rules that admit asserted propositions along with the rejected propositions. The presence of rejected propositions, and…

Logic · Mathematics 2014-12-01 Alex Citkin

We explore an inquisitive modal logic designed to reason about neighborhood models. This logic is based on an inquisitive strict conditional operator, which quantifies over neighborhoods, and which can be applied to both statements and…

Logic · Mathematics 2024-11-11 Ivano Ciardelli

Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure the…

Artificial Intelligence · Computer Science 2014-07-28 Jean-François Baget , Fabien Garreau , Marie-Laure Mugnier , Swan Rocher

We show undecidability of the satisfiability problem of what is arguably the simplest non-sub-Boolean modal logic with an implicit notion of binding. This work enriches the series of existing results of undecidability of modal logics with…

Logic in Computer Science · Computer Science 2015-08-18 Guillaume Hoffmann
‹ Prev 1 4 5 6 7 8 10 Next ›