Skip to main content
MathOverflow

Return to Question

Rollback to Revision 1 - reverted
Source Link
Yemon Choi
Yemon Choi
  • 25.8k
  • 9
  • 69
  • 156

deleted (15 characters) Syntactical statements in PA about primitive recursive functions

deletedHow does one generally show syntactical statements in PA about primitive recursive functions or relations?

For example something like:

Let $A$ be a prim. rec. relation such that $n\in A$ for every numeral $n$. Show $PA \vdash \forall x A(x)$ (15 characterswhere $A$ denotes the relation as well as the formula representing the relation in PA).

deleted (15 characters)

deleted (15 characters)

Syntactical statements in PA about primitive recursive functions

How does one generally show syntactical statements in PA about primitive recursive functions or relations?

For example something like:

Let $A$ be a prim. rec. relation such that $n\in A$ for every numeral $n$. Show $PA \vdash \forall x A(x)$ (where $A$ denotes the relation as well as the formula representing the relation in PA).

Post Undeleted by François G. Dorais
Post Deleted by François G. Dorais
Post Closed as "no longer relevant" by Dan Petersen, Andy Putman, Qiaochu Yuan, Gjergji Zaimi, Asaf Karagila♦
deleted 314 characters in body; edited title
Source Link
AGISGA
AGISGA
  • 3
  • 2

Syntactical statements in PA about primitive recursive functions deleted (15 characters)

How does one generally show syntactical statements in PA about primitive recursive functions or relations?

For example something like:

Let $A$ be a prim. rec. relation such that $n\in A$ for every numeral $n$. Show $PA \vdash \forall x A(x)$deleted (where $A$ denotes the relation as well as the formula representing the relation in PA15 characters).

Syntactical statements in PA about primitive recursive functions

How does one generally show syntactical statements in PA about primitive recursive functions or relations?

For example something like:

Let $A$ be a prim. rec. relation such that $n\in A$ for every numeral $n$. Show $PA \vdash \forall x A(x)$ (where $A$ denotes the relation as well as the formula representing the relation in PA).

deleted (15 characters)

deleted (15 characters)

Source Link
AGISGA
AGISGA
  • 3
  • 2

Syntactical statements in PA about primitive recursive functions

How does one generally show syntactical statements in PA about primitive recursive functions or relations?

For example something like:

Let $A$ be a prim. rec. relation such that $n\in A$ for every numeral $n$. Show $PA \vdash \forall x A(x)$ (where $A$ denotes the relation as well as the formula representing the relation in PA).