CSL B

40 papers

YearTitle / Authors
2005A Logic of Coequations.
Jirí Adámek
2005A Propositional Proof System for Log Space.
Steven Perron
2005A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage.
Shin-ya Katsumata
2005An Abstract Strong Normalization Theorem.
Ulrich Berger
2005An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints.
Ashish Tiwari
2005Bounded Model Checking of Pointer Programs.
Witold Charatonik, Lilia Georgieva, Patrick Maier
2005Clemens Lautemann: 1951-2005
Johann A. Makowsky
2005Closure Properties of Weak Systems of Bounded Arithmetic.
Antonina Kolokolova
2005Complexity and Intensionality in a Type-1 Framework for Computable Analysis.
Branimir Lambov
2005Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings
C.-H. Luke Ong
2005Computing with Sequences, Weak Topologies and the Axiom of Choice.
Vasco Brattka, Matthias Schröder
2005Confluence of Shallow Right-Linear Rewrite Systems.
Guillem Godoy, Ashish Tiwari
2005Coprimality in Finite Models.
Marcin Mostowski, Konrad Zdanowski
2005Decidability of Term Algebras Extending Partial Algebras.
Bakhadyr Khoussainov, Sasha Rubin
2005Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations.
Frédéric Blanqui
2005Distributed Control Flow with Classical Modal Logic.
Tom Murphy VII, Karl Crary, Robert Harper
2005Feasible Proofs of Matrix Properties with Csanky's Algorithm.
Michael Soltys
2005Focusing the Inverse Method for Linear Logic.
Kaustuv Chaudhuri, Frank Pfenning
2005From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.
Hubie Chen, Víctor Dalmau
2005Higher-Order Matching and Games.
Colin Stirling
2005Identifying Polynomial-Time Recursive Functions.
Carsten Schürmann, Jatin Shah
2005L-Nets, Strategies and Proof-Nets.
Pierre-Louis Curien, Claudia Faggian
2005Light Functional Interpretation.
Mircea-Dan Hernest
2005Note on Formal Analogical Reasoning in the Juridical Context.
Matthias Baaz
2005On Bunched Polymorphism.
Matthew Collinson, David J. Pym, Edmund Robinson
2005On Deciding Topological Classes of Deterministic Tree Languages.
Filip Murlak
2005On the Complexity of Hybrid Logics with Binders.
Balder ten Cate, Massimo Franceschet
2005On the Role of Type Decorations in the Calculus of Inductive Constructions.
Bruno Barras, Benjamin Grégoire
2005Order Structures on Böhm-Like Models.
Paula Severi, Fer-Jan de Vries
2005PDL with Intersection and Converse Is Decidable.
Carsten Lutz
2005Permutative Logic.
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet
2005Results on the Guarded Fragment with Equivalence or Transitive Relations.
Emanuel Kieronski
2005The Ackermann Award 2005.
Erich Grädel, Janos Makowsky, Alexander A. Razborov
2005The Complexity of Independence-Friendly Fixpoint Logic.
Julian C. Bradfield, Stephan Kreutzer
2005The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic.
Bruno Courcelle, Christian Delhommé
2005Towards a Characterization of Order-Invariant Queries over Tame Structures.
Michael Benedikt, Luc Segoufin
2005Towards a Typed Geometry of Interaction.
Esfandiar Haghverdi, Philip J. Scott
2005Transfinite Extension of the Mu-Calculus.
Julian C. Bradfield, Jacques Duparc, Sandra Quickert
2005Verification in Predicate Logic with Time: Algorithmic Questions.
Anatol Slissenko
2005XML Navigation and Tarski's Relation Algebras.
Maarten Marx