Conferences in DBLP
Maarten Marx XML Navigation and Tarski's Relation Algebras. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:1-2 [Conf ] Anatol Slissenko Verification in Predicate Logic with Time: Algorithmic Questions. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:3-17 [Conf ] Matthias Baaz Note on Formal Analogical Reasoning in the Juridical Context. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:18-26 [Conf ] Ulrich Berger An Abstract Strong Normalization Theorem. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:27-35 [Conf ] Matthew Collinson , David J. Pym , Edmund Robinson On Bunched Polymorphism. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:36-50 [Conf ] Tom Murphy VII , Karl Crary , Robert Harper Distributed Control Flow with Classical Modal Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:51-69 [Conf ] Jirí Adámek A Logic of Coequations. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:70-86 [Conf ] Shin-ya Katsumata A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:87-102 [Conf ] Paula Severi , Fer-Jan de Vries Order Structures on Böhm-Like Models. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:103-118 [Conf ] Colin Stirling Higher-Order Matching and Games. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:119-134 [Conf ] Frédéric Blanqui Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:135-150 [Conf ] Bruno Barras , Benjamin Grégoire On the Role of Type Decorations in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:151-166 [Conf ] Pierre-Louis Curien , Claudia Faggian L-Nets, Strategies and Proof-Nets. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:167-183 [Conf ] Jean-Marc Andreoli , Gabriele Pulcini , Paul Ruet Permutative Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:184-199 [Conf ] Kaustuv Chaudhuri , Frank Pfenning Focusing the Inverse Method for Linear Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:200-215 [Conf ] Esfandiar Haghverdi , Philip J. Scott Towards a Typed Geometry of Interaction. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:216-231 [Conf ] Hubie Chen , Víctor Dalmau From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:232-247 [Conf ] Ashish Tiwari An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:248-262 [Conf ] Marcin Mostowski , Konrad Zdanowski Coprimality in Finite Models. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:263-275 [Conf ] Michael Benedikt , Luc Segoufin Towards a Characterization of Order-Invariant Queries over Tame Structures. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:276-291 [Conf ] Bakhadyr Khoussainov , Sasha Rubin Decidability of Term Algebras Extending Partial Algebras. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:292-308 [Conf ] Emanuel Kieronski Results on the Guarded Fragment with Equivalence or Transitive Relations. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:309-324 [Conf ] Bruno Courcelle , Christian Delhommé The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:325-338 [Conf ] Balder ten Cate , Massimo Franceschet On the Complexity of Hybrid Logics with Binders. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:339-354 [Conf ] Julian C. Bradfield , Stephan Kreutzer The Complexity of Independence-Friendly Fixpoint Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:355-368 [Conf ] Antonina Kolokolova Closure Properties of Weak Systems of Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:369-383 [Conf ] Julian C. Bradfield , Jacques Duparc , Sandra Quickert Transfinite Extension of the Mu-Calculus. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:384-396 [Conf ] Witold Charatonik , Lilia Georgieva , Patrick Maier Bounded Model Checking of Pointer Programs. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:397-412 [Conf ] Carsten Lutz PDL with Intersection and Converse Is Decidable. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:413-427 [Conf ] Filip Murlak On Deciding Topological Classes of Deterministic Tree Languages. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:428-441 [Conf ] Branimir Lambov Complexity and Intensionality in a Type-1 Framework for Computable Analysis. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:442-461 [Conf ] Vasco Brattka , Matthias Schröder Computing with Sequences, Weak Topologies and the Axiom of Choice. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:462-476 [Conf ] Mircea-Dan Hernest Light Functional Interpretation. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:477-492 [Conf ] Michael Soltys Feasible Proofs of Matrix Properties with Csanky's Algorithm. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:493-508 [Conf ] Steven Perron A Propositional Proof System for Log Space. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:509-524 [Conf ] Carsten Schürmann , Jatin Shah Identifying Polynomial-Time Recursive Functions. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:525-540 [Conf ] Guillem Godoy , Ashish Tiwari Confluence of Shallow Right-Linear Rewrite Systems. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:541-556 [Conf ] Erich Grädel , Janos Makowsky , Alexander A. Razborov The Ackermann Award 2005. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:557-565 [Conf ] Johann A. Makowsky Clemens Lautemann: 1951-2005 An Obituary . [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:566-566 [Conf ]