Recursion in a quantifier vs. elementary induction

DOI10.2307/2273731zbMath0426.03047OpenAlexW2012740592MaRDI QIDQ3861374

Phokion G. Kolaitis

Publication date: 1979

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273731

zbMATH Keywords

positive elementary inductionacceptable structurenormal classes of functionalssecond stage comparison theoremSpector-Gandy theorem

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Inductive definability (03D70)

Cites Work

• Unnamed Item
• Elementary induction on abstract structures
• The Suslin-Kleene theorem for countable structures
• Representability in some systems of second order arithmetic

This page was built for publication: Recursion in a quantifier vs. elementary induction