01415871

j

01415871 Isles, David Theorems of Peano arithmetic are Buridan-Volpin recursively satisfiable. Rep. Math. Logic 31, 57-74 (1997). 1997 Uniwersytet Jagiello\'nski, Krak\'ow; Jagiellonian University Press, Krak\'ow EN recursive satisfaction first-order arithmetic Summary: 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.