Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (1):49-62 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19890350107

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.
Decidability, partial decidability and sharpness relation for l-subsets.Giangiacomo Gerla - 1987 - Studia Logica 46 (3):227-238.
Sets without Subsets of Higher Many-One Degree.Patrizio Cintioli - 2005 - Notre Dame Journal of Formal Logic 46 (2):207-216.
Local Density of Kleene Degrees.Hisato Muraki - 1995 - Mathematical Logic Quarterly 41 (2):183-189.
Some effects of Ash–Nerode and other decidability conditions on degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 55 (1):51-65.
Approximate decidability in euclidean spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (1):34-56.
Review: Tosiyuki Tugue, On Predicates Expressible in the 1-Function Quantifier Forms in Kleene Hierarchy with Free Variables of Type 2; Tosiyuki Tugue, Predicates Recursive in a Type-2 Object and Kleene Hierarchies. [REVIEW]D. A. Clarke - 1968 - Journal of Symbolic Logic 33 (1):115-116.
A Decidability Theorem.Vitaly Filippovski - 2009 - Analytica 3:78-91.
Real numbers and functions in the Kleene hierarchy and limits of recursive, rational functions.N. Z. Shapiro - 1969 - Journal of Symbolic Logic 34 (2):207-214.
The discrete parts of approximately decidable sets in Euclidean spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (4):428.
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
Realizing Brouwer's sequences.Richard E. Vesley - 1996 - Annals of Pure and Applied Logic 81 (1-3):25-74.
Enumerability, Decidability, Computability. [REVIEW]J. M. P. - 1966 - Review of Metaphysics 19 (3):588-588.
Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.

Analytics

Added to PP
2015-12-02

Downloads
26 (#596,950)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Inferences in probability logic.Giangiacomo Gerla - 1994 - Artificial Intelligence 70 (1-2):33-52.
Effectiveness and Multivalued Logics.Giangiacomo Gerla - 2006 - Journal of Symbolic Logic 71 (1):137 - 162.

Add more citations

References found in this work

Add more references