English
Related papers

Related papers: Semi De Morgan logic properly displayed

200 papers

In this paper we use display calculus to show the decidability for normal modal logic K and some of its extensions.

Logic · Mathematics 2023-12-27 Jinsheng Chen

The present paper provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems which…

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

We study the expressivity and computational aspects of first-order logic and its extensions in the semiring semantics developed by Gr\"adel and Tannen. We characterize the complexity of model checking and data complexity of first-order…

Logic in Computer Science · Computer Science 2025-05-21 Timon Barlag , Nicolas Fröhlich , Teemu Hankala , Miika Hannula , Minna Hirvonen , Vivian Holzapfel , Juha Kontinen , Arne Meier , Laura Strieker

Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…

Logic in Computer Science · Computer Science 2022-01-03 Esaïe Bauer , Olivier Laurent

The paper presents algebraic and logical developments. From the algebraic viewpoint, we introduce Monadic Equational Systems as an abstract enriched notion of equational presentation. From the logical viewpoint, we provide Equational…

Category Theory · Mathematics 2013-09-20 Marcelo Fiore

In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…

Logic in Computer Science · Computer Science 2024-02-13 Matteo Acclavio

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón

In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework…

Logic in Computer Science · Computer Science 2016-04-05 Sabine Frittella , Giuseppe Greco , Alessandra Palmigiano , Fan Yang

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Logic in Computer Science · Computer Science 2010-06-17 Kaustuv Chaudhuri

We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of…

Logic in Computer Science · Computer Science 2008-03-25 Luca Viganò , Marco Volpe

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

In this paper, we focus on the variety DHMSH of dually hemimorphic semi-Heyting algebras from a logical point of view. Firstly, we present a Hilbert-style axiomatization of a new logic called Dually hemimorphic semi-Heyting logic (DHMSH,…

Logic · Mathematics 2022-02-10 Juan M. Cornejo , Hanamantagouda P. Sankappanavar

We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error…

Logic in Computer Science · Computer Science 2016-01-07 Samuel Balco , Sabine Frittella , Giuseppe Greco , Alexander Kurz , Alessandra Palmigiano

We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…

Logic in Computer Science · Computer Science 2015-02-18 Taus Brock-Nannestad , Nicolas Guenot

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

Logic in Computer Science · Computer Science 2019-03-14 Christoph Benzmueller , Chad E. Brown , Michael Kohlhase

The category of admissible (in the appropriately modified sense of representation theory of totally disconnected groups) semi-linear representations of the automorphism group of an algebraically closed extension of infinite transcendence…

Representation Theory · Mathematics 2009-04-07 M. Rovinsky

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

In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…

Number Theory · Mathematics 2025-04-04 Derong Qiu

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é