Paraconsistent Computation and Dialetheic Machines

DOI10.1007/978-3-319-40220-8_13zbMath1429.03149OpenAlexW2558143317MaRDI QIDQ5213766

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)

Related Items

Some Comments and Replies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relevant Robinson's arithmetic
• A note on naive set theory in LP
• The logic of paradox
• Inconsistent models of arithmetic. I: Finite models
• An Introduction to Gödel's Theorems
• Paraconsistent Machines and their Relation to Quantum Computing
• Classical arithmetic is quite unnatural
• The Godel Paradox and Wittgenstein's Reasons
• Inconsistent models for relevant arithmetics
• Incompleteness, Mechanism, and Optimism
• Why Do We Prove Theorems?
• The Derivation-Indicator View of Mathematical Practice
• Saving Proof from Paradox: Gödel’s Paradox and the Inconsistency of Informal Mathematics