Volume 56,
Numbers 1-3,
29 April 1992
Special Volume dedicated to the memory of John Myhill
- Biography. 1-3
- Bibliography. 3-6
- John C. Shepherdson:
Mints Type Deductive Calculi for Logic Programming.
7-17 BibTeX
- G. Kreisel:
On the Idea(l) of Logical Closure.
19-41 BibTeX
- J. C. E. Dekker, Erik Ellentuck:
Myhill's Work in Recursion Theory.
43-71 BibTeX
- Peter Clote, Gaisi Takeuti:
Bounded Arithmetic for NC, ALogTIME, L and NL.
73-117 BibTeX
- V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
How Complicated is the Set of Stable Models of a Recursive Logic Program?
119-135 BibTeX
- Thomas G. McLaughlin:
Eight Problems about Nerode Semirings (Recursive Ultrapowers).
137-146 BibTeX
- John N. Crossley, Jeffrey B. Remmel:
Cancellation Laws for Polynomial-Time p-Isolated Sets.
147-172 BibTeX
- Leon Harkleroad:
Polynomial-Time Analogues of Isolatedness.
173-182 BibTeX
- Andreas Blass:
A Game Semantics for Linear Logic.
183-220 BibTeX
- Rodney G. Downey, Theodore A. Slaman:
On co-Simple Isols and Their Intersection Types.
221-237 BibTeX
- Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar:
Decision Problems for Propositional Linear Logic.
239-311 BibTeX
- Douglas A. Cenzer, Jeffrey B. Remmel:
Polynomial-Time Abelian Groups.
313-363 BibTeX
Copyright © Sat May 16 23:50:41 2009
by Michael Ley (ley@uni-trier.de)
