It is shown that any nonzero recursively enumerable degree can be expressed as the join of two distinct such degrees having a greatest lower bound. This monthly journal, begun in 1950, is devoted ...

A survey of the mathematical foundations of Computer Science. Finite automata and regular languages. Stack Acceptors and Context-Free Languages. Turing Machines, recursive and recursively enumerable ...