On a conjecture of Bergstra and Tucker

AbstractBergstra and Tucker (1983) conjectured that a semicomputable (abstract) data type has a finite hidden enrichment specification under its initial algebra semantics. In a previous paper (1987) we tried to solve the entire conjecture and we found a weak solution. Here, following the line and the proof techniques of the previous paper, we examine a nontrivial case in which the conjecture has a positive answer