Document - eBookmela
Loading...

Computer science logic : 14th International Workshop, CSL 2000, 9th Annual Conference of the EACSL, Fischbacha | Workshop on Computer Science Logic (14th : 2000 : Fischbachau, Germany), Clote, Peter, Schwichtenberg, Helmut, 1942-, European Association for Computer Science Logic. Conference (9th : 2000 : Fischbachau, Germany)

Likes0
Telegram icon Share on Telegram

Computer science logic : 14th International Workshop, CSL 2000, 9th Annual Conference of the EACSL, Fischbacha

User Rating: Be the first one!

Author: Workshop on Computer Science Logic (14th : 2000 : Fischbachau, Germany), Clote, Peter, Schwichtenberg, Helmut, 1942-, European Association for Computer Science Logic. Conference (9th : 2000 : Fischbachau, Germany)

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2000

Language: eng

Subjects: Computer logic

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540678956

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 262.19 MB

PDF Size: 5.77 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Archive Url

Downloads: 462

Views: 512

Total Files: 18

Media Type: texts

Description

Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings
Author: Peter G. Clote, Helmut Schwichtenberg
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67895-3
DOI: 10.1007/3-540-44622-2

Table 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
eBookmela
Logo
Register New Account