z-logo
Premium
r ‐Maximal sets and Q 1 , N ‐reducibility
Author(s) -
Omanadze Roland Sh.,
Chitaia Irakli O.
Publication year - 2021
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.201900087
Subject(s) - mathematics , maximal set , combinatorics , set (abstract data type) , discrete mathematics , computer science , programming language
We show that if M is an r ‐maximal set, A is a major subset of M , B is an arbitrary set and M ∖ A ≡ Q 1 , NB , then M ∖ A ≤ m B . We prove that the c.e. Q 1 , N ‐degrees are not dense. We also show that there exist infinite collections of Q 1 , N ‐degrees{ a i } i ∈ ωand{ b j } j ∈ ωsuch that the following hold: (i) for every i , j ,a i < Q 1 , Na i + 1,b j + 1< Q 1 , Nb janda i < Q 1 , Nb j , (ii) each a i consists entirely of r ‐maximal sets, and (iii) each b j consists entirely of non‐ r ‐maximal hyperhypersimple sets.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom