On the public citation graph

Paraconsistent Machines and their Relation to Quantum Computing

https://doi.org/10.1093/logcom/exp072
0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4020-6324-4_1openalex-snapshot
Logics of Formal Inconsistency
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_34openalex-snapshot
Turing-Machines and the Entscheidungsproblem
inferredcites →https://doi.org/10.1007/978-3-540-73554-0_5openalex-snapshot
Unconventional Models of Computation Through Non-standard Logic Circuits
inferredcites →https://doi.org/10.1007/978-94-017-3598-8_9openalex-snapshot
Quantum Computational Logics: A Survey
inferredcites →https://doi.org/10.1007/bf01058531openalex-snapshot
On Jaśkowski's discussive logics
inferredcites →https://doi.org/10.1007/bf01470748openalex-snapshot
Turing-machines and the Entscheidungsproblem
inferredcites →https://doi.org/10.1016/j.ic.2006.02.001openalex-snapshot
Weakly complete axiomatization of exogenous quantum propositional logic
inferredcites →https://doi.org/10.1016/j.jal.2004.07.009openalex-snapshot
Paraconsistent logic from a modal viewpoint
inferredcites →https://doi.org/10.1017/cbo9781139164931openalex-snapshot
Computability and Logic
inferredcites →https://doi.org/10.1051/ita:2000123openalex-snapshot
Local Transition Functions of Quantum Turing Machines
inferredcites →https://doi.org/10.1098/rspa.1985.0070openalex-snapshot
Quantum theory, the Church–Turing principle and the universal quantum computer
inferredcites →https://doi.org/10.1098/rspa.1989.0099openalex-snapshot
Quantum computational networks
inferredcites →https://doi.org/10.1098/rspa.1992.0167openalex-snapshot
Rapid solution of problems by quantum computation
inferredcites →https://doi.org/10.1098/rspa.1998.0164openalex-snapshot
Quantum algorithms revisited
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1142/s0219749905000943openalex-snapshot
LOGICS FROM QUANTUM COMPUTATION
inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot
Logical Reversibility of Computation
inferredcites →https://doi.org/10.12775/llp.2000.008openalex-snapshot
Formal inconsistency and evolutionary databases
inferredcites →https://doi.org/10.21146/2074-1472-2002-9-0-301-309openalex-snapshot
S5 is a paraconsistent logic and so is first-order classical logic
inferredcites →https://doi.org/10.2307/2269326openalex-snapshot
A note on the Entscheidungsproblem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-77382-2_2openalex-snapshot
Paraconsistency for the Working Software Engineer (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-032-11027-5_1openalex-snapshot
A Fascination for Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-40220-8_13openalex-snapshot
Paraconsistent Computation and Dialetheic Machines
inferred← citeshttps://doi.org/10.1007/978-81-322-2719-9_3openalex-snapshot
On the Philosophy and Mathematics of the Logics of Formal Inconsistency
inferred← citeshttps://doi.org/10.1007/s11225-024-10144-yopenalex-snapshot
Where the Truth Lies: A Paraconsistent Approach to Bayesian Epistemology
inferred← citeshttps://doi.org/10.1007/s11787-012-0075-4openalex-snapshot
Multimodal Incompleteness Under Weak Negations
inferred← citeshttps://doi.org/10.1016/b978-0-323-95504-1.01213-8openalex-snapshot
Paraconsistency and Paraconsistent Logics
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103196openalex-snapshot
Specification of paraconsistent transition systems, revisited
inferred← citeshttps://doi.org/10.1017/s0960129525100170openalex-snapshot
Paraconsistent transition structures: compositional principles and a modal logic
inferred← citeshttps://doi.org/10.1080/17445760.2020.1805610openalex-snapshot
Reflections on probabilistic compared to quantum computational devices
inferred← citeshttps://doi.org/10.1093/jigpal/jzag032openalex-snapshot
A note on the strength of paraconsistent arithmetic
inferred← citeshttps://doi.org/10.1109/clei.2012.6426919openalex-snapshot
Quantum processes: A new interpretation for quantum transformations in the VPE-qGM environment
inferred← citeshttps://doi.org/10.19153/cleiej.16.3.3openalex-snapshot
Expanding the VPE-qGM Environment Towards a Parallel Quantum Simulation of Quantum Processes Using GPUs
inferred← citeshttps://doi.org/10.4204/eptcs.376.3openalex-snapshot
Paraconsistent Transition Systems
inferred← citeshttps://doi.org/10.4204/eptcs.421.8openalex-snapshot
Paraconsistent Relations as a Variant of Kleene Algebras
inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.787718openalex-snapshot
Uma abordagem modelo-teórica da computabilidade de Turing clássica
inferred← citeshttps://doi.org/10.5540/tema.2013.014.03.0399openalex-snapshot
Quantum Processes: A Novel Optimization for Quantum Simulation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.