Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Let J (M2 ) denote the -ideal associated with two-dimensional Miller forcing. We show that it is relatively consistent with ZFC that the additivity of J (M2 ) is bigger than the c...
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
Ganesh Baliga, John Case, Sanjay Jain, Mandayam Su...
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Owari is an old African game that consists of cyclically ordered pits that are filled with pebbles. In a sowing move all the pebbles are taken out of one pit and distributed one b...