1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.LO2022
Conservation theorems for the Cohesiveness Principle
David R. Belanger
We prove that the Cohesiveness Principle (COH) is conservative over and over for all by recursion-theoretic means. We first cha…
cs.LO2020
Learnability and Positive Equivalence Relations
David Belanger, Ziyuan Gao, Sanjay Jain +2
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence…
math.LO2019★ 1 cited
Where Pigeonhole Principles meet König Lemmas
David Belanger, Chitat Chong, Wei Wang +2
We study the pigeonhole principle for -definable injections with domain twice as large as the codomain, and the weak König lemma for -definable trees in which every lev…