Egon Börger, Hans Kleine Büning, Michael M. Richter
Proceedings of the Third Workshop on Computer Science Logic
CSL, 1989.

@proceedings{CSL-1989,
	address       = "Kaiserslautern, Germany",
	editor        = "Egon Börger and Hans Kleine Büning and Michael M. Richter",
	isbn          = "3-540-52753-2",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Third Workshop on Computer Science Logic}",
	volume        = 440,
	year          = 1989,
}

Contents (28 items)

5 ×#on the
4 ×#complexity
4 ×#logic
4 ×#semantics
3 ×#recursion
3 ×#source code
2 ×#logic programming
2 ×#proving
2 ×#representation
2 ×#set

CSL-1989-Ambos-SpiesY #polynomial #recursion #set

Honest Polynomial-Time Degrees of Elementary Recursive Sets (KAS, DY), pp. 1–15.

CSL-1989-AntoniouS #on the #verification

On the Verification of Modules (GA, VS), pp. 16–35.

CSL-1989-Borger #logic #prolog #semantics

A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control (EB), pp. 36–64.

CSL-1989-CantoneCP #problem #reduction

Set-Theoretic Reductions of Hilbert’s Tenth Problem (DC, VC, AP), pp. 65–75.

CSL-1989-Dahlhaus #complexity #linear

The Complexity of Subtheories of the Existential Linear Theory of Reals (ED), pp. 76–89.

CSL-1989-Dahn #on the

On Test Classes for Universal Theories (BID), pp. 90–97.

CSL-1989-DeckerC

Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution (HD, LC), pp. 98–115.

CSL-1989-DrosteG #effectiveness #information management

Effectively Given Information Systems and Domains (MD, RG), pp. 116–142.

CSL-1989-Goerdt #strict

Davis-Putnam Resolution versus Unrestricted Resolution (AG), pp. 143–162.

CSL-1989-Gradel #complexity #concept #logic #on the

On Logical Descriptions of Some Concepts in Structural Complexity Theory (EG), pp. 163–175.

CSL-1989-GurevichM #algebra #semantics

Algebraic Operational Semantics and Occam (YG, LSM), pp. 176–192.

CSL-1989-KrajicekP #modelling

Propositional Provability and Models of Weak Arithmetic (JK, PP), pp. 193–210.

CSL-1989-Leiss #polymorphism #recursion

Polymorphic Recursion and Semi-Unification (HL), pp. 211–224.

CSL-1989-Leitsch

Deciding Horn Classes by Hyperresolution (AL), pp. 225–241.

CSL-1989-Meinel #bound #source code

Ω-Branching Programs of Bounded Width (CM), pp. 242–253.

CSL-1989-Mey #calculus

A Predicate Calculus with Control of Derivations (DM), pp. 254–266.

CSL-1989-Mundici

Reducibility of Monotone Formulas to μ-Formulas (DM), pp. 267–270.

CSL-1989-Ohlbach #first-order #logic #multi #proving

New Ways for Developing Proof Theories for First-Order Multi Modal Logics (HJO), pp. 271–308.

CSL-1989-Parigot #on the #representation #λ-calculus

On the Representation of Data in λ-Calculus (MP), pp. 309–321.

CSL-1989-PasztorS #theorem

A Streamlined Temporal Completeness Theorem (AP, IS), pp. 322–336.

CSL-1989-Penczek #branch #concurrent #logic

A Concurrent Branching Time Temporal Logic (WP), pp. 337–354.

CSL-1989-PrieseN #metric #semantics #using

Semantic for Abstract Fairness using Metric Spaces (LP, DN), pp. 355–368.

CSL-1989-SpeckenmeyerK #clustering #complexity #on the #set

On the Average Time Complexity of Set Partitioning (ES, RK), pp. 369–381.

CSL-1989-Stark #proving

A Direct Proof for the Completeness of SLD-Resolution (RFS), pp. 382–383.

CSL-1989-Stark89a #logic programming #quantifier #source code

A Quantifier-Free Completion of Logic Programs (RFS), pp. 384–395.

CSL-1989-StepankovaS #logic programming #source code

Stratification of Definite Clause Programs and of General Logic Programs (OS, PS), pp. 396–408.

CSL-1989-Vogler #database #deduction #semantics

The Semantics of Disjunctive Deductive Databases (HV), pp. 409–421.

CSL-1989-Wette #complexity #recursion #representation

Sequential Representation of Primitive Recursive Functions, and Complexity Classes (EW), pp. 422–437.