Computer science logic. 6th workshop, CSL '92, San Miniato, Italy, September 28 -- October 2, 1992. Selected papers (Q1309674)

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 0772.68004]. Indexed articles: \textit{Aanderaa, Stål O.}, A universal Turing machine, 1-4 [Zbl 0796.68088] \textit{Aanderaa, Stål O.; Jervell, Herman Ruge}, Recursive inseparability in linear logic, 5-13 [Zbl 0788.68042] \textit{Artëmov, Sergej; Straßen, Tyko}, The basic logic of proofs, 14-28 [Zbl 0802.03012] \textit{Baaz, Matthias; Zach, Richard}, Algorithmic structuring of cut-free proofs, 29-42 [Zbl 0794.03076] \textit{Behrendt, Thomas; Compton, Kevin; Grädel, Erich}, Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions, 43-60 [Zbl 0844.68057] \textit{Benton, Nick; Bierman, Gavin; de Paiva, Valeria; Hyland, Martin}, Linear \(\lambda\)-calculus and categorical models revisited, 61-84 [Zbl 0840.03003] \textit{Berarducci, Alessandro; Böhm, Corrado}, A self-interpreter of lambda calculus having a normal form, 85-99 [Zbl 0796.03023] \textit{Bosse, Uwe}, An ``Ehrenfeucht-Fraïssé game'' for fixpoint logic and stratified fixpoint logic, 100-114 [Zbl 0808.03024] \textit{Creignou, Nadia}, The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness, 115-133 [Zbl 0793.68076] \textit{Fermüller, Christian G.; Leitsch, Alexander}, Model building by resolution, 134-148 [Zbl 0788.68128] \textit{Fernando, Tim}, Comparative transition system semantics, 149-166 [Zbl 0788.68089] \textit{Gavilanes-Franco, A.; Lucio-Carrasco, F.; Rodríguez-Artalejo, Mario}, Reasoning with higher order partial functions, 167-181 [Zbl 0840.03023] \textit{Glavan, Paola; Rosenzweig, Dean}, Communicating evolving algebras, 182-215 [Zbl 0788.68047] \textit{González-Moreno, Juan Carlos; Hortalá-González, María Teresa; Rodríguez-Artalejo, Mario}, On the completeness of narrowing as the operational semantics of functional logic programming, 216-230 [Zbl 0797.68103] \textit{Grädel, Erich; Otto, Martin}, Inductive definability with counting on finite structures, 231-247 [Zbl 0792.68061] \textit{Grandjean, Etienne}, Linear time algorithms and NP-complete problems, 248-273 [Zbl 0788.68059] \textit{Gurevich, Yuri; Huggins, James K.}, The semantics of the C programming language, 274-308 [Zbl 0788.68018] \textit{Honsell, Furio; Mason, Ian A.; Smith, Scott; Talcott, Carolyn}, A theory of classes for a functional language with effects, 309-326 [Zbl 0835.68013] \textit{Lautemann, Clemens}, Logical definability of NP-optimisation problems with monadic auxiliary predicates, 327-339 [Zbl 0788.68063] \textit{Marzetta, Markus}, Universes in the theories of types and names, 340-351 [Zbl 0794.03083] \textit{Mitchell, John C.; Scedrov, Andre}, Notes on sconing and relators, 352-378 [Zbl 0795.03100] \textit{Schiermeyer, Ingo}, Solving 3-satisfiability in less than \(1,579^ n\) steps, 379-394 [Zbl 0788.68066] \textit{Smith, Jan M.}, Kleene's slash and existence of values of open terms in type theory, 395-402 [Zbl 0795.68027] \textit{Stärk, Robert F.}, Negation-complete logic programs, 403-409 [Zbl 0788.68027] \textit{Stewart, Iain A.}, Logical characterization of bounded query classes. II: Polynomial-time oracle machines, 410-424 [Zbl 0789.68059] \textit{Tyszkiewicz, Jerzy}, On asymptotic probabilities of monadic second order properties, 425-439 [Zbl 0788.68045]