Russell Miller Orbits of computably enumerable sets: low sets can avoid an upper cone. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2002, v:118, n:1-2, pp:61-85 [Journal]
Neil Thapen A model-theoretic characterization of the weak pigeonhold principle. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2002, v:118, n:1-2, pp:175-195 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP