3 papers
math.LO2026
Conjunctive reducibilities and completeness
Irakli Chitaia, Keng Meng Ng, Roland Omanadze +1
In this article we study the notion of completeness for conjunctive reducibilities. We investigate the relationship between -completeness and -completeness of computably enum…
math.LO2026
Intuitionism and computing with partial information
Hristo Ganchev, Paul Shafer, Theodore A. Slaman +2
There exist initial segments of both the Dyment lattice and the Dyment-Muchnik lattice that yield Brouwer algebras modeling exactly the intuitionistic propositional calculus. For t…
math.LO2024
The singleton degrees of the sets are not dense
Thomas F. Kent, Keng Meng Ng, Andrea Sorbi
Answering an open question raised by Cooper, we show that there exist sets and such that the singleton degree of is a minimal cover of the singleton degree of…