English
Related papers

Related papers: Copies of classical logic in intuitionistic logic

200 papers

This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…

Logic in Computer Science · Computer Science 2025-12-30 Mikhail Rybakov

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

Kuroda's translation embeds first-order classical logic into intuitionistic logic, such that a formula and its translation are equivalent in classical logic. Recently, Brown and Rizkallah extended this translation to higher-order logic.…

Logic in Computer Science · Computer Science 2026-03-19 Thomas Traversié

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

We investigate different set-theoretic constructions in Residuated Logic based on Fitting's work on Intuitionistic Set Theory. We start by stating some results concerning constructible sets within valued models of Set Theory. We present two…

Logic · Mathematics 2023-06-05 Jose Moncayo , Pedro H. Zambrano

Classical logic is embedded into constructive logic, through a definition of the classical connectives and quantifiers in terms of the constructive ones.

Logic in Computer Science · Computer Science 2016-01-11 Gilles Dowek

The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…

Logic in Computer Science · Computer Science 2009-07-28 Zhaohua Luo

We present constructive provability logic, an intuitionstic modal logic that validates the L\"ob rule of G\"odel and L\"ob's provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and…

Logic in Computer Science · Computer Science 2012-05-30 Robert J. Simmons , Bernardo Toninho

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

Category Theory · Mathematics 2016-03-04 Darllan Conceição Pinto , Hugo Luiz Mariano

This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC)…

Logic in Computer Science · Computer Science 2015-02-18 Jennifer Paykin , Steve Zdancewic

In this paper we deal with a new approach to probabilistic reasoning in a logical framework. Nearly almost all logics of probability that have been proposed in the literature are based on classical two-valued logic. After making clear the…

Artificial Intelligence · Computer Science 2013-02-21 Petr Hajek , Lluis Godo , Francesc Esteva

Three classes of models of QHC, the joint logic of problems and propositions, are constructed, including a class of subset/sheaf-valued models that is related to solutions of some actual problems (such as solutions of algebraic equations).…

Logic · Mathematics 2022-10-04 Sergey A. Melikhov

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

It has been shown that a functional interpretation of proofs in mathematical analysis can be given by the product of selection functions, a mode of recursion that has an intuitive reading in terms of the computation of optimal strategies in…

Logic · Mathematics 2012-04-25 Paulo Oliva , Thomas Powell

We present a reading of the traditional syllogistics in a fragment of the propositional intuitionistic multiplicative linear logic and prove that with respect to a diagrammatic logical calculus that we introduced in a previous paper, a…

Logic in Computer Science · Computer Science 2013-03-01 Ruggero Pagnan

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

Canonical expressions are representative of implicative propositions upto renaming of variables. In this paper we explore, using a Monte-Carlo approach, the model of canonical expressions in order to confirm the paradox that says that…

Logic in Computer Science · Computer Science 2022-03-23 Pierre Lescanne

In this paper, we delve into the study of epistemic logics, interpreted through similarity models based on weighted graphs. We explore eight languages that extend the traditional epistemic language by incorporating modalities of common,…

Logic in Computer Science · Computer Science 2023-10-03 Xiaolong Liang , Yì N. Wáng

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic should in general be the logic of subsets of a given universe set. Partitions on…

Logic · Mathematics 2009-12-30 David Ellerman

Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be…

Logic · Mathematics 2026-03-10 Juha Kontinen , Ivano Ciardelli