Conferences in DBLP
Stål Aanderaa A Universal Turing Machine. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:1-4 [Conf ] Stål Aanderaa , Herman Ruge Jervell Recursive Inseparability in Linear Logic. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:5-13 [Conf ] Sergei N. Artëmov , Tyko Straßen The Basic Logic of Proofs. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:14-28 [Conf ] Matthias Baaz , Richard Zach Algorithmic Structuring of Cut-free Proofs. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:29-42 [Conf ] Thomas Behrendt , Kevin J. Compton , Erich Grädel Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:43-60 [Conf ] P. N. Benton , Gavin M. Bierman , Valeria de Paiva , Martin Hyland Linear Lambda-Calculus and Categorial Models Revisited. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:61-84 [Conf ] Alessandro Berarducci , Corrado Böhm A Self-Interpreter of Lambda Calculus Having a Normal Form. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:85-99 [Conf ] Uwe Bosse An "Ehrenfeucht-Fraïssé Game" for Fixpoint Logic and Stratified Fixpoint Logic. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:100-114 [Conf ] Nadia Creignou The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:115-133 [Conf ] Christian G. Fermüller , Alexander Leitsch Model Building by Resolution. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:134-148 [Conf ] Tim Fernando Comparative Transition System Semantics. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:149-166 [Conf ] Antonio Gavilanes-Franco , Francisca Lucio-Carrasco , Mario Rodríguez-Artalejo Reasoning with Higher Order Partial Functions. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:167-181 [Conf ] Paola Glavan , Dean Rosenzweig Communicating Evolving Algebras. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:182-215 [Conf ] J. C. González-Moreno , Maria Teresa Hortalá-González , Mario Rodríguez-Artalejo On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:216-230 [Conf ] Erich Grädel , Martin Otto Inductive Definability with Counting on Finite Structures. [Citation Graph (5, 0)][DBLP ] CSL, 1992, pp:231-247 [Conf ] Etienne Grandjean Linear Time Algorithms and NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:248-273 [Conf ] Yuri Gurevich , James K. Huggins The Semantics of the C Programming Language. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:274-308 [Conf ] Furio Honsell , Ian A. Mason , Scott F. Smith , Carolyn L. Talcott A Theory of Classes for a Functional Language with Effects. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:309-326 [Conf ] Clemens Lautemann Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:327-339 [Conf ] Markus Marzetta Universes in the Theory of Types and Names. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:340-351 [Conf ] John C. Mitchell , Andre Scedrov Notes on Sconing and Relators. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:352-378 [Conf ] Ingo Schiermeyer Solving 3-Satisfiability in Less Then 1, 579^{n} Steps. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:379-394 [Conf ] Jan M. Smith Kleene's Slash and Existence of Values of Open Terms in Type Theory. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:395-402 [Conf ] Robert F. Stärk Negation-Complete Logic Programs. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:403-409 [Conf ] Iain A. Stewart Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:410-424 [Conf ] Jerzy Tyszkiewicz On Asymptotic Probabilities of Monadic Second Order Properties. [Citation Graph (0, 0)][DBLP ] CSL, 1992, pp:425-439 [Conf ]