Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Skolem_arithmetic> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Skolem_arithmetic abstract "Skolem arithmetic is the first-order theory of the natural numbers with multiplication, named in honor of Thoralf Skolem. The signature of Skolem arithmetic contains only the multiplication operation and equality, omitting the addition operation entirely.Skolem arithmetic is much weaker than Peano arithmetic, which includes both addition and multiplication operations. Unlike Peano arithmetic, Skolem arithmetic is a decidable theory. This means it is possible to effectively determine, for any sentence in the language of Skolem arithmetic, whether that sentence is provable from the axioms of Skolem arithmetic. The asymptotic running-time computational complexity of this decision problem is triply exponential, however.".
- Skolem_arithmetic wikiPageID "6694711".
- Skolem_arithmetic wikiPageRevisionID "510246329".
- Skolem_arithmetic hasPhotoCollection Skolem_arithmetic.
- Skolem_arithmetic subject Category:Formal_theories_of_arithmetic.
- Skolem_arithmetic comment "Skolem arithmetic is the first-order theory of the natural numbers with multiplication, named in honor of Thoralf Skolem. The signature of Skolem arithmetic contains only the multiplication operation and equality, omitting the addition operation entirely.Skolem arithmetic is much weaker than Peano arithmetic, which includes both addition and multiplication operations. Unlike Peano arithmetic, Skolem arithmetic is a decidable theory.".
- Skolem_arithmetic label "Skolem arithmetic".
- Skolem_arithmetic sameAs m.0k2bqft.
- Skolem_arithmetic sameAs Q7536198.
- Skolem_arithmetic sameAs Q7536198.
- Skolem_arithmetic wasDerivedFrom Skolem_arithmetic?oldid=510246329.
- Skolem_arithmetic isPrimaryTopicOf Skolem_arithmetic.