English
Related papers

Related papers: Negation and Identity in a Modal Mode Theory

200 papers

A brief history of the impurity theories in semiconductors is provided. A bound exciton model is proposed for both donor- and acceptor- like impurities and point defects, which offers a unified understanding for "shallow" and "deep"…

Materials Science · Physics 2020-06-02 Yong Zhang

The concept of gauge invariance can be considered one of the most subtle and useful concept in theoretical physics since it can permit the comprehension of difficult systems in physics with an arbitrary choice of a reference frame at every…

High Energy Physics - Theory · Physics 2010-01-19 E. M. C. Abreu , J. Ananias Neto , A. C. R. Mendes , C. Neves , W. Oliveira

We describe a new method of finding interpolants for classical logic using certain refutation system as a starting point. Refutation can be thought of as an alternative approach to the analysis of formal systems: instead of focusing on…

Logic in Computer Science · Computer Science 2026-03-18 Adam Trybus , Karolina Rożko , Tomasz Skura

A quantitative form of the Nullity Theorem is presented, which establishes a linear relation between the singular values of the two submatrices involved in the theorem up to the first order. The theorem is then extended to function spaces…

Numerical Analysis · Mathematics 2008-12-02 Ruitian Lang

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination. We show that to each rewrite system on terms, we can associate a logical system:…

Logic in Computer Science · Computer Science 2023-05-24 Gilles Dowek

The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework of modal…

Logic in Computer Science · Computer Science 2015-07-14 Juha Kontinen , Julian-Steffen Müller , Henning Schnoor , Heribert Vollmer

We study preservation theorems for modal logics over finite structures with respect to three fundamental semantic relations: embeddings, injective homomorphisms, and homomorphisms. We focus on classes of pointed Kripke models that are…

Logic in Computer Science · Computer Science 2026-02-03 Przemysław Andrzej Wałęga , Bernardo Cuenca Grau

The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…

Logic · Mathematics 2022-02-23 Marcelo Esteban Coniglio , Guilherme Vicentin de Toledo

In this article, I argue that modern spacetime physics causes problems for a number of traditional accounts of modality, but also offers important new ideas about the connection between modal and non-modal features of reality. I suggest…

History and Philosophy of Physics · Physics 2025-07-29 Emily Adlam

The type-theoretic modelling of DRT that [degroote06] proposed features continuations for the management of the context in which a clause has to be interpreted. This approach, while keeping the standard definitions of quantifier scope,…

Computation and Language · Computer Science 2008-12-18 Sylvain Pogodalla

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…

Logic in Computer Science · Computer Science 2007-05-23 François Bry

In this short paper we will discuss the similarities and differences between two semantic approaches to modal logics - non-deterministic semantics and restricted non-deterministic semantics. Generally speaking, both kinds of semantics are…

Logic in Computer Science · Computer Science 2025-01-03 Marcelo E. Coniglio , Paweł Pawłowski , Daniel Skurt

We derive a Prolog theorem prover for an Intuitionistic Epistemic Logic by starting from the sequent calculus {\bf G4IP} that we extend with operator definitions providing an embedding in intuitionistic propositional logic ({\bf IPC}). With…

Logic in Computer Science · Computer Science 2019-09-17 Paul Tarau

We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies…

Logic in Computer Science · Computer Science 2015-07-01 Dirk Pattinson , Lutz Schröder

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

Logic · Mathematics 2025-09-03 Bahareh Afshari , Graham E. Leigh , Guillermo Menèndez Turata

We continue the theory of $\tT$-systems from the work of the second author, describing both ground systems and module systems over a ground system (paralleling the theory of modules over an algebra). The theory, summarized categorically at…

Rings and Algebras · Mathematics 2018-11-01 Jaiung Jun , Louis Rowen

We present a type theory called fibrational virtual double type theory (FVDblTT) designed specifically for formal category theory, which is a succinct reformulation of New and Licata's Virtual Equipment Type Theory (VETT). FVDblTT…

Category Theory · Mathematics 2025-01-24 Hayato Nasu

We establish a foundational homotopical framework for ternary $\Gamma$-modules by establishing that $\mathcal{T}\text{-Mod}$ is a Barr-exact, monoidal closed category. We resolve the long-standing "additivity obstruction" in non-binary…

Rings and Algebras · Mathematics 2026-01-15 Chandrasekhar Gokavarapu