Differences of Computably Enumerable Sets

Abstract

We consider the lower semilattice D of diierences of c.e. sets under inclusion. It is shown that D is not distributive as a semilattice, and that the c.e. sets form a deenable subclass. 
DOI: 10.1002/1521-3870(200010)46:4%3C555::AID-MALQ555%3E3.0.CO;2-2

Topics

  • Presentations referencing similar topics