default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd CSL 1989: Kaiserslautern, Germany
- Egon Börger, Hans Kleine Büning, Michael M. Richter:
CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings. Lecture Notes in Computer Science 440, Springer 1990, ISBN 3-540-52753-2 - Klaus Ambos-Spies, Dongping Yang:
Honest Polynomial-Time Degrees of Elementary Recursive Sets. 1-15 - Grigoris Antoniou, Volker Sperschneider:
On the Verification of Modules. 16-35 - Egon Börger:
A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control. 36-64 - Domenico Cantone, Vincenzo Cutello
, Alberto Policriti:
Set-Theoretic Reductions of Hilbert's Tenth Problem. 65-75 - Elias Dahlhaus:
The Complexity of Subtheories of the Existential Linear Theory of Reals. 76-89 - Bernd I. Dahn:
On Test Classes for Universal Theories. 90-97 - Hendrik Decker, Lawrence Cavedon:
Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution. 98-115 - Manfred Droste, Rüdiger Göbel:
Effectively Given Information Systems and Domains. 116-142 - Andreas Goerdt:
Davis-Putnam Resolution versus Unrestricted Resolution. 143-162 - Erich Grädel:
On Logical Descriptions of Some Concepts in Structural Complexity Theory. 163-175 - Yuri Gurevich, Lawrence S. Moss:
Algebraic Operational Semantics and Occam. 176-192 - Jan Krajícek, Pavel Pudlák:
Propositional Provability and Models of Weak Arithmetic. 193-210 - Hans Leiß:
Polymorphic Recursion and Semi-Unification. 211-224 - Alexander Leitsch:
Deciding Horn Classes by Hyperresolution. 225-241 - Christoph Meinel:
Omega-Branching Programs of Bounded Width. 242-253 - Daniel Mey:
A Predicate Calculus with Control of Derivations. 254-266 - Daniele Mundici:
Reducibility of Monotone Formulas to µ-Formulas. 267-270 - Hans Jürgen Ohlbach:
New Ways for Developing Proof Theories for First-Order Multi Modal Logics. 271-308 - Michel Parigot:
On the Representation of Data in Lambda-Calculus. 309-321 - Ana Pasztor, Ildikó Sain:
A Streamlined Temporal Completeness Theorem. 322-336 - Wojciech Penczek:
A Concurrent Branching Time Temporal Logic. 337-354 - Lutz Priese, Doris Nolte:
Semantic for Abstract Fairness using Metric Spaces. 355-368 - Ewald Speckenmeyer, Rainer Kemp:
On the Average Time Complexity of Set Partitioning. 369-381 - Robert F. Stärk:
A Direct Proof for the Completeness of SLD-Resolution. 382-383 - Robert F. Stärk:
A Quantifier-Free Completion of Logic Programs. 384-395 - Olga Stepánková, Petr Stepánek:
Stratification of Definite Clause Programs and of General Logic Programs. 396-408 - Hugo Volger:
The Semantics of Disjunctive Deductive Databases. 409-421 - Elisabeth Wette:
Sequential Representation of Primitive Recursive Functions, and Complexity Classes. 422-437
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-11-09 22:53 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:
