Fundamenta Informaticae, Volume 45

Volume 45, Number 1-2, January 2001

Patrick Baillot, Marco Pedicini: Elementary Complexity and Geometry of Interaction. 1-31 BibTeX
Sabine Broda, Luís Damas: Counting a Type's (Principal) Inhabitants. 33-51 BibTeX
René David: Computing with Böhm Trees. 53-77 BibTeX
Masahiko Sato, Takafumi Sakurai, Rod M. Burstall: Explicit Environments. 79-115 BibTeX
Richard Statman: Marginalia to a Theorem of Jacopini. 117-121 BibTeX
Christian Urban, Gavin M. Bierman: Strong Normalisation of Cut-Elimination in Classical Logic. 123-155 BibTeX

János Apró, Sándor Vágvölgyi: The Ground Tree Transducer Game with Identical Tree Automata. 157-172 BibTeX
Philippe Balbiani, Dimiter Vakarelov: Iteration-free PDL with Intersection: a Complete Axiomatization. 173-194 BibTeX
Jean-Marc Champarnaud, Djelloul Ziadi: From Mirkin's Prebases to Antimirov's Word Partial Derivatives. 195-205 BibTeX
Petr Hájek, Sauro Tulipani: Complexity of Fuzzy Probability Logics. 207-213 BibTeX
Padmanabhan Krishnan: Decomposing Timed Push Down Automata. 215-229 BibTeX
Alexander Meduna: Uniform Generation of Languages by Scattered Context Grammars. 231-235 BibTeX
Robert Saxon Milnikel: Skeptical Reasoning in FC-Normal Logic Programs is P11-complete. 237-252 BibTeX
Bengt J. Nilsson: Approximating a Shortest Watchman Route. 253-281 BibTeX

Junior Barrera, Ronaldo Fumio Hashimoto: Sup-Compact and Inf-Compact Representations of W-Operators. 283-294 BibTeX
Andries Petrus Engelbrecht: Sensitivity Analysis for Selective Learning by Feedforward Neural Networks. 295-328 BibTeX
Henning Fernau, Ralf Stiebe: Valences in Lindenmayer Systems. 329-358 BibTeX
Damas P. Gruska, Andrea Maggiolo-Schettini: Process Algebras for Network Communication. 359-378 BibTeX
Antonino Salibra: Nonmodularity Results for Lambda Calculus. 379-392 BibTeX
Xishun Zhao, Decheng Ding: Complexity Results for 2CNF Default Theories. 393-404 BibTeX