11 pages Incompleteness of Behavioral Logics
Download:
|
|
by Samuel Buss, Grigore Rosu
http://www-cse.ucsd.edu/~grosu/ps/incomp.ps
Add To MetaCart
Abstract:
Incompleteness results for various behavioral logics are investigated. We show that hidden algebra, observational logic, coherent hidden algebra and other current generalizations of hidden algebra do not admit complete deduction systems for equational behavioral satisfaction. The technique used is reduction from a nonrecursively enumerable problem to behavioral validity. In fact we show a stronger result, that behavioral logics are \Pi 0
Citations
| 85 | Types as theories, in – Goguen - 1991 |
| 43 | Behavioural coherence in object-oriented algebraic specification – Diaconescu, Futatsugi |
| 39 | Observer complete definitions are behaviourally coherent – Bidoit, Hennicker - 1999 |
| 19 | Coalgebra semantics for hidden algebra: parameterized objects and inheritance – Cirstea - 1998 |
| 17 | A complete calculus for equational deduction in coalgebraic specification – Corradini - 1997 |
| 9 | A coequational approach to specifying behaviours – Cirstea - 1999 |
