Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Tennenbaums_theorem> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Tennenbaums_theorem abstract "Tennenbaum's theorem, named for Stanley Tennenbaum who presented the theorem in 1959, is a result in mathematical logic that states that no countable nonstandard model of Peano arithmetic (PA) can be recursive.".
- Tennenbaums_theorem wikiPageExternalLink tennenbaum.pdf.
- Tennenbaums_theorem wikiPageID "13392068".
- Tennenbaums_theorem wikiPageLength "7034".
- Tennenbaums_theorem wikiPageOutDegree "22".
- Tennenbaums_theorem wikiPageRevisionID "646435895".
- Tennenbaums_theorem wikiPageWikiLink Bounded_quantifier.
- Tennenbaums_theorem wikiPageWikiLink Bounded_quantifiers.
- Tennenbaums_theorem wikiPageWikiLink Category:Model_theory.
- Tennenbaums_theorem wikiPageWikiLink Category:Theorems_in_the_foundations_of_mathematics.
- Tennenbaums_theorem wikiPageWikiLink Countable_set.
- Tennenbaums_theorem wikiPageWikiLink George_Boolos.
- Tennenbaums_theorem wikiPageWikiLink Gxc3xb6dels_incompleteness_theorem.
- Tennenbaums_theorem wikiPageWikiLink Gxc3xb6dels_incompleteness_theorems.
- Tennenbaums_theorem wikiPageWikiLink Gödel_numbering.
- Tennenbaums_theorem wikiPageWikiLink Isomorphism.
- Tennenbaums_theorem wikiPageWikiLink John_P._Burgess.
- Tennenbaums_theorem wikiPageWikiLink Mathematical_logic.
- Tennenbaums_theorem wikiPageWikiLink Model_theory.
- Tennenbaums_theorem wikiPageWikiLink Natural_number.
- Tennenbaums_theorem wikiPageWikiLink Natural_numbers.
- Tennenbaums_theorem wikiPageWikiLink Non-standard_model_of_arithmetic.
- Tennenbaums_theorem wikiPageWikiLink Overspill.
- Tennenbaums_theorem wikiPageWikiLink Peano_arithmetic.
- Tennenbaums_theorem wikiPageWikiLink Peano_axioms.
- Tennenbaums_theorem wikiPageWikiLink Recursively_enumerable.
- Tennenbaums_theorem wikiPageWikiLink Recursively_enumerable_set.
- Tennenbaums_theorem wikiPageWikiLink Recursively_inseparable_sets.
- Tennenbaums_theorem wikiPageWikiLink Richard_Jeffrey.
- Tennenbaums_theorem wikiPageWikiLink Stanley_Tennenbaum.
- Tennenbaums_theorem wikiPageWikiLink Μ-recursive_function.
- Tennenbaums_theorem wikiPageWikiLinkText "Tennenbaum's theorem".
- Tennenbaums_theorem wikiPageWikiLinkText "there is no recursive non-standard model of PA".
- Tennenbaums_theorem date "October 2014".
- Tennenbaums_theorem hasPhotoCollection Tennenbaums_theorem.
- Tennenbaums_theorem reason "'parameters' means 'free variables' here?".
- Tennenbaums_theorem reason "Please explain or wikilink: what is encoded by what?".
- Tennenbaums_theorem reason "The formula is true due to the disjointness, but why is it provable? In particular, if e.g. A was given by an arbitrary Turing machine or mu-recursive function, how can the property of being the x.th smallest element of A be expressed in the PA language in the first place?".
- Tennenbaums_theorem reason "The target article introduces many variants. Apparently, a specific one of them is meant here, a 1st-order axiomatization involving not just S and 0, but also +, *, less-than, and 1. Clearly indicate which one.".
- Tennenbaums_theorem wikiPageUsesTemplate Template:Cite_book.
- Tennenbaums_theorem wikiPageUsesTemplate Template:Clarify.
- Tennenbaums_theorem subject Category:Model_theory.
- Tennenbaums_theorem subject Category:Theorems_in_the_foundations_of_mathematics.
- Tennenbaums_theorem hypernym Result.
- Tennenbaums_theorem comment "Tennenbaum's theorem, named for Stanley Tennenbaum who presented the theorem in 1959, is a result in mathematical logic that states that no countable nonstandard model of Peano arithmetic (PA) can be recursive.".
- Tennenbaums_theorem label "Tennenbaum's theorem".
- Tennenbaums_theorem sameAs Satz_von_Tennenbaum.
- Tennenbaums_theorem sameAs m.03c3ts8.
- Tennenbaums_theorem sameAs Q2226803.
- Tennenbaums_theorem sameAs Q2226803.
- Tennenbaums_theorem wasDerivedFrom Tennenbaums_theoremoldid=646435895.
- Tennenbaums_theorem isPrimaryTopicOf Tennenbaums_theorem.