Fundamenta Informaticae
, Volume 45
Volume 45, Number 1-2, January 2001
Patrick Baillot
,
Marco Pedicini
:
Elementary Complexity and Geometry of Interaction.
1-31
Sabine Broda
,
Luís Damas
:
Counting a Type's (Principal) Inhabitants.
33-51
René David
:
Computing with Böhm Trees.
53-77
Masahiko Sato
,
Takafumi Sakurai
,
Rod M. Burstall
:
Explicit Environments.
79-115
Richard Statman
:
Marginalia to a Theorem of Jacopini.
117-121
Christian Urban
,
Gavin M. Bierman
:
Strong Normalisation of Cut-Elimination in Classical Logic.
123-155
Volume 45, Number 3, February 2001
János Apró
,
Sándor Vágvölgyi
:
The Ground Tree Transducer Game with Identical Tree Automata.
157-172
Philippe Balbiani
,
Dimiter Vakarelov
:
Iteration-free PDL with Intersection: a Complete Axiomatization.
173-194
Jean-Marc Champarnaud
,
Djelloul Ziadi
:
From Mirkin's Prebases to Antimirov's Word Partial Derivatives.
195-205
Petr Hájek
,
Sauro Tulipani
:
Complexity of Fuzzy Probability Logics.
207-213
Padmanabhan Krishnan
:
Decomposing Timed Push Down Automata.
215-229
Alexander Meduna
:
Uniform Generation of Languages by Scattered Context Grammars.
231-235
Robert Saxon Milnikel
:
Skeptical Reasoning in FC-Normal Logic Programs is P11-complete.
237-252
Bengt J. Nilsson
:
Approximating a Shortest Watchman Route.
253-281
Volume 45, Number 4, March 2001
Junior Barrera
,
Ronaldo Fumio Hashimoto
:
Sup-Compact and Inf-Compact Representations of W-Operators.
283-294
Andries Petrus Engelbrecht
:
Sensitivity Analysis for Selective Learning by Feedforward Neural Networks.
295-328
Henning Fernau
,
Ralf Stiebe
:
Valences in Lindenmayer Systems.
329-358
Damas P. Gruska
,
Andrea Maggiolo-Schettini
:
Process Algebras for Network Communication.
359-378
Antonino Salibra
:
Nonmodularity Results for Lambda Calculus.
379-392
Xishun Zhao
,
Decheng Ding
:
Complexity Results for 2CNF Default Theories.
393-404
Last update Wed May 22 17:36:26 2013 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page