Theoretical Computer Science, Volume 275

Volume 275, Number 1-2, March 2002

• Mingsheng Ying:
  Bisimulation indexes and their applications. 1-68
  Electronic Edition (link) BibTeX
• Bruce S. Burdick:
  A note on iterated duals of certain topological spaces. 69-77
  Electronic Edition (link) BibTeX
• Ernest G. Manes:
  Taut Monads and T0-spaces. 79-109
  Electronic Edition (link) BibTeX
• Alexander Moshe Rabinovich:
  Finite variability interpretation of monadic logic of order. 111-125
  Electronic Edition (link) BibTeX
• Nadia Busi:
  Analysis issues in Petri nets with inhibitor arcs. 127-177
  Electronic Edition (link) BibTeX
• Serge Abiteboul, Sophie Cluet, Tova Milo:
  Correspondence and translation for heterogeneous data. 179-213
  Electronic Edition (link) BibTeX
• Dominic Duggan, John Ophel:
  Open and closed scopes for constrained genericity. 215-258
  Electronic Edition (link) BibTeX
• Pierpaolo Degano, Fabio Gadducci, Corrado Priami:
  A causal semantics for CCS via rewriting logic. 259-282
  Electronic Edition (link) BibTeX
• Iain A. Stewart:
  Program schemes, arrays, Lindström quantifiers and zero-one laws. 283-310
  Electronic Edition (link) BibTeX
• Igor Walukiewicz:
  Monadic second-order logic on tree-like structures. 311-346
  Electronic Edition (link) BibTeX
• Danièle Beauquier, Anatol Slissenko:
  Decidable verification for reducible timed automata specified in a first order logic with time. 347-388
  Electronic Edition (link) BibTeX
• Maria I. Sessa:
  Approximate reasoning by similarity-based SLD resolution. 389-426
  Electronic Edition (link) BibTeX
• Jirí Adámek, Michel Hébert, Jirí Rosický:
  On abstract data types presented by multiequations. 427-462
  Electronic Edition (link) BibTeX
• Sergei G. Vorobyov:
  forall-Exists⁵-equational theory of context unification is undecidable. 463-479
  Electronic Edition (link) BibTeX
• Mingsheng Ying:
  Additive models of probabilistic processes. 481-519
  Electronic Edition (link) BibTeX
• Agostino Cortesi, Agostino Dovier, Elisa Quintarelli, Letizia Tanca:
  Operational and abstract semantics of the query language G-Log. 521-560
  Electronic Edition (link) BibTeX
• Ernst Zimmermann:
  Peirce's Rule in Natural Deduction. 561-574
  Electronic Edition (link) BibTeX
• Felice Cardone:
  A coinductive completeness proof for the equivalence of recursive types. 575-587
  Electronic Edition (link) BibTeX
• Walter Vogler:
  Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. 589-631
  Electronic Edition (link) BibTeX
• Frank Neven, Thomas Schwentick:
  Query automata over finite trees. 633-674
  Electronic Edition (link) BibTeX
• Adel Bouhoula, Michaël Rusinowitch:
  Observational proofs by rewriting. 675-698
  Electronic Edition (link) BibTeX