Computer Science Logic

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