- 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
Hyperhypersimple sets and Q1 -reducibility
Mathematical Logic Quarterly 62 (6):590-595 (2016)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
r‐Maximal sets and Q1,N‐reducibility.Roland Sh Omanadze & Irakli O. Chitaia - 2021 - Mathematical Logic Quarterly 67 (2):138-148.
Q1-degrees of c.e. sets.R. Sh Omanadze & Irakli O. Chitaia - 2012 - Archive for Mathematical Logic 51 (5-6):503-515.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
On Pseudo‐Creative Sets, Splinters, and Bounded‐Truth‐Table Reducibility.Paul R. Young - 1967 - Mathematical Logic Quarterly 13 (1-2):25-31.
Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
On Constructively Non‐Morphisms of Enumerated Sets and Constructive Non‐Reducibility of Enumerations.Andrzej Orlicki - 1987 - Mathematical Logic Quarterly 33 (6):485-496.
Bounds in the Turing reducibility of functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
Some Notions of Reducibility and Productiveness.A. H. Lachlan - 1965 - Mathematical Logic Quarterly 11 (1):17-44.
A theorem on hyperhypersimple sets.Donald A. Martin - 1963 - Journal of Symbolic Logic 28 (4):273-278.
Analytics
Added to PP
2017-03-26
Downloads
23 (#928,616)
6 months
5 (#1,015,253)
2017-03-26
Downloads
23 (#928,616)
6 months
5 (#1,015,253)
Historical graph of downloads
Citations of this work
Degree structures of conjunctive reducibility.Irakli Chitaia & Roland Omanadze - 2021 - Archive for Mathematical Logic 61 (1):19-31.
Non-empty open intervals of computably enumerable sQ 1-degrees.Roland Omanadze & Irakli Chitaia - forthcoming - Logic Journal of the IGPL.
r‐Maximal sets and Q1,N‐reducibility.Roland Sh Omanadze & Irakli O. Chitaia - 2021 - Mathematical Logic Quarterly 67 (2):138-148.
$$sQ_1$$ -degrees of computably enumerable sets.Roland Sh Omanadze - 2023 - Archive for Mathematical Logic 62 (3):401-417.
Agreement reducibility.Rachel Epstein & Karen Lange - 2020 - Mathematical Logic Quarterly 66 (4):448-465.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Q1-degrees of c.e. sets.R. Sh Omanadze & Irakli O. Chitaia - 2012 - Archive for Mathematical Logic 51 (5-6):503-515.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
On subcreative sets and S-reducibility.John T. Gill & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669-677.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
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-f8568656d-4qrhw uwo