- 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
Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets
Mathematical Logic Quarterly 35 (1):49-62 (1989)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Analytics
Added to PP
2013-11-03
Downloads
18 (#835,873)
6 months
8 (#367,748)
2013-11-03
Downloads
18 (#835,873)
6 months
8 (#367,748)
Historical graph of downloads
Author's Profile
Citations of this work
Effectiveness and Multivalued Logics.Giangiacomo Gerla - 2006 - Journal of Symbolic Logic 71 (1):137 - 162.
Fuzzy logic, continuity and effectiveness.Loredana Biacino & Giangiacomo Gerla - 2002 - Archive for Mathematical Logic 41 (7):643-667.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Turing L -machines and recursive computability for L -maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
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-5ff6c685cb-pqwqt uwo