Implicit definability of algebraic structures by means of program properties.
Jan Aldert Bergstra, Jerzy Tiuryn · Utrecht University Repository (Utrecht University) · 1979
The following problem is investigated in the paper: what structures can be uniquely defined, by algorithmic properties? The algorithmic propertifa 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.