Jump to content

Talk:Primitive recursive arithmetic

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 86.132.222.183 (talk) at 21:45, 5 June 2014. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

History

History: Skolem (1923) the first published version.

Say sth about the possibility of presenting PRA in a logic-free equation calculus? (Propositional connectives can be replaced with pr functions.) 131.111.8.102 09:07, 25 August 2007 (UTC)[reply]

Left turn

Article takes a huge left turn at the logic-free calculus section, by using a formalism that is not explained, and apparently not even linked to the article. This is, indeed, a calculus which is free from logic! 70.247.164.231 (talk) 21:26, 28 August 2010 (UTC)[reply]

From and , deduce , for any predicate

What do you mean by "predicate" here? You don't mention above, that in the language of PRA predicate symbols exist. Perhaps you mean "formula of PRA"? Eugepros (talk) 10:48, 21 July 2011 (UTC)[reply]

Skolem arithmetic ?

Could anyone give a citation where PRA is called Skolem Arithmetic ? As far as I can tell, everytime I read "Skolem Arithmetic" in a mathematical article, it means the logic with multiplication on positive number, without addition.

Hence, this redirection seems really wrong to me. — Preceding unsigned comment added by Arthur MILCHIOR (talkcontribs) 12:18, 27 June 2012 (UTC)[reply]