Implicit Definability of Algebraic Structures by Means of Program Properties1
Jan Aldert Bergstra, Jerzy Tiuryn · Fundamenta Informaticae · 1981
The following problem is investigated in the paper: what structures can be uniquely defined by algorithmic properties? The algorithmic properties are represented in this paper as open formulae of the logic of effective definitions. This approach can be viewed as an alternative way of defining abstract data types.