Implicit definability of algebraic structures by means of program properties
Publication date
1981
Authors
Bergstra, J.A.
Tiuryn, J.
Editors
Advisors
Supervisors
DOI
Document Type
Article
Metadata
Show full item recordCollections
License
Abstract
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.
Keywords
Logic of programs, computation in abstract structures, algorithmic properties, abstract data types