- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Interpreting higher computations as types with totality
Archive for Mathematical Logic 33 (4):243-259 (1994)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Continuity, proof systems and the theory of transfinite computations.Dag Normann - 2002 - Archive for Mathematical Logic 41 (8):765-788.
Normann Dag. Recursion on the countable functionals. Lecture notes in mathematics, vol. 811. Springer-Verlag, Berlin, Heidelberg, and New York, 1980, VIII + 191 pp.Normann Dag. The continuous functionals; computations, recursions and degrees. Annals of mathematical logic, vol. 21 , pp. 1–26. [REVIEW]Peter G. Hinman - 1984 - Journal of Symbolic Logic 49 (2):668-670.
Total objects in inductively defined types.Lill Kristiansen & Dag Normann - 1997 - Archive for Mathematical Logic 36 (6):405-436.
Interpreting number theory in nilpotent groups.Wilfrid Hodges - 1980 - Archive for Mathematical Logic 20 (3-4):103-111.
Degrees of isomorphism types and countably categorical groups.Aleksander Ivanov - 2012 - Archive for Mathematical Logic 51 (1):93-98.
The role of the Omitting Types Theorem in infinitary logic.Jon Barwise - 1981 - Archive for Mathematical Logic 21 (1):55-68.
Dag Normann. Degrees of functionals. Annals of mathematical logic, vol. 16 , pp. 269–304.E. R. Griffor - 1983 - Journal of Symbolic Logic 48 (1):212-213.
Analytics
Added to PP
2013-11-23
Downloads
32 (#705,389)
6 months
4 (#1,247,093)
2013-11-23
Downloads
32 (#705,389)
6 months
4 (#1,247,093)
Historical graph of downloads
Author's Profile
Citations of this work
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
Equational theories for inductive types.Ralph Loader - 1997 - Annals of Pure and Applied Logic 84 (2):175-217.
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.
References found in this work
Total sets and objects in domain theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.
Total objects in inductively defined types.Lill Kristiansen & Dag Normann - 1997 - Archive for Mathematical Logic 36 (6):405-436.
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-559df78dcc-vpvvv uwo