Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter
Proceedings of the Sixth Workshop on Computer Science Logic
CSL, 1992.

@proceedings{CSL-1992,
	address       = "San Miniato, Italy",
	editor        = "Egon Börger and Gerhard Jäger and Hans Kleine Büning and Simone Martini and Michael M. Richter",
	isbn          = "3-540-56992-8",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Sixth Workshop on Computer Science Logic}",
	volume        = 702,
	year          = 1992,
}

Contents (26 items)

5 ×#logic
4 ×#linear
4 ×#problem
3 ×#proving
3 ×#semantics
2 ×#algorithm
2 ×#formal method
2 ×#functional
2 ×#higher-order
2 ×#logic programming

CSL-1992-Aanderaa #turing machine

A Universal Turing Machine (SA), pp. 1–4.

CSL-1992-AanderaaJ #linear #logic #recursion

Recursive Inseparability in Linear Logic (SA, HRJ), pp. 5–13.

CSL-1992-ArtemovS #logic #proving

The Basic Logic of Proofs (SNA, TS), pp. 14–28.

CSL-1992-BaazZ #algorithm #proving

Algorithmic Structuring of Cut-free Proofs (MB, RZ), pp. 29–42.

CSL-1992-BehrendtCG #approximate #optimisation #problem

Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions (TB, KJC, EG), pp. 43–60.

CSL-1992-BentonBPH #linear #modelling #revisited #λ-calculus

Linear λ-Calculus and Categorial Models Revisited (PNB, GMB, VdP, MH), pp. 61–84.

CSL-1992-BerarducciB #normalisation #self #λ-calculus

A Self-Interpreter of λ Calculus Having a Normal Form (AB, CB), pp. 85–99.

CSL-1992-Bosse #fixpoint #game studies #logic

An “Ehrenfeucht-Fraïssé Game” for Fixpoint Logic and Stratified Fixpoint Logic (UB), pp. 100–114.

CSL-1992-Creignou #linear #problem #proving #satisfiability

The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness (NC), pp. 115–133.

CSL-1992-FernmullerL

Model Building by Resolution (CGF, AL), pp. 134–148.

CSL-1992-Fernando #comparative #semantics

Comparative Transition System Semantics (TF), pp. 149–166.

CSL-1992-Gavilanes-FrancoLR #higher-order #reasoning

Reasoning with Higher Order Partial Functions (AGF, FLC, MRA), pp. 167–181.

CSL-1992-GlavanR #algebra #communication #evolution

Communicating Evolving Algebras (PG, DR), pp. 182–215.

CSL-1992-Gonzalez-MorenoHR #functional #logic programming #on the #semantics

On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming (JCGM, MTHG, MRA), pp. 216–230.

CSL-1992-GradelO #finite #induction

Inductive Definability with Counting on Finite Structures (EG, MO), pp. 231–247.

CSL-1992-Grandjean #algorithm #linear #problem

Linear Time Algorithms and NP-Complete Problems (EG), pp. 248–273.

CSL-1992-GurevichH #c #programming language #semantics

The Semantics of the C Programming Language (YG, JKH), pp. 274–308.

CSL-1992-HonsellMST #formal method #functional

A Theory of Classes for a Functional Language with Effects (FH, IAM, SFS, CLT), pp. 309–326.

CSL-1992-Lautemann #logic #monad #problem

Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates (CL), pp. 327–339.

CSL-1992-Marzetta #formal method

Universes in the Theory of Types and Names (MM), pp. 340–351.

CSL-1992-MitchellS

Notes on Sconing and Relators (JCM, AS), pp. 352–378.

CSL-1992-Schiermeyer #satisfiability

Solving 3-Satisfiability in Less Then 1, 579n Steps (IS), pp. 379–394.

CSL-1992-Smith #type system

Kleene’s Slash and Existence of Values of Open Terms in Type Theory (JMS), pp. 395–402.

CSL-1992-Stark #logic programming #source code

Negation-Complete Logic Programs (RFS), pp. 403–409.

CSL-1992-Stewart #bound #logic #polynomial #query

Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines (IAS), pp. 410–424.

CSL-1992-Tyszkiewicz #higher-order #monad #on the

On Asymptotic Probabilities of Monadic Second Order Properties (JT), pp. 425–439.