Set recursion and Πhalf-logic

&
Annals of Pure and Applied Logic 28 (3):255-286 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(85)90017-x

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

On the recursion theorem in iterative operative spaces.J. Zashev - 2001 - Journal of Symbolic Logic 66 (4):1727-1748.
Closing the gap between the continuous functionals and recursion in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $^3E$\end{document}. [REVIEW]Dag Normann - 1997 - Archive for Mathematical Logic 36 (4-5):269-287.
Models for recursion theory.Johan Moldestad & Dag Normann - 1976 - Journal of Symbolic Logic 41 (4):719-729.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Tiering as a recursion technique.Harold Simmons - 2005 - Bulletin of Symbolic Logic 11 (3):321-350.
Embeddability of ptykes.Jean-Yves Girard & Dag Normann - 1992 - Journal of Symbolic Logic 57 (2):659-676.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
Some recent developments in higher recursion theory.Sy D. Friedman - 1983 - Journal of Symbolic Logic 48 (3):629-642.
On the physical possibility of ordinal computation (draft).Jeffrey A. Barrett & Wayne Aitken - unknown
What is Radical Recursion?Steven M. Rosen - 2004 - SEED Journal 4 (1):38-57.
Recursion theory and the lambda-calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.
Tailoring recursion for complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
Computability, enumerability, unsolvability: directions in recursion theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - New York: Cambridge University Press.
Diagonalization and self-reference.Raymond Merrill Smullyan - 1994 - New York: Clarendon Press.

Analytics

Added to PP
2013-10-30

Downloads
31 (#488,695)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Normann
University of Oslo

Citations of this work

Well ordering principles and -statements: A pilot study.Anton Freund - 2021 - Journal of Symbolic Logic 86 (2):709-745.
Rekursion über Dilatoren und die Bachmann-Hierarchie.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (1):57-73.
Equalization of finite flowers.Stefano Berardi - 1988 - Journal of Symbolic Logic 53 (1):105-123.
Large cardinals and large dilators.Andy Lewis - 1998 - Journal of Symbolic Logic 63 (4):1496-1510.
Induktive Definitionen und Dilatoren.Wilfried Buchholz - 1988 - Archive for Mathematical Logic 27 (1):51-60.

View all 6 citations / Add more citations

References found in this work

[product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.
The problem of predicativity.Joseph R. Shoenfield - 1961 - In Bar-Hillel, Yehoshua & [From Old Catalog] (eds.), Essays on the Foundations of Mathematics. Jerusalem,: Magnes Press. pp. 132--139.
Hyperanalytic Predicates.Yiannis N. Moschovakis & Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (1):147-148.
Recursive Functionals and Quantifiers of Finite Types I.A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.

Add more references