On the paralogicality of some logical constructs

DOI10.1007/S10559-008-9014-ZMaRDI QIDQ946791zbMATH OpenOpenAlexFDO

Authors P. V. Vasilik, A. I. Provotar'

Publication date 24 September 2008

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-008-9014-z

zbMATH Keywords

axiomatic systemfunctionproof

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30)

Review text

It is claimed that the basic results of computability theory contain some explicit contradictions as premises. For example Gödel's incompleteness theorem is dismissed since ``the relation that determines the set of formulas derived in the theory \(S\) is (at least) incorrect.

Recommendations

• Proving contradictions in formal theories. I
• scientific article; zbMATH DE number 4200174
• Logic of paradox revisited
• scientific article; zbMATH DE number 221552
• Virtual logic

Cites work

• scientific article; zbMATH DE number 3839930 (Why is no real title available?)
• scientific article; zbMATH DE number 3948220 (Why is no real title available?)
• scientific article; zbMATH DE number 3702542 (Why is no real title available?)
• Incompleteness in a topos
• To the problem of incompleteness of theoretical constructs (illustrated by examples of formalization of some problems of natural sciences)

Cited in

(3)

• A note on freedom from detachment in the logic of paradox
• Virtual logic
• scientific article; zbMATH DE number 7503174 (Why is no real title available?)

This page was built for publication: On the paralogicality of some logical constructs

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