Nontrivial definability by flow-chart programs
Open Access
- 30 September 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 58 (1-3) , 59-87
- https://doi.org/10.1016/s0019-9958(83)80057-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Deterministic dynamic logic is strictly weaker than dynamic logicInformation and Control, 1983
- A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programsInformation and Control, 1983
- Definability by programs in first-order structuresTheoretical Computer Science, 1983
- The unwind property in certain algebrasInformation and Control, 1981
- A difference in expressive power between flowcharts and recursion schemesTheory of Computing Systems, 1978
- Translatability of schemas over restricted interpretationsJournal of Computer and System Sciences, 1974