Computer science logic

the long version

Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings<br />Author: Peter G. Clote, Helmut Schwichtenberg<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-67895-3<br /> DOI: 10.1007/3-540-44622-2<br /><br />Table of Contents:<p></p><ul><li>Background, Reserve, and Gandy Machines </li><li>Choiceless Polynomial Time Computation and the Zero-One Law </li><li>Composition and Submachine Concepts for Sequential ASMs </li><li>Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs </li><li>Translating Theory into Practice — Abstract State Machines within Microsoft </li><li>Choiceless Polynomial Time Logic: Inability to Express </li><li>Schema Revisited </li><li>Automated Verification = Graphs, Automata, and Logic </li><li>A Fully Complete PER Model for ML Polymorphic Types </li><li>Subtyping with Power Types </li><li>The Descriptive Complexity of the Fixed-Points of Bounded Formulas </li><li>Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic </li><li>Continuous Functionals of Dependent Types and Equilogical Spaces </li><li>Definability over Linear Constraints </li><li>Bounded Arithmetic and Descriptive Complexity </li><li>Independence: Logics and Concurrency </li><li>Flatness Is Not a Weakness </li><li>Sequents, Frames, and Completeness </li><li>Disjunctive Tautologies as Synchronisation Schemes </li><li>Axiomatizing the Least Fixed Point Operation and Binary Supremum</li></ul>