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.)
Resource Information
The item Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
- 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."
- Language
- eng
- Extent
- 1 online resource (xi, 565 pages)
- 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
- Isbn
- 9783540282310
- 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
- Subject
-
- COMPUTERS -- Software Development & Engineering | General
- COMPUTERS -- Software Development & Engineering | Tools
- Computational logic
- Computer logic
- Computer logic
- Computer logic -- Congresses
- Conference papers and proceedings
- Conference papers and proceedings
- Informatique
- Kongress
- Logik
- Logique (Informatique)
- Logique informatique -- Congrès
- Logische Programmierung
- Oxford (2005)
- Programmierlogik
- Theoretische Informatik
- COMPUTERS -- Programming | Open Source
- 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."
- 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.)
- 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.)
- 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
Subject
- COMPUTERS -- Software Development & Engineering | General
- COMPUTERS -- Software Development & Engineering | Tools
- Computational logic
- Computer logic
- Computer logic
- Computer logic -- Congresses
- Conference papers and proceedings
- Conference papers and proceedings
- Informatique
- Kongress
- Logik
- Logique (Informatique)
- Logique informatique -- Congrès
- Logische Programmierung
- Oxford (2005)
- Programmierlogik
- Theoretische Informatik
- COMPUTERS -- Programming | Open Source
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computer-science-logic--19th-international/GvgIANrpwcs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computer-science-logic--19th-international/GvgIANrpwcs/">Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Computer-science-logic--19th-international/GvgIANrpwcs/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Computer-science-logic--19th-international/GvgIANrpwcs/">Computer science logic : 19th international Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 ; proceedings, Luke Ong (ed.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
