default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 56
Volume 56, Numbers 1-3, 29 April 1992
- Biography. Ann. Pure Appl. Log. 56(1-3): 1-3 (1992)
- Bibliography. Ann. Pure Appl. Log. 56(1-3): 3-6 (1992)
- John C. Shepherdson:
Mints Type Deductive Calculi for Logic Programming. 7-17 - Georg Kreisel:
On the Idea(l) of Logical Closure. 19-41 - J. C. E. Dekker, Erik Ellentuck:
Myhill's Work in Recursion Theory. 43-71 - Peter Clote, Gaisi Takeuti:
Bounded Arithmetic for NC, ALogTIME, L and NL. 73-117 - V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
How Complicated is the Set of Stable Models of a Recursive Logic Program? 119-135 - Thomas G. McLaughlin:
Eight Problems about Nerode Semirings (Recursive Ultrapowers). 137-146 - John N. Crossley, Jeffrey B. Remmel:
Cancellation Laws for Polynomial-Time p-Isolated Sets. 147-172 - Leon Harkleroad:
Polynomial-Time Analogues of Isolatedness. 173-182 - Andreas Blass:
A Game Semantics for Linear Logic. 183-220 - Rodney G. Downey, Theodore A. Slaman:
On co-Simple Isols and Their Intersection Types. 221-237 - Patrick Lincoln, John C. Mitchell, Andre Scedrov
, Natarajan Shankar:
Decision Problems for Propositional Linear Logic. 239-311 - Douglas A. Cenzer, Jeffrey B. Remmel:
Polynomial-Time Abelian Groups. 313-363
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 2024-11-22 19:45 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:
