Two impossibility theorems on behaviour specification of abstract data types (Q1323373)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two impossibility theorems on behaviour specification of abstract data types |
scientific article; zbMATH DE number 567330
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two impossibility theorems on behaviour specification of abstract data types |
scientific article; zbMATH DE number 567330 |
Statements
Two impossibility theorems on behaviour specification of abstract data types (English)
0 references
10 May 1994
0 references
Two kinds of finite specification of the behaviour of a counter data type are proved impossible. We consider the class of data types (many-sorted algebras) behaving like an encapsulated counter that can be observed only by a test for zero. It is shown that no nonempty subclass of this class can be finitely specified in ``observational first-order logic'', which is a variant of first-order logic in which equality may not be used on encapsulated types. Secondly, it is shown that the class cannot be described exactly by a finite specification in first-order logic.
0 references
behaviour specification
0 references
abstract data types
0 references
many-sorted algebras
0 references
counter data type
0 references
first-order logic
0 references
0 references
