Presburger arithmetic
Presburger arithmetic Presburger arithmetic is the first-order theory of the ... It is not as powerful as Peano arithmetic because multiplication is omitted. In fact, ...
http://en.wikipedia.org/wiki/Presburger_arithmetic - 6k - Cached - Similar pages

Talk:Presburger arithmetic
Talk:Presburger arithmetic has at least a runtime of 2 ... Here, n is the length of the Presburger statement. Hence, the problem is one of ... states only that the axioms of Peano arithmetic are either inconsistent or incomplete. It would ... the axioms were consistent (and therefore that arithmetic was incomplete), but there is still ...
http://en.wikipedia.org/wiki/Talk:Presburger_arithmetic - 3k - Cached - Similar pages

Arithmetic of Presburger   (translated from French)
Arithmetic of Presburger arithmetic of Presburger is a first order theory of arithmetic on the natural entireties, provided with ...
http://fr.wikipedia.org/wiki/Arithmétique_de_Presburger - 1k - Cached (French) - Wikipedia (French) - Similar pages

Mojżesz Presburger
Mojżesz Presburger Mojżesz Presburger (1904 - 1943) was a Polish mathematician, logician ... known for, among other things, having invented Presburger arithmetic. He died in a concentration camp.
http://en.wikipedia.org/wiki/Mojżesz_Presburger - 0k - Cached - Similar pages

Mojzesz Presburger   (translated from French)
Mojzesz Presburger Mojzesz Presburger (1904 - 1943) was a Polish mathematician, logician ... and is known to have shown decidability arithmetic of Presburger . It did not support a thesis, the ...
http://fr.wikipedia.org/wiki/Mojzesz_Presburger - 0k - Cached (French) - Wikipedia (French) - Similar pages

Second-order arithmetic
Second-order arithmetic In mathematical logic, second order arithmetic is a stronger version of Peano arithmetic that allows quantification over subsets of the ... are many different subsystems of second order arithmetic, differing in the strengths of the comprehension ... system (usually some subsystem of second order arithmetic) needed to prove some given result. ...
http://en.wikipedia.org/wiki/Second-order_arithmetic - 27k - Cached - Similar pages

Talk:Halting problem
... a theory strong enough to formulate elementary arithmetic", but what does that mean? Isn't ... least some of the true statements of arithmetic? AxelBoldt 02:30 Dec 2, 2002 (UTC ... least some of the true statements of arithmetic, it's certainly is not able to ... 2, 2002 (UTC) I don't understand. Presburger arithmetic for instance is able to prove ...
http://en.wikipedia.org/wiki/Talk:Halting_problem - 184k - Cached - Similar pages

List of first-order theories
... fields by using coordinates. p-adic fields Arithmetic The language of arithmetic has a constant 0, a function S ... Sometimes S(x) is denoted by x′. Presburger arithmetic The language of Presburger arithmetic consists of one binary function +. ...
http://en.wikipedia.org/wiki/List_of_first-order_theories - 32k - Cached - Similar pages

Gödel's incompleteness theorems
... demonstrated the incompleteness of a theory of arithmetic, but it is clear that the demonstration ... interest, since all true formal theories of arithmetic, i.e. theories the axioms of which ... even be provable. For example, first order arithmetic (Peano arithmetic or PA for short) can prove that ... Gödel mentioned above). In case of Peano arithmetic or any familiar explicitly axiomatized theory ...
http://en.wikipedia.org/wiki/Gödel's_incompleteness_theorems - 70k - Cached - Similar pages

Talk:Peano axioms
... Peano's axioms vs. first order Peano Arithmetic. I(different I than the above: this ... expressible in the first order language of arithmetic. If one replaces the last axiom with ... is generally used for second-order Peano arithmetic, but saying "second-order Peano axioms" I ... intro, especially since the section on Peano arithmetic also speaks of "the restriction of Peano ... 20:19, 15 November 2005 (UTC) Peano arithmetic is definitely a first-order theory; ...
http://en.wikipedia.org/wiki/Talk:Peano_axioms - 49k - Cached - Similar pages