Coverart for item
The Resource Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.)

Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.)

Label
Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings
Title
Computer science logic
Title remainder
19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings
Statement of responsibility
Luke Ong (ed.)
Title variation
  • CSL 2005
  • 14th Annual Conference of the EACSL
  • Fourteenth Annual Conference of the EACSL
  • Conference of the EACSL
Creator
Contributor
Subject
Genre
Language
eng
Summary
"The Annual Conference of the European Association for Computer Science Logic (EACSL), CSL 2005, was held at the University of Oxford on 22 -25 August 2005."
Member of
Cataloging source
GW5XE
Dewey number
005.1/015113
Illustrations
illustrations
Index
index present
LC call number
QA76.9.L63
LC item number
W67 2005eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2005
http://bibfra.me/vocab/lite/meetingName
Workshop on Computer Science Logic
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
2005 :
http://library.link/vocab/relatedWorkOrContributorName
European Association for Computer Science Logic
Series statement
Lecture notes in computer science,
Series volume
3634
http://library.link/vocab/subjectName
  • Computer logic
  • Logique informatique
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • Informatique
  • Computer logic
  • Computational logic
  • Logik
  • Logische Programmierung
  • Programmierlogik
  • Theoretische Informatik
  • Logique (Informatique)
Label
Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Lectures -- XML Navigation and Tarski's Relation Algebras -- Verification in Predicate Logic with Time: Algorithmic Questions -- Note on Formal Analogical Reasoning in the Juridical Context -- An Abstract Strong Normalization Theorem -- Semantics and Logics -- On Bunched Polymorphism -- Distributed Control Flow with Classical Modal Logic -- A Logic of Coequations -- A Semantic Formulation of???-Lifting and Logical Predicates for Computational Metalanguage -- Type Theory and Lambda Calculus -- Order Structures on Böhm-Like Models -- Higher-Order Matching and Games -- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations -- On the Role of Type Decorations in the Calculus of Inductive Constructions -- Linear Logic and Ludics -- L-Nets, Strategies and Proof-Nets -- Permutative Logic -- Focusing the Inverse Method for Linear Logic -- Towards a Typed Geometry of Interaction -- Constraints -- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction -- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints -- Finite Models, Decidability and Complexity -- Coprimality in Finite Models -- Towards a Characterization of Order-Invariant Queries over Tame Structures -- Decidability of Term Algebras Extending Partial Algebras -- Results on the Guarded Fragment with Equivalence or Transitive Relations -- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic -- On the Complexity of Hybrid Logics with Binders -- The Complexity of Independence-Friendly Fixpoint Logic -- Closure Properties of Weak Systems of Bounded Arithmetic -- Verification and Model Checking -- Transfinite Extension of the Mu-Calculus -- Bounded Model Checking of Pointer Programs -- PDL with Intersection and Converse Is Decidable -- On Deciding Topological Classes of Deterministic Tree Languages -- Constructive Reasoning and Computational Mathematics -- Complexity and Intensionality in a Type-1 Framework for Computable Analysis -- Computing with Sequences, Weak Topologies and the Axiom of Choice -- Light Functional Interpretation -- Feasible Proofs of Matrix Properties with Csanky's Algorithm -- Implicit Computational Complexity and Rewriting -- A Propositional Proof System for Log Space -- Identifying Polynomial-Time Recursive Functions -- Confluence of Shallow Right-Linear Rewrite Systems -- Appendices -- The Ackermann Award 2005 -- Clemens Lautemann: 1951-2005 An Obituary
Control code
262680974
Dimensions
unknown
Extent
1 online resource (xi, 565 pages)
Form of item
online
Isbn
9783540282310
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
9783540282310
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-28231-0
Publisher number
11538363
Specific material designation
remote
System control number
(OCoLC)262680974
Label
Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Lectures -- XML Navigation and Tarski's Relation Algebras -- Verification in Predicate Logic with Time: Algorithmic Questions -- Note on Formal Analogical Reasoning in the Juridical Context -- An Abstract Strong Normalization Theorem -- Semantics and Logics -- On Bunched Polymorphism -- Distributed Control Flow with Classical Modal Logic -- A Logic of Coequations -- A Semantic Formulation of???-Lifting and Logical Predicates for Computational Metalanguage -- Type Theory and Lambda Calculus -- Order Structures on Böhm-Like Models -- Higher-Order Matching and Games -- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations -- On the Role of Type Decorations in the Calculus of Inductive Constructions -- Linear Logic and Ludics -- L-Nets, Strategies and Proof-Nets -- Permutative Logic -- Focusing the Inverse Method for Linear Logic -- Towards a Typed Geometry of Interaction -- Constraints -- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction -- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints -- Finite Models, Decidability and Complexity -- Coprimality in Finite Models -- Towards a Characterization of Order-Invariant Queries over Tame Structures -- Decidability of Term Algebras Extending Partial Algebras -- Results on the Guarded Fragment with Equivalence or Transitive Relations -- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic -- On the Complexity of Hybrid Logics with Binders -- The Complexity of Independence-Friendly Fixpoint Logic -- Closure Properties of Weak Systems of Bounded Arithmetic -- Verification and Model Checking -- Transfinite Extension of the Mu-Calculus -- Bounded Model Checking of Pointer Programs -- PDL with Intersection and Converse Is Decidable -- On Deciding Topological Classes of Deterministic Tree Languages -- Constructive Reasoning and Computational Mathematics -- Complexity and Intensionality in a Type-1 Framework for Computable Analysis -- Computing with Sequences, Weak Topologies and the Axiom of Choice -- Light Functional Interpretation -- Feasible Proofs of Matrix Properties with Csanky's Algorithm -- Implicit Computational Complexity and Rewriting -- A Propositional Proof System for Log Space -- Identifying Polynomial-Time Recursive Functions -- Confluence of Shallow Right-Linear Rewrite Systems -- Appendices -- The Ackermann Award 2005 -- Clemens Lautemann: 1951-2005 An Obituary
Control code
262680974
Dimensions
unknown
Extent
1 online resource (xi, 565 pages)
Form of item
online
Isbn
9783540282310
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
9783540282310
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-28231-0
Publisher number
11538363
Specific material designation
remote
System control number
(OCoLC)262680974

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...