About: Church's thesis (constructive mathematics)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FChurch%27s_thesis_%28constructive_mathematics%29&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

AttributesValues
rdfs:label
  • Church's thesis (constructive mathematics) (en)
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)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has 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)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software