Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q956059> ?p ?o }
Showing triples 1 to 59 of
59
with 100 triples per page.
- Q956059 subject Q7451685.
- Q956059 subject Q7452060.
- Q956059 subject Q7464734.
- Q956059 subject Q8133811.
- Q956059 subject Q8466140.
- Q956059 abstract "Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omitting the multiplication operation entirely. The axioms include a schema of induction.Presburger arithmetic is much weaker than Peano arithmetic, which includes both addition and multiplication operations. Unlike Peano arithmetic, Presburger arithmetic is a decidable theory. This means it is possible to algorithmically determine, for any sentence in the language of Presburger arithmetic, whether that sentence is provable from the axioms of Presburger arithmetic. The asymptotic running-time computational complexity of this decision problem is doubly exponential, however, as shown by Fischer & Rabin (1974).".
- Q956059 wikiPageExternalLink presburger.pdf.
- Q956059 wikiPageExternalLink MIT-LCS-TM-043.ps.
- Q956059 wikiPageExternalLink 125826.125848.
- Q956059 wikiPageExternalLink 800133.804361.
- Q956059 wikiPageExternalLink princess.shtml.
- Q956059 wikiPageExternalLink pdf?md5=0415089a2d692fcece18b43b5f63c67d&pid=1-s2.0-0022000078900211-main.pdf.
- Q956059 wikiPageWikiLink Q11030584.
- Q956059 wikiPageWikiLink Q1131652.
- Q956059 wikiPageWikiLink Q11589.
- Q956059 wikiPageWikiLink Q12525525.
- Q956059 wikiPageWikiLink Q126695.
- Q956059 wikiPageWikiLink Q1319773.
- Q956059 wikiPageWikiLink Q134164.
- Q956059 wikiPageWikiLink Q15846555.
- Q956059 wikiPageWikiLink Q1717800.
- Q956059 wikiPageWikiLink Q176916.
- Q956059 wikiPageWikiLink Q178377.
- Q956059 wikiPageWikiLink Q1849020.
- Q956059 wikiPageWikiLink Q200787.
- Q956059 wikiPageWikiLink Q205084.
- Q956059 wikiPageWikiLink Q2067766.
- Q956059 wikiPageWikiLink Q2076913.
- Q956059 wikiPageWikiLink Q21199.
- Q956059 wikiPageWikiLink Q3075235.
- Q956059 wikiPageWikiLink Q32043.
- Q956059 wikiPageWikiLink Q3262192.
- Q956059 wikiPageWikiLink Q333464.
- Q956059 wikiPageWikiLink Q357965.
- Q956059 wikiPageWikiLink Q360812.
- Q956059 wikiPageWikiLink Q40056.
- Q956059 wikiPageWikiLink Q4055684.
- Q956059 wikiPageWikiLink Q430001.
- Q956059 wikiPageWikiLink Q431667.
- Q956059 wikiPageWikiLink Q460340.
- Q956059 wikiPageWikiLink Q473841.
- Q956059 wikiPageWikiLink Q49008.
- Q956059 wikiPageWikiLink Q5533794.
- Q956059 wikiPageWikiLink Q6042592.
- Q956059 wikiPageWikiLink Q6831406.
- Q956059 wikiPageWikiLink Q741810.
- Q956059 wikiPageWikiLink Q7451685.
- Q956059 wikiPageWikiLink Q7452060.
- Q956059 wikiPageWikiLink Q7464734.
- Q956059 wikiPageWikiLink Q792536.
- Q956059 wikiPageWikiLink Q8017123.
- Q956059 wikiPageWikiLink Q8133811.
- Q956059 wikiPageWikiLink Q8366.
- Q956059 wikiPageWikiLink Q842755.
- Q956059 wikiPageWikiLink Q8466140.
- Q956059 wikiPageWikiLink Q858520.
- Q956059 wikiPageWikiLink Q928884.
- Q956059 comment "Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omitting the multiplication operation entirely. The axioms include a schema of induction.Presburger arithmetic is much weaker than Peano arithmetic, which includes both addition and multiplication operations.".
- Q956059 label "Presburger arithmetic".