- 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
Universal recursion theoretic properties of R.e. Preordered structures
Journal of Symbolic Logic 50 (2):397-406 (1985)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Creativeness and completeness in recursion categories of partial recursive operators.Franco Montagna & Andrea Sorbi - 1989 - Journal of Symbolic Logic 54 (3):1023-1041.
Some independence results for control structures in complete numberings.Sanjay Jain & Jochen Nessel - 2001 - Journal of Symbolic Logic 66 (1):357-382.
Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of peano arithmetic.Robert A. di Paola & Franco Montagna - 1991 - Journal of Symbolic Logic 56 (2):643-660.
Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of peano arithmetic.Robert A. Di Paola & Franco Montagna - 1991 - Journal of Symbolic Logic 56 (2):643 - 660.
Quantum hypercomputation—hype or computation?Amit Hagar & Alex Korolev - 2007 - Philosophy of Science 74 (3):347-363.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Definability of R. E. sets in a class of recursion theoretic structures.Robert E. Byerly - 1983 - Journal of Symbolic Logic 48 (3):662-669.
Analytics
Added to PP
2009-01-28
Downloads
33 (#470,805)
6 months
4 (#818,853)
2009-01-28
Downloads
33 (#470,805)
6 months
4 (#818,853)
Historical graph of downloads
Citations of this work
Classifying equivalence relations in the Ershov hierarchy.Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi & Mars Yamaleev - 2020 - Archive for Mathematical Logic 59 (7-8):835-864.
Uniform Density in Lindenbaum Algebras.V. Yu Shavrukov & Albert Visser - 2014 - Notre Dame Journal of Formal Logic 55 (4):569-582.
Word problems and ceers.Valentino Delle Rose, Luca San Mauro & Andrea Sorbi - 2020 - Mathematical Logic Quarterly 66 (3):341-354.
Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
Isomorphisms of splits of computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2003 - Journal of Symbolic Logic 68 (3):1044-1064.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
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-7c76586df8-4c2ch uwo