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

EAN (ISBN-13): 9783540446224
Erscheinungsjahr: 2000
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-05-10T02:57:51+02:00 (Vienna)
Detailseite zuletzt geändert am 2023-09-20T00:54:29+02:00 (Vienna)
ISBN/EAN: 9783540446224

ISBN - alternative Schreibweisen:
978-3-540-44622-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: berghaus, schwichtenberg
Titel des Buches: logic computer science, fischbachau

---

Daten vom Verlag:

Autor/in: Peter G. Clote; Helmut Schwichtenberg
Titel: Lecture Notes in Computer Science; Computer Science Logic - 14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings
Verlag: Springer; Springer Berlin
550 Seiten
Erscheinungsjahr: 2003-06-29
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIV, 550 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Künstliche Intelligenz; Verstehen; Automat; Constraint; automated deduction; complexity; computer; formal specification; formal verification; logic; model checking; proving; theorem proving; verification; C; Artificial Intelligence; Compilers and Interpreters; Computer System Implementation; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Mathematical Logic and Foundations; Computer Science; Compiler und Übersetzer; Systemanalyse und -design; Theoretische Informatik; Mathematik: Logik; Mathematische Grundlagen; BC

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.- FromPrograms to Games: Invariance and Safety for Bisimulation.- Logical Relations and Data Abstraction.- Elementary Choiceless Constructive Analysis.- On the Logic of the Standard Proof Predicate.
Includes supplementary material: sn.pub/extras