Volume 300, Number 1-3, 7 May 2003
- Peter Aczel, Jirí Adámek, Stefan Milius, Jiri Velebil:
Infinite trees and completely iterative theories: a coalgebraic view.
1-45
Electronic Edition (link) BibTeX
- Gian Luca Cattani, Glynn Winskel:
Presheaf models for CCS-like languages.
47-89
Electronic Edition (link) BibTeX
- Stacy E. Finkelstein, Peter J. Freyd, James Lipton:
A new framework for declarative programming.
91-160
Electronic Edition (link) BibTeX
- Otmane Aït Mohamed, Xiaoyu Song, Eduard Cerny:
On the non-termination of M-based abstract state enumeration.
161-179
Electronic Edition (link) BibTeX
- Axel Wabenhorst:
Induction in the Timed Interval Calculus.
181-207
Electronic Edition (link) BibTeX
- Sándor Vágvölgyi:
Intersection of finitely generated congruences over term algebra.
209-234
Electronic Edition (link) BibTeX
- Stéphane Demri:
A polynomial space construction of tree-like models for logics with local chains of modal connectives.
235-258
Electronic Edition (link) BibTeX
- Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann:
General parameterised refinement and recursion for the M-net calculus.
259-300
Electronic Edition (link) BibTeX
- Abdelwaheb Ayari, David A. Basin, Felix Klaedtke:
Decision procedures for inductive Boolean functions based on alternating automata.
301-329
Electronic Edition (link) BibTeX
- Alexander Moshe Rabinovich:
Automata over continuous time.
331-363
Electronic Edition (link) BibTeX
- Lorenzo Carlucci:
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem.
365-378
Electronic Edition (link) BibTeX
- Andrew D. Gordon, Alan Jeffrey:
Typing correspondence assertions for communication protocols.
379-409
Electronic Edition (link) BibTeX
- Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen:
The power of reachability testing for timed automata.
411-475
Electronic Edition (link) BibTeX
- René David:
Decidability results for primitive recursive algorithms.
477-504
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:24:51 2009
by Michael Ley (ley@uni-trier.de)