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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

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

Cauchy completeness in elementary logic.J. C. Cifuentes, A. M. Sette & D. Mundici - 1996 - Journal of Symbolic Logic 61 (4):1153-1157.
A model theory of induction.Philip N. Johnson‐Laird - 1994 - International Studies in the Philosophy of Science 8 (1):5 – 29.
The dimension of the negation of transitive closure.Gregory L. McColm - 1995 - Journal of Symbolic Logic 60 (2):392-414.
Elementary realizability.Zlatan Damnjanovic - 1997 - Journal of Philosophical Logic 26 (3):311-339.
T-convexity and Tame extensions.LouDen Dries & Adam H. Lewenberg - 1995 - Journal of Symbolic Logic 60 (1):74 - 102.

Analytics

Added to PP
2009-01-28

Downloads
27 (#588,912)

6 months
5 (#637,009)

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.
Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.

Add more references