Computer science logic. 14th international workshop, CSL 2000. Annual conference of the EACSL, Fischbachau, Germany, August 21--26, 2000. Proceedings (Q1578434)

The articles of mathematical interest will be reviewed individually. The preceding workshop (13th, 1999) has been reviewed (Zbl 0929.00039). Indexed articles: \textit{Blass, Andreas; Gurevich, Yuri}, Background, reserve, and Gandy machines, 1-17 [Zbl 0973.03053] \textit{Blass, Andreas; Gurevich, Yuri}, Choiceless polynomial time computation and the zero-one law, 18-40 [Zbl 0973.03054] \textit{Börger, Egon; Schmid, Joachim}, Composition and submachine concepts for sequential ASMs, 41-60 [Zbl 0973.68066] \textit{Poizat, Bruno}, An unsuccessful attempt to construct a structure quickly eliminating quantifiers, 61-70 [Zbl 0973.03045] \textit{Schulte, Wolfram}, Translating theory into practice -- abstract state machines within Microsoft, 71 [Zbl 0973.68616] \textit{Shelah, Saharon}, Choiceless polynomial time logic: Inability to express, 72-125 [Zbl 0973.03055] \textit{Stirling, Colin}, Schema revisited, 126-138 [Zbl 0973.68531] \textit{Abramsky, Samson; Lenisa, Marina}, A fully complete PER model for ML polymorphic types, 140-155 [Zbl 0973.03015] \textit{Aspinall, David}, Subtyping with power types, 156-171 [Zbl 0973.03018] \textit{Atserias, Albert}, The descriptive complexity of the fixed-points of bounded formulas, 172-186 [Zbl 0973.03057] \textit{Baaz, Matthias; Zach, Richard}, Hypersequents and the proof theory of intuitionistic fuzzy logic, 187-201 [Zbl 0973.03029] \textit{Bauer, Andrej; Birkedal, Lars}, Continuous functionals of dependent types and equilogical spaces, 202-216 [Zbl 0973.03036] \textit{Benedikt, Michael; Keisler, H. Jerome}, Definability over linear constraints, 217-231 [Zbl 0973.03037] \textit{Blumensath, Achim}, Bounded arithmetic and descriptive complexity, 232-246 [Zbl 0973.68082] \textit{Bradfield, J. C.}, Independence: Logics and concurrency, 247-261 [Zbl 0973.03041] \textit{Comon, Hubert; Cortier, Vèronique}, Flatness is not a weakness, 262-276 [Zbl 0973.68142] \textit{Coquand, Thierry; Zhang, Guo-Qiang}, Sequents, frames, and completeness, 277-291 [Zbl 0973.03080] \textit{Danos, Vincent; Krivine, Jean-Louis}, Disjunctive tautologies as synchronisation schemes, 292-301 [Zbl 0973.03039] \textit{Ésik, Zoltán}, Axiomatizing the least fixed point operation and binary supremum, 302-316 [Zbl 0973.08003] \textit{Hancock, Peter; Setzer, Anton}, Interactive programs in dependent type theory, 317-331 [Zbl 0973.68041] \textit{Hemaspaandra, Edith}, Modal satisfiability is in deterministic linear space, 332-342 [Zbl 0973.03056] \textit{Jaume, Mathieu}, Logic programming and co-inductive definitions, 343-355 [Zbl 0973.68026] \textit{Kahle, Reinhard; Studer, Thomas}, A theory of explicit mathematics equivalent to \(\text{ID}_1\), 356-370 [Zbl 0973.03078] \textit{Kuznets, Roman}, On the complexity of explicit modal logics, 371-383 [Zbl 0973.03075] \textit{Laird, J.}, Finite models and full completeness, 384-398 [Zbl 0973.03040] \textit{Makowsky, J. A.; Meer, K.}, On the complexity of combinatorial and metafinite generating functions of graph properties of the computational model of Blum, Shub and Smale, 399-410 [Zbl 0973.68524] \textit{Momigliano, Alberto}, Elimination of negation in a logical framework, 411-426 [Zbl 0973.68039] \textit{Murawski, A. S.; Ong, C.-H. L.}, Discreet games, light affine logic and PTIME computation, 427-441 [Zbl 0973.03038] \textit{Zhan, Naijun}, Completeness of higher-order duration calculus, 442-456 [Zbl 0973.68038] \textit{Ohsaki, Hitoshi; Middeldorp, Aart; Giesl, Jürgen}, Equational termination by semantic labelling, 457-471 [Zbl 0973.68094] \textit{Parigot, Michel}, On the computational interpretation of negation, 472-484 [Zbl 0973.03017] \textit{Pauly, Marc}, From programs to games: Invariance and safety for bisimulation, 485-496 [Zbl 0973.68040] \textit{Power, John; Robinson, Edmund}, Logical relations and data abstraction, 497-511 [Zbl 0973.68148] \textit{Schuster, Peter M.}, Elementary choiceless constructive analysis, 512-526 [Zbl 0973.03079] \textit{Yavorsky, Rostislav E.}, On the logic of the standard proof predicate, 527-541 [Zbl 0973.03077] \textit{Börger, Egon}, Yuri Gurevich: The evolution of a research life from algebra through logic to computer science, viii-x [Zbl 0973.01060]