- 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
Non‐Complementedness and Non‐Distributivity of Kleene Degrees
Mathematical Logic Quarterly 43 (3):378-388 (1997)
Abstract
In this note, we study the complementedness and the distributivity of upper semilattices of Kleene degrees assuming V = L. K denotes the upper semilattice of all Kleene degrees. We prove that if V = L, then some sub upper semilattices of K are non-complemented and some are non-distributiveOther Versions
No versions found
My notes
Similar books and articles
Non-Distributive Upper Semilattice of Kleene Degrees.Hisato Muraki - 1999 - Journal of Symbolic Logic 64 (1):147-158.
Embedding jump upper semilattices into the Turing degrees.Antonio Montalbán - 2003 - Journal of Symbolic Logic 68 (3):989-1014.
The upper semilattice of degrees ≤ 0' is complemented.David B. Posner - 1981 - Journal of Symbolic Logic 46 (4):705 - 713.
Rogers semilattices of limitwise monotonic numberings.Nikolay Bazhenov, Manat Mustafa & Zhansaya Tleuliyeva - 2022 - Mathematical Logic Quarterly 68 (2):213-226.
On the $\Sigma_2$-Theory of the Upper Semilattice of Turing Degrees.Carl G. Jockusch & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (1):193-204.
Kleene S. C. and Post Emil L.. The upper semi-lattice of degrees of recursive unsolvability. Annals of mathematics, ser. 2 vol. 59 , pp. 379–407. [REVIEW]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
Definability of the jump operator in the enumeration degrees.I. Sh Kalimullin - 2003 - Journal of Mathematical Logic 3 (02):257-267.
Elementary theories and hereditary undecidability for semilattices of numberings.Nikolay Bazhenov, Manat Mustafa & Mars Yamaleev - 2019 - Archive for Mathematical Logic 58 (3-4):485-500.
Analytics
Added to PP
2013-12-01
Downloads
22 (#959,492)
6 months
5 (#1,013,271)
2013-12-01
Downloads
22 (#959,492)
6 months
5 (#1,013,271)
Historical graph of downloads
References found in this work
On the Complexity of Analytic Sets.Karel Hrbacek - 1978 - Mathematical Logic Quarterly 24 (25‐30):419-425.
On the Complexity of Analytic Sets.Karel Hrbacek - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):419-425.
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-667477cd97-jhg8z dc2