About: Large countable ordinal     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:OrdinalNumber113597280, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FLarge_countable_ordinal

In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations (see ordinal analysis). However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not (for reasons somewhat analogous to the unsolvability of the halting problem); various more-concrete ways of defining ordinals that definitely have notations are available.

AttributesValues
rdf:type
rdfs:label
  • Grand ordinal dénombrable (fr)
  • Large countable ordinal (en)
  • Grandes ordinais contáveis (pt)
rdfs:comment
  • In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations (see ordinal analysis). However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not (for reasons somewhat analogous to the unsolvability of the halting problem); various more-concrete ways of defining ordinals that definitely have notations are available. (en)
  • En mathématiques, et plus particulièrement en théorie des ensembles, il existe de nombreuses méthodes de description des ordinaux dénombrables. Les plus petits (jusqu'à ε0) peuvent être exprimés (de façon utile et non circulaire) à l'aide de leur forme normale de Cantor. Au-delà, on parle de grands ordinaux dénombrables ; de nombreux grands ordinaux (le plus souvent en rapport avec la théorie de la démonstration) possèdent des notations ordinales calculables. Cependant, il n'est pas possible en général de décider si une notation ordinale potentielle en est effectivement une, pour des raisons analogues à celles rendant insoluble le problème de l'arrêt. (fr)
  • Na disciplina de teoria dos conjuntos, há muitas maneiras de descrever ordinais específicos eque são contáveis. As menores descrições podem ser claramente e de forma não-redundante expressas em termos de suas formas normais Cantor. Além disso, muitos ordinais relevantes para a teoria da prova ainda tem notações ordinais computáveis. No entanto, não é possível decidir eficazmente se uma determinada notação ordinal é notação ou não (por razões de certa forma análogas, à insolubilidade do problema da parada); existem várias maneiras de saber se uma notação ordinal é definível. (pt)
rdfs:seeAlso
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
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