An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable

Property Value
dbo:description
  • teoria matematica del primo ordine (it)
  • sistema lògic axiomàtic (ca)
  • finie aksiomigebla fragmento de unuaorda aritmetiko de Peano, kiu estas esence nedecidebla kaj rikure nekompletigebla (eo)
  • finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable (en)
dbo:wikiPageWikiLink
dbp:date
  • January 2023 (en)
dbp:reason
  • Authors tend to use slightly different but closely related versions of Q, so it would be helpful to explain more clearly the claim that the finite fragment of PA formed from PA with the induction schema removed is not the same as Q . (en)
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Robinson arithmetic (en)
  • Robinsonova aritmetika (cs)
  • Robinson-Arithmetik (de)
  • Arithmétique de Robinson (fr)
  • Aritmetica di Robinson (it)
  • ロビンソン算術 (ja)
  • Aritmética de Robinson (pt)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International