Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Paris–Harrington_theorem> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Paris–Harrington_theorem abstract "In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic. This was the first "natural" example of a true statement about the integers that could be stated in the language of arithmetic, but not proved in Peano arithmetic; it was already known that such statements existed by Gödel's first incompleteness theorem.".
- Paris–Harrington_theorem wikiPageExternalLink Paris-HarringtonTheorem.html.
- Paris–Harrington_theorem wikiPageExternalLink ~maaib.
- Paris–Harrington_theorem wikiPageExternalLink new.pdf.
- Paris–Harrington_theorem wikiPageID "3875355".
- Paris–Harrington_theorem wikiPageLength "3705".
- Paris–Harrington_theorem wikiPageOutDegree "21".
- Paris–Harrington_theorem wikiPageRevisionID "666090274".
- Paris–Harrington_theorem wikiPageWikiLink Ackermann_function.
- Paris–Harrington_theorem wikiPageWikiLink Category:Independence_results.
- Paris–Harrington_theorem wikiPageWikiLink Category:Theorems_in_the_foundations_of_mathematics.
- Paris–Harrington_theorem wikiPageWikiLink Computable_function.
- Paris–Harrington_theorem wikiPageWikiLink Goodsteins_theorem.
- Paris–Harrington_theorem wikiPageWikiLink Gxc3xb6dels_first_incompleteness_theorem.
- Paris–Harrington_theorem wikiPageWikiLink Gxc3xb6dels_incompleteness_theorems.
- Paris–Harrington_theorem wikiPageWikiLink Jeff_Paris.
- Paris–Harrington_theorem wikiPageWikiLink Kanamori–McAloon_theorem.
- Paris–Harrington_theorem wikiPageWikiLink Kruskals_tree_theorem.
- Paris–Harrington_theorem wikiPageWikiLink Leo_Harrington.
- Paris–Harrington_theorem wikiPageWikiLink Mathematical_logic.
- Paris–Harrington_theorem wikiPageWikiLink Peano_arithmetic.
- Paris–Harrington_theorem wikiPageWikiLink Peano_axioms.
- Paris–Harrington_theorem wikiPageWikiLink Primitive_recursive_function.
- Paris–Harrington_theorem wikiPageWikiLink Ramsey_theory.
- Paris–Harrington_theorem wikiPageWikiLink Ramseys_theorem.
- Paris–Harrington_theorem wikiPageWikiLink Second-order_arithmetic.
- Paris–Harrington_theorem wikiPageWikiLinkText "Paris–Harrington theorem".
- Paris–Harrington_theorem hasPhotoCollection Paris–Harrington_theorem.
- Paris–Harrington_theorem subject Category:Independence_results.
- Paris–Harrington_theorem subject Category:Theorems_in_the_foundations_of_mathematics.
- Paris–Harrington_theorem comment "In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic. This was the first "natural" example of a true statement about the integers that could be stated in the language of arithmetic, but not proved in Peano arithmetic; it was already known that such statements existed by Gödel's first incompleteness theorem.".
- Paris–Harrington_theorem label "Paris–Harrington theorem".
- Paris–Harrington_theorem sameAs Twierdzenie_Parisa-Harringtona.
- Paris–Harrington_theorem sameAs Teorema_de_Paris-Harrington.
- Paris–Harrington_theorem sameAs m.0b4jb9.
- Paris–Harrington_theorem sameAs Q7137494.
- Paris–Harrington_theorem sameAs Q7137494.
- Paris–Harrington_theorem wasDerivedFrom Paris–Harrington_theorem?oldid=666090274.
- Paris–Harrington_theorem isPrimaryTopicOf Paris–Harrington_theorem.