Elementary Formal Systems for Hyperarithmetical Relations

Mathematical Logic Quarterly 24 (1‐6):25-30 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Fitting, Melvin (1978) "Elementary Formal Systems for Hyperarithmetical Relations". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24(1-6):25-30

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2013-11-24

Downloads
17 (#1,164,273)

6 months
7 (#749,523)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Melvin Fitting
CUNY Graduate Center

Citations of this work

No citations found.

Add more citations

References found in this work

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Theory of Formal Systems.Raymond M. Smullyan - 1965 - Journal of Symbolic Logic 30 (1):88-90.

Add more references