English
Related papers

Related papers: Fredkin Gates for Finite-valued Reversible and Con…

200 papers

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…

Logic · Mathematics 2015-07-01 George Metcalfe , Nicola Olivetti

This paper is devoted to the construction of conditional logic system of {\L}ukasiewicz m-valued propositional logic. We construct conditional logic system {\L}CR based on {\L}ukasiewicz m-valued propositional logic. We construct world…

Logic · Mathematics 2024-07-30 Shuquan Huo

We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal…

Logic in Computer Science · Computer Science 2024-08-07 Alexander Kurz , Wolfgang Poiger , Bruno Teheux

We investigate some well-known (and a few not-so-well-known) many-valued logics that have a small number (3 or 4) of truth values. For some of them we complain that they do not have any \emph{logical} use (despite their perhaps having some…

Artificial Intelligence · Computer Science 2017-11-17 Allen P. Hazen , Francis Jeffry Pelletier

We introduce a new propositional logic, called very weak subintuitionistic logic $\mathbf{VF}$, by adapting the relational semantics of Fitting, Marek, and Truszczy\'nski for the pure logic of necessitation $\mathbf{N}$ to the propositional…

Logic · Mathematics 2026-05-21 Taishi Kurahashi , Mashu Noguchi

Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar and Hallden, these systems are equipped with an additional…

Logic · Mathematics 2024-07-24 Stefano Bonzio , Nicolò Zamperlin

Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in…

Artificial Intelligence · Computer Science 2016-08-30 Van Hung Le

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…

Logic in Computer Science · Computer Science 2021-04-19 Pablo Barenbaum , Teodoro Freund

We study a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…

Logic in Computer Science · Computer Science 2020-12-23 Igor Sedlár

Differentiable logics are a family of quantitative logics originated in the machine learning literature. Because of their origin, differentiable logics often come equipped with analytic properties that guarantee that they are…

Logic in Computer Science · Computer Science 2026-03-02 Reynald Affeldt , Alessandro Bruni , Ekaterina Komendantskaya , Natalia Ślusarz , Kathrin Stark

In this report reversible Toffoli and quantum Deutsch gates are extended to the p_valued domain. Their structural parameters are determined and their behavior is proven. Both conjunctive and disjunctive control strategies with positive and…

Emerging Technologies · Computer Science 2020-10-02 Claudio Moraga

We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…

Logic in Computer Science · Computer Science 2007-05-23 G. Metcalfe , N. Olivetti , D. Gabbay

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk,…

Logic in Computer Science · Computer Science 2021-08-13 Nils Kürbis

We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…

Logic in Computer Science · Computer Science 2019-03-14 Ranald Clouston , Aleš Bizjak , Hans Bugge Grathwohl , Lars Birkedal

Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…

Logic in Computer Science · Computer Science 2021-12-30 Giulio Fellin , Peter Schuster

In this work we study the decidability of a class of global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in the literature as modal many-valued logics. We exhibit a large family of these modal…

Logic · Mathematics 2022-04-18 Amanda Vidal

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

Continuing to pursue a research direction that we already explored in connection with G\"odel-Dummett logic and Ruspini partitions, we show here that {\L}ukasiewicz logic is able to express the notion of pseudo-triangular basis of fuzzy…

Logic in Computer Science · Computer Science 2013-11-26 Pietro Codara , Ottavio M. D'Antona , Vincenzo Marra

Involutive Stone algebras (or {\bf S}--algebras) were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued \L ukasiewicz--Moisil algebras. In this work we focus on the logic that preserves degrees of truth…

Logic · Mathematics 2023-04-25 Liliana M. Cantú , Martín Figallo