CSL 2000: Accepted Papers

5	Completeness of Higher-Order Duration Calculus	Zhan Naijun
6	Bounded Arithmetic and Descriptive Complexity	Achim Blumensath
8	Continuous Functionals of Dependent Types and Equilogical Spaces	Andrej Bauer and Lars Birkedal
13	A Theory of Explicit Mathematics Equivalent to ID_1.	Reinhard Kahle and Thomas Studer
14	Equational Termination by Semantic Labelling	Hitoshi Ohsaki, Aart Middeldorp, and Jürgen Giesl
16	Sequents, Frames, and Completeness	Thierry Coquand and Guo-Qiang Zhang
20	On the complexity of combinatorial and metafinite generating functions	J.A. Makowsky and K. Meer
24	Logic programming and Co-inductive definitions	Mathieu Jaume
30	A Fully Complete PER Model for ML Polymorphic Types	Samson Abramsky , Marina Lenisa
31	The Descriptive Complexity of the Fixed-Points of Bounded Formulas	Albert Atserias
32	On the Complexity of Explicit Modal Logics	Roman Kuznets
33	On the logic of the standard proof predicate	Rostislav Yavorsky
36	From Programs to Games: Invariance and Safety for Bisimulation	Marc Pauly
38	Axiomatizing the least fixed point operation and supremum	Zoltan Esik
40	Logical Relations and Data Abstraction	John Power and Edmund Robinson
44	Subtyping with Power Types	David Aspinall
46	Discreet Games, Light Affine Logic and PTIME Computation	A. S. Murawski and C.-H. L. Ong
51	Interactive programs in dependent type theory	Peter Hancock Anton Setzer
53	Definability over Linear Constraints	Michael Benedikt and H. Jerome Keisler
55	Modal Satisfiability is in Deterministic Linear Space	Edith Hemaspaandra
56	A Proof-theoretically Adequate Axiomatization of Intuitionistic Fuzzy Logic	Matthias Baaz, Richard Zach
57	Finite models and full completeness	James Laird
63	Disjunctive Tautologies as Synchronisation Schemes	Vincent Danos Jean-Louis Krivine
65	Elementary Choiceless Constructive Analysis	Peter M. Schuster
69	Flatness is not a Weakness	Hubert Comon and Véronique Cortier
76	Independence: logics and concurrency	J. C. Bradfield
78	Elimination of Negation in a Logical Framework	Alberto Momigliano
82	On the computational interpretation of negation	Michel Parigot