Computer Science Logic 14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Clote, Peter G. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Schwichtenberg, Helmut (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1862
• Θέματα: Artificial intelligence.; Programming languages (Electronic computers).; Architecture, Computer.; Mathematical logic.; Computer logic.; Artificial Intelligence.; Programming Languages, Compilers, Interpreters.; Computer System Implementation.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Mathematical Logic and Foundations.

 Invited Papers -- 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 -- Contributed Papers -- 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 -- Interactive Programs in Dependent Type Theory -- Modal Satisfiability Is in Deterministic Linear Space -- Logic Programming and Co-inductive Definitions -- A Theory of Explicit Mathematics Equivalent to ID 1 -- On the Complexity of Explicit Modal Logics -- Finite Models and Full Completeness -- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale -- Elimination of Negation in a Logical Framework -- Discreet Games, Light Affine Logic and PTIME Computation -- Completeness of Higher-Order Duration Calculus -- Equational Termination by Semantic Labelling -- On the Computational Interpretation of Negation -- From Programs to Games: Invariance and Safety for Bisimulation -- Logical Relations and Data Abstraction -- Elementary Choiceless Constructive Analysis -- On the Logic of the Standard Proof Predicate.