English
Related papers

Related papers: On Affine Logic and {\L}ukasiewicz Logic

200 papers

We investigate four well-known negative translations of classical logic into intuitionistic logic within a substructural setting. We find that in affine logic the translation schemes due to Kolmogorov and G\"odel both satisfy Troelstra's…

Logic in Computer Science · Computer Science 2019-12-03 Rob Arthan , Paulo Oliva

We explore the problem of explaining observations in contexts involving statements with truth degrees such as `the lift is loaded', `the symptoms are severe', etc. To formalise these contexts, we consider infinitely-valued {\L}ukasiewicz…

Logic in Computer Science · Computer Science 2025-11-11 Katsumi Inoue , Daniil Kozhemiachenko

This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…

Logic in Computer Science · Computer Science 2017-11-13 Daniele Porello

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

This report first shows the equivalence bewteen several formulations of classical logic in intuitionistic logic (tertium non datur, reductio ad absurdum, Pierce's law). Then it establishes the correctness of the G\"odel-Kolmogorov…

Logic · Mathematics 2016-02-26 Richard Moot , Christian Retoré

We introduce a family of modal expansions of {\L}ukasiewicz logic that are designed to accommodate modal translations of generalized basic logic (as formulated with exchange, weakening, and falsum). We further exhibit algebraic semantics…

Logic · Mathematics 2021-06-11 Wesley Fussner , William Zuluaga Botero

Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…

Logic · Mathematics 2026-05-28 Zuzana Haniková , Filip Jankovec

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…

Logic in Computer Science · Computer Science 2019-04-16 Jiaming Jiang , Harley Eades , Valeria de Paiva

Prawitz suggested expanding a natural deduction system for intuitionistic logic to include rules for classical logic constructors, allowing both intuitionistic and classical elements to coexist without losing their inherent characteristics.…

Logic · Mathematics 2025-04-15 João Rasga , Cristina Sernadas

Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…

Logic · Mathematics 2025-11-11 Gilda Ferreira , Paulo Oliva , Clarence Lewis Protin

Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…

Logic in Computer Science · Computer Science 2017-03-10 Steffen Lewitzka

We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…

Logic in Computer Science · Computer Science 2025-07-10 Sara Ayhan , Hrafn Valtýr Oddsson

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…

Logic · Mathematics 2026-03-02 Jim de Groot , Tadeusz Litak , Dirk Pattinson

In this paper we introduce the convex fragment of {\L}ukasiewicz Logic and discuss its possible applications in different learning schemes. Indeed, the provided theoretical results are highly general, because they can be exploited in any…

Logic in Computer Science · Computer Science 2018-11-08 Francesco Giannini , Michelangelo Diligenti , Marco Gori , Marco Maggini

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, exhibiting a classical…

Logic in Computer Science · Computer Science 2023-08-11 Eben Blaisdell , Max Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the…

Logic in Computer Science · Computer Science 2013-12-20 Mélanie Boudard , Olivier Hermant

In this note we prove that single-conclusion admissible rules of any proper axiomatic extension of the infnite valued Lukasiewicz logic are finitely based.

Logic · Mathematics 2015-12-14 Joan Gispert

In [1], systems of weakening of intuitionistic negation logic called Z_n and CZ_n were developed in the spirit of da Costa's approach(c.f. [2]) by preserving, differently from da Costa, its fundamental properties: antitonicity, inversion…

Logic in Computer Science · Computer Science 2011-02-10 Zoran Majkic

In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…

Logic · Mathematics 2020-03-04 Hiromi Tanaka

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon
‹ Prev 1 2 3 10 Next ›