An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In constructive mathematics, Church's thesis is an axiom stating that all total functions are computable functions. thus restricts the class of functions to computable ones and consequently is incompatible with classical logic in sufficiently strong systems. For example, Heyting arithmetic with as an addition axiom is able to disprove some instances of variants of the law of the excluded middle. However, Heyting arithmetic is equiconsistent with Peano arithmetic as well as with Heyting arithmetic plus Church's thesis. That is, adding either the law of the excluded middle or Church's thesis does not make Heyting arithmetic inconsistent, but adding both does.

Property Value
dbo:abstract
  • In constructive mathematics, Church's thesis is an axiom stating that all total functions are computable functions. thus restricts the class of functions to computable ones and consequently is incompatible with classical logic in sufficiently strong systems. For example, Heyting arithmetic with as an addition axiom is able to disprove some instances of variants of the law of the excluded middle. However, Heyting arithmetic is equiconsistent with Peano arithmetic as well as with Heyting arithmetic plus Church's thesis. That is, adding either the law of the excluded middle or Church's thesis does not make Heyting arithmetic inconsistent, but adding both does. The Church–Turing thesis states that every effectively calculable function is a computable function. The constructivist version, , is much stronger, in the sense that with it every function is computable. (en)
dbo:wikiPageID
  • 15756448 (xsd:integer)
dbo:wikiPageLength
  • 8895 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1120872010 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • In constructive mathematics, Church's thesis is an axiom stating that all total functions are computable functions. thus restricts the class of functions to computable ones and consequently is incompatible with classical logic in sufficiently strong systems. For example, Heyting arithmetic with as an addition axiom is able to disprove some instances of variants of the law of the excluded middle. However, Heyting arithmetic is equiconsistent with Peano arithmetic as well as with Heyting arithmetic plus Church's thesis. That is, adding either the law of the excluded middle or Church's thesis does not make Heyting arithmetic inconsistent, but adding both does. (en)
rdfs:label
  • Church's thesis (constructive mathematics) (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License