##
Reports on Mathematical Logic

###
No. 31

David ISLES:

Theorems of Peano arithmetic are Buridan-Volpin recursively satisfable
A b s t r a c t.
The notion of recursive satisfaction is extended from prenex $\forall \exists$
arithmetic sentences to any first-order arithmetic sentence by allowing the
scope of a negative (existential) quantifier to depend on positive (universal)
quantifiers which may lie within its scope.

Back to Main Menu