- 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
Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles
Mathematical Logic Quarterly 42 (1):449-460 (1996)
Abstract
We refine the definition of II-computability of [12] so that oracles have a “consistent”, but natural, behaviour. We prove a Kleene Normal Form Theorem and closure of semi-recursive relations under ∃1. We also show that in this more inclusive computation theory Post's theorem in the arithmetical hierarchy still holdsMy notes
Similar books and articles
A restricted computation model on Scott domains and its partial primitive recursive functionals.Karl-Heinz Niggl - 1998 - Archive for Mathematical Logic 37 (7):443-481.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Complexity of the -query Tautologies in the Presence of a Generic Oracle.Toshio Suzuki - 2000 - Notre Dame Journal of Formal Logic 41 (2):142-151.
Parallel architectures and mental computation.Andrew Wells - 1993 - British Journal for the Philosophy of Science 44 (3):531-542.
Explaining computation without semantics: Keeping it simple.Nir Fresco - 2010 - Minds and Machines 20 (2):165-181.
In computation, parallel is nothing, physical everything.Selmer Bringsjord - 2001 - Minds and Machines 11 (1):95-99.
Quantum mechanics and computation.Bart D’Hooghe & Jaroslaw Pykacz - 2004 - Foundations of Science 9 (4):387-404.
Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality.Geir Waagbø - 1999 - Archive for Mathematical Logic 38 (1):19-60.
Determinacy and the sharp function on objects of type K.Derrick Albert Dubose - 1995 - Journal of Symbolic Logic 60 (4):1025-1053.
The Explanatory Role of Computation in Cognitive Science.Nir Fresco - 2012 - Minds and Machines 22 (4):353-380.
Analytics
Added to PP
2013-12-01
Downloads
51 (#1,160,976)
6 months
5 (#1,615,113)
2013-12-01
Downloads
51 (#1,160,976)
6 months
5 (#1,615,113)
Historical graph of downloads
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
General recursion theory: an axiomatic approach.Jens Erik Fenstad - 1980 - New York: Springer Verlag.
Peter G. Hinman. Recursion-theoretic hierarchies. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, and New York, 1978, XII + 480 pp. [REVIEW]Wayne Richter - 1983 - Journal of Symbolic Logic 48 (2):497-498.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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