7 citations · 19 across the 14 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
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…