Some properties of r-maximal sets and Q 1,N -reducibility

Archive for Mathematical Logic 54 (7-8):941-959 (2015)
  Copy   BIBTEX

Abstract

We show that the c.e. Q1,N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Q_{1,N}}$$\end{document}-degrees are not an upper semilattice. We prove that if M is an r-maximal set, A is an arbitrary set and M≡Q1,NA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M \equiv{}_ {Q_{1,N}}A}$$\end{document}, then M≤mA\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M\leq{}_{m} A}$$\end{document}. Also, if M1 and M2 are r-maximal sets, A and B are major subsets of M1 and M2, respectively, and M1\A≡Q1,NM2\B\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_{1}{\setminus} A\equiv{}_{Q_{1,N}}M_{2}{\setminus} B}$$\end{document}, then M1\A≡mM2\B\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_{1}{\setminus}A\equiv{}_{m}M_{2}{\setminus} B}$$\end{document}. If M1 and M2 are r-maximal sets and M10,M11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_{1}^{0},\,M_{1}^{1}}$$\end{document} and M20,M21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_{2}^{0},\,M_{2}^{1}}$$\end{document} are nontrivial splittings of M1 and M2, respectively, then M10≡Q1,NM20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_{1}^{0} \equiv{}_{Q_{1,N}}M_{2}^{0}}$$\end{document} if and only if M10≡1M20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_{1}^{0} \equiv{}_{1}M_{2}^{0}}$$\end{document}. From this result follows that if A and B are Friedberg splitting of an r-maximal set, then the Q1,N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Q_{1,N}}$$\end{document}-degree of A contains only one c.e. 1-degree.

Other Versions

No versions found

Links

PhilArchive

External links

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

Through your library

Similar books and articles

Minimal elementary end extensions.James H. Schmerl - 2017 - Archive for Mathematical Logic 56 (5-6):541-553.
Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour, Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.

Analytics

Added to PP
2016-02-04

Downloads
92 (#581,437)

6 months
52 (#165,952)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

$$sQ_1$$ -degrees of computably enumerable sets.Roland Sh Omanadze - 2023 - Archive for Mathematical Logic 62 (3):401-417.
r‐Maximal sets and Q1,N‐reducibility.Roland Sh Omanadze & Irakli O. Chitaia - 2021 - Mathematical Logic Quarterly 67 (2):138-148.

Add more citations

References found in this work

Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Q1-degrees of c.e. sets.R. Sh Omanadze & Irakli O. Chitaia - 2012 - Archive for Mathematical Logic 51 (5-6):503-515.
Some Properties of Recursively Inseparable Sets.J. P. Cleave - 1970 - Mathematical Logic Quarterly 16 (2):187-200.

Add more references