An effective selection theorem

Journal of Symbolic Logic 47 (2):388-394 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,507

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

A selection theorem.Lefteris Miltiades Kirousis - 1983 - Journal of Symbolic Logic 48 (3):585-594.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
A completeness theorem in modal logic.Saul Kripke - 1959 - Journal of Symbolic Logic 24 (1):1-14.
A reduction theorem for predicate logic.M. H. Löb - 1972 - Journal of Symbolic Logic 37 (2):352-354.

Analytics

Added to PP
2009-01-28

Downloads
55 (#429,058)

6 months
16 (#191,137)

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

Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20-22):341-352.

Add more references