Computer Science Logic - neues Buch

EAN (ISBN-13): 9783540448020
Erscheinungsjahr: 2001
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-25T22:27:47+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-25T11:31:29+01:00 (Vienna)
ISBN/EAN: 9783540448020

ISBN - alternative Schreibweisen:
978-3-540-44802-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: logic computer science

---

Daten vom Verlag:

Autor/in: Laurent Fribourg
Titel: Lecture Notes in Computer Science; Computer Science Logic - 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings
Verlag: Springer; Springer Berlin
628 Seiten
Erscheinungsjahr: 2003-06-30
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XII, 628 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Automat; automata; complexity; lambda calculus; logic; semantics; verification; C; Compilers and Interpreters; Artificial Intelligence; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Mathematical Logic and Foundations; Computer Science; Künstliche Intelligenz; Theoretische Informatik; Mathematik: Logik; Mathematische Grundlagen; BC

Invited Papers.- Local Reasoning about Programs that Alter Data Structures.- Applications of Alfred Tarski’s Ideas in Database Theory.- Locus Solum: From the Rules of Logic to the Logic of Rules.- Contributed Papers.- The Expressive Power of Horn Monadic Linear Logic.- Non-commutativity and MELL in the Calculus of Structures.- Quadratic Correctness Criterion for Non-commutative Logic.- Descriptive Complexity.- Capture Complexity by Partition.- An Existential Locality Theorem.- Actual Arithmetic and Feasibility.- The Natural Order-Generic Collapse for ?-Representable Databases over the Rational and the Real Ordered Group.- Semantics.- An Algebraic Foundation for Higraphs.- Semantic Characterisations of Second-Order Computability over the Real Numbers.- An Abstract Look at Realizability.- The Anatomy of Innocence.- Higher-Order Programs.- An Improved Extensionality Criterion for Higher-Order Logic Programs.- A Logic for Abstract State Machines.- Constrained Hyper Tableaux.- Modal Logics.- Modal Logic and the Two-Variable Fragment.- A Logic for Approximate First-Order Reasoning.- Inflationary Fixed Points in Modal Logic.- Categorical and Kripke Semantics for Constructive S4 Modal Logic.- Verification.- Labelled Natural Deduction for Interval Logics.- Decidable Navigation Logics for Object Structures.- The Decidability of Model Checking Mobile Ambients.- Automata.- A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem.- An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.- Decision Procedure for an Extension of WS1S.- Lambda-Calculus.- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic.- Intersection Logic.- Life without the Terminal Type.- Fully Complete Minimal PER Models for the Simply Typed?-Calculus.- Induction.- A Principle of Induction.- On a Generalisation of Herbrand’s Theorem.- Well-Founded Recursive Relations.- Equational Calculus.- Stratified Context Unification Is in PSPACE.- Uniform Derivation of Decision Procedures by Superposition.- Complete Categorical Equational Deduction.- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.- Constructive Theory of Types.- Normalized Types.- Markov’s Principle for Propositional Type Theory.- Recursion for Higher-Order Encodings.- Monotone Inductive and Coinductive Constructors of Rank 2.
Includes supplementary material: sn.pub/extras