CSL B

43 papers

YearTitle / Authors
2001A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem.
Matthias Galota, Heribert Vollmer
2001A Logic for Abstract State Machines.
Robert F. Stärk, Stanislas Nanchen
2001A Logic for Approximate First-Order Reasoning.
Frédéric Koriche
2001A Principle of Induction.
Keye Martin
2001Actual Arithmetic and Feasibility.
Jean-Yves Marion
2001An Abstract Look at Realizability.
Edmund Robinson, Giuseppe Rosolini
2001An Algebraic Foundation for Higraphs.
John Power, Konstantinos Tourlas
2001An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.
Olivier Finkel
2001An Existential Locality Theorem.
Martin Grohe, Stefan Wöhrle
2001An Improved Extensionality Criterion for Higher-Order Logic Programs.
Marc Bezem
2001Applications of Alfred Tarski's Ideas in Database Theory.
Jan Van den Bussche
2001Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.
Hitoshi Ohsaki
2001Capture Complexity by Partition.
Yijia Chen, Enshao Shen
2001Categorical and Kripke Semantics for Constructive S4 Modal Logic.
Natasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter
2001Complete Categorical Equational Deduction.
Grigore Rosu
2001Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings
Laurent Fribourg
2001Constrained Hyper Tableaux.
Jan van Eijck
2001Decidable Navigation Logics for Object Structures.
Frank S. de Boer, Rogier M. van Eijk
2001Decision Procedure for an Extension of WS1S.
Felix Klaedtke
2001Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus.
Samson Abramsky, Marina Lenisa
2001Inflationary Fixed Points in Modal Logic.
Anuj Dawar, Erich Grädel, Stephan Kreutzer
2001Intersection Logic.
Simona Ronchi Della Rocca, Luca Roversi
2001Labelled Natural Deduction for Interval Logics.
Thomas Marthedal Rasmussen
2001Life without the Terminal Type.
Lutz Schröder
2001Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic.
Yohji Akama
2001Local Reasoning about Programs that Alter Data Structures.
Peter W. O'Hearn, John C. Reynolds, Hongseok Yang
2001Locus Solum: From the Rules of Logic to the Logic of Rules.
Jean-Yves Girard
2001Markov's Principle for Propositional Type Theory.
Alexei Kopylov, Aleksey Nogin
2001Modal Logic and the Two-Variable Fragment.
Carsten Lutz, Ulrike Sattler, Frank Wolter
2001Monotone Inductive and Coinductive Constructors of Rank 2.
Ralph Matthes
2001Non-commutativity and MELL in the Calculus of Structures.
Alessio Guglielmi, Lutz Straßburger
2001Normalized Types.
Pierre Courtieu
2001On a Generalisation of Herbrand's Theorem.
Matthias Baaz, Georg Moser
2001Quadratic Correctness Criterion for Non-commutative Logic.
Virgile Mogbil
2001Recursion for Higher-Order Encodings.
Carsten Schürmann
2001Semantic Characterisations of Second-Order Computability over the Real Numbers.
Margarita V. Korovina, Oleg V. Kudinov
2001Stratified Context Unification Is in PSPACE.
Manfred Schmidt-Schauß
2001The Anatomy of Innocence.
Vincent Danos, Russell Harmer
2001The Decidability of Model Checking Mobile Ambients.
Witold Charatonik, Jean-Marc Talbot
2001The Expressive Power of Horn Monadic Linear Logic.
Max I. Kanovich
2001The Natural Order-Generic Collapse for omega-Representable Databases over the Rational and the Real Ordered Group.
Nicole Schweikardt
2001Uniform Derivation of Decision Procedures by Superposition.
Alessandro Armando, Silvio Ranise, Michaël Rusinowitch
2001Well-Founded Recursive Relations.
Jean Goubault-Larrecq