Recursion in a quantifier vs. elementary induction

Journal of Symbolic Logic 44 (2):235-259 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,795

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On n-quantifier induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466-482.
Quantifier-free induction for lists.Stefan Hetzl & Jannik Vierling - 2024 - Archive for Mathematical Logic 63 (7):813-835.
The dimension of the negation of transitive closure.Gregory L. McColm - 1995 - Journal of Symbolic Logic 60 (2):392-414.

Analytics

Added to PP
2009-01-28

Downloads
38 (#599,063)

6 months
9 (#509,115)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references