default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Control, Volume 54
Volume 54, Number 1-2, 1982
- Martin Davis, Carl Smith, Paul Young:
Introduction. 1 - Martin Davis:
Why Gödel Didn't Have Church's Thesis. 3-24 - Howard A. Blair:
The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language. 25-47 - Kenneth L. Manders, Robert R. Daley:
The Complexity of the Validity Problem for Dynamic Logic. 48-69 - J. W. de Bakker, Jeffery I. Zucker:
Processes and the Denotational Semantics of Concurrency. 70-120 - Robert S. Streett:
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable. 121-141
Volume 54, Number 3, 1982
- Stathis Zachos:
Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations. 143-154 - Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl:
Using String Languages to Describe Picture Languages. 155-185 - Jan A. Bergstra, John V. Tucker:
The Completeness of the Algebraic Specification Methods for Computable Data Types. 186-200 - Simona Ronchi Della Rocca:
Characterization Theorems for a Filter Lambda Model. 201-216 - Pavol Duris, Zvi Galil:
On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store. 217-227
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-20 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
