Computer science logic : 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000 : proceedings
Author(s)
Bibliographic Information
Computer science logic : 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000 : proceedings
（Lecture notes in computer science, 1862）
Springer, c2000
Available at / 40 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||186200036207
-
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図
V.1862007.6/L507/v.186205474667,
007.6/L507/v.186205474667 -
University of Tsukuba Library, Library on Library and Information Science
007.08:L-49:1862001005960
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
CSL is the annual conference of the European Association for Computer Science Logic (EACSL). CSL2000 is the 14th such annual conference, thus witnessing the importance and sustained international interest in the application of me- ods from mathematical logic to computer science. The current conference was organized by the Mathematics Institute and the Computer Science Institute of the Ludwig-Maximilians-Universit. at Munc .. hen (LMU), with generous ?nancial supportfromtheDeutscheForschungsgemeinschaft,Forschungsinstitutfur .. an- wandte Softwaretechnologie (FAST e.V.), Munc .. hener Universit. atsgesellschaft e.V., and Siemens AG. Our sponsors' generosity enabled, among other things, stipends for the ?nancial support of students as well as of researchers from Ea- ern Europe. Topics in the call for papers for CSL2000 included: automated deduction andinteractivetheoremproving,categoricallogicandtopologicalsemantics,c- structivemathematicsandtypetheory,domaintheory,equationallogicandterm rewriting, ?nite model theory, database theory, higher order logic, lambda and combinatory calculi, logical aspects of computational complexity, logical fo- dations of programming paradigms, logic programming and constraints, linear logic, modal and temporal logics, model checking, program extraction, program logicsandsemantics,programspeci?
cation,transformationandveri?cation.The invited speakers were: Moshe Vardi (Houston), Paul Beame (Washington), - dreas Blass (Ann Arbor), Egon B.. orger (Pisa), Yuri Gurevich (Redmond), Bruno Poizat (Lyons), Wolfram Schulte (Redmond), Saharon Shelah (Jerusalem), and Colin Sterling (Edinburgh). Special thanks to Moshe Vardi for being willing to speakintheplaceofMikl' osAjtai(Almaden),whocouldnotattendthemeeting. The day of 24 August 2000, during the week-long CSL2000 meeting, was reserved for theGurevichSymposium, a special, one-day tribute to the scienti?c contributions of Professor Yuri Gurevich, at the occasion of his 60th birthday.
Table of Contents
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 eliminant 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.
by "Nielsen BookData"
