- 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
Representation theorems for transfinite computability and definability
Archive for Mathematical Logic 41 (8):721-741 (2002)
Abstract
We show how Kreisel's representation theorem for sets in the analytical hierarchy can be generalized to sets defined by positive induction and use this to estimate the complexity of constructions in the theory of domains with totality.Author's Profile
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.
Total objects in inductively defined types.Lill Kristiansen & Dag Normann - 1997 - Archive for Mathematical Logic 36 (6):405-436.
Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality.Geir Waagbø - 1999 - Archive for Mathematical Logic 38 (1):19-60.
A transfinite hierarchy of reals.George Barmpalias - 2003 - Mathematical Logic Quarterly 49 (2):163-172.
Total sets and objects in domain theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.
Some applications of computable one-one numberings.Martin Kummer - 1990 - Archive for Mathematical Logic 30 (4):219-230.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Three Model-Theoretic Constructions for Generalized Epstein Semantics.Krzysztof A. Krawczyk - 2022 - Review of Symbolic Logic 15 (4):1023-1032.
Ordinal analyses for monotone and cofinal transfinite inductions.Kentaro Sato - 2020 - Archive for Mathematical Logic 59 (3-4):277-291.
Abstract complexity theory and the Δ20 degrees.Benjamin Schaeffer - 2002 - Annals of Pure and Applied Logic 115 (1-3):195-231.
Analytics
Added to PP
2013-11-23
Downloads
22 (#166,999)
6 months
6 (#1,472,471)
2013-11-23
Downloads
22 (#166,999)
6 months
6 (#1,472,471)
Historical graph of downloads
Author's Profile
Citations of this work
Total objects in inductively defined types.Lill Kristiansen & Dag Normann - 1997 - Archive for Mathematical Logic 36 (6):405-436.
References found in this work
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-6686886f5-7g5mb uwo