Paraconsistent computation and dialetheic machines

DOI10.1007/978-3-319-40220-8_13MaRDI QIDQ5213766zbMATH OpenOpenAlexFDO

Authors Zach Weber

Publication date 4 February 2020

Published in Logical Studies of Paraconsistent Reasoning in Science and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-40220-8_13

zbMATH Keywords

dialetheisminconsistent computation

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Recommendations

• scientific article; zbMATH DE number 2226385
• Paraconsistent Machines and their Relation to Quantum Computing
• On the logical relativity of quantum computability
• The Diagonal Method and Hypercomputation
• Are the foundations of computer science logic-dependent?

Cites work

• A note on naive set theory in LP
• An Introduction to Gödel's Theorems
• Classical arithmetic is quite unnatural
• Frontiers of paraconsistent logic. Papers from the 1st world congress on paraconsistency, Ghent, Belgium, July 30--August 2, 1997
• scientific article; zbMATH DE number 3677792 (Why is no real title available?)
• scientific article; zbMATH DE number 43479 (Why is no real title available?)
• scientific article; zbMATH DE number 1735925 (Why is no real title available?)
• scientific article; zbMATH DE number 782632 (Why is no real title available?)
• scientific article; zbMATH DE number 5224002 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3099243 (Why is no real title available?)
• Incompleteness, Mechanism, and Optimism
• Inconsistent models for relevant arithmetics
• Inconsistent models of arithmetic. I: Finite models
• Paraconsistent Machines and their Relation to Quantum Computing
• Relevant Robinson's arithmetic
• Remarks on the content and extension of the notion of provability
• Saving Proof from Paradox: Gödel’s Paradox and the Inconsistency of Informal Mathematics
• The Derivation-Indicator View of Mathematical Practice
• The Godel Paradox and Wittgenstein's Reasons
• The logic of paradox
• There's something about Gödel. The complete guide to the incompleteness theorem. Transl. from the Italian
• Universal logic
• Why Do We Prove Theorems?

Cited in

(9)

• Warsaw discs and semicomputability
• Some Comments and Replies
• Paraconsistent Machines and their Relation to Quantum Computing
• Unconventional Models of Computation Through Non-standard Logic Circuits
• On the logical relativity of quantum computability
• scientific article; zbMATH DE number 2226385 (Why is no real title available?)
• Is there an inconsistent primitive recursive relation?
• Changing the logic without changing the subject: the case of computability
• A note on the strength of paraconsistent arithmetic

This page was built for publication: Paraconsistent computation and dialetheic machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5213766)