activity
20062024
most citedParaconsistent Machines and their Relation to Quantum Computing

3 citations · 5 across the 4 of their papers we have counts for

collaborators

5 papers

math.LO2024★ 1 cited

Analytic proofs for logics of evidence and truth

Walter Carnielli, Lorenzzo Frade, Abilio Rodrigues

This paper presents a sound, complete, and decidable analytic tableau system for the logic of evidence and truth \letf, introduced in Rodrigues, Bueno-Soler \& Carnielli (Synthese,…

math.LO2020

Logics of Formal Inconsistency enriched with replacement: an algebraic and modal account

Walter Carnielli, Marcelo E. Coniglio, David Fuenmayor

It is customary to expect from a logical system that it can be algebraizable, in the sense that an algebraic companion of the deductive machinery can always be found. Since the inc…

math.LO2019

Twist-Valued Models for Three-valued Paraconsistent Set Theory

Walter Carnielli, Marcelo E. Coniglio

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The origina…

quant-ph2008★ 3 cited

Paraconsistent Machines and their Relation to Quantum Computing

Juan C. Agudelo, Walter Carnielli

We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contrad…

quant-ph2006★ 1 cited

Quantum Computation via Paraconsistent Computation

Juan C. Agudelo, Walter Carnielli

We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we…