Implicit Definability of Algebraic Structures by Means of Program Properties¹

Article type: Research Article

Authors: Bergstra, Jan^a | Tiuryn, Jerzy^b

Affiliations: [a] Rijksuniversiteit Leiden | [b] Warsaw University

Note: [1] This paper has been written while the author was on leave at Lehrstuhl für Informatik II, R.W.T.H. Aachen.

Abstract: 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.

Keywords: Logic of programs, computation in abstract structures, algorithmic properties, abstract data types

DOI: 10.3233/FI-1981-4309

Journal: Fundamenta Informaticae, vol. 4, no. 3, pp. 661-674, 1981