On the paralogicality of some logical constructs (Q946791)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the paralogicality of some logical constructs |
scientific article; zbMATH DE number 5346525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the paralogicality of some logical constructs |
scientific article; zbMATH DE number 5346525 |
Statements
On the paralogicality of some logical constructs (English)
0 references
24 September 2008
0 references
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''.
0 references
axiomatic system
0 references
function
0 references
proof
0 references
0.7483318448066711
0 references
0.7434943318367004
0 references
