rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Computer Science Logic
    sub title: 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007. Proceedings
  name:
    name part: Duparc, Jacques.
    role:
      role term: editor.
  name:
    name part: Henzinger, Thomas A.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2007
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIV, 600 p. online resource.
  table of contents: Invited Lectures -- Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract) -- The Symbolic Approach to Repeated Games (Abstract) -- Proofs, Programs and Abstract Complexity -- Model-Checking First-Order Logic: Automata and Locality -- Tightening the Exchange Rates Between Automata -- Precise Relational Invariants Through Strategy Iteration -- Logic and Games -- Omega-Regular Half-Positional Winning Conditions -- Clique-Width and Parity Games -- Logical Refinements of Church’s Problem -- The Power of Counting Logics on Restricted Classes of Finite Structures -- Expressiveness -- Comparing the Expressive Power of Well-Structured Transition Systems -- There Exist Some ?-Powers of Any Borel Rank -- Games and Trees -- Satisfiability of a Spatial Logic with Tree Variables -- Forest Expressions -- MSO on the Infinite Binary Tree: Choice and Order -- Logic and Deduction -- Classical and Intuitionistic Logic Are Asymptotically Identical -- Qualitative Temporal and Spatial Reasoning Revisited -- On Acyclic Conjunctive Queries and Constant Delay Enumeration -- Integrating Linear Arithmetic into Superposition Calculus -- Lambda Calculus 1 -- The Theory of Calculi with Explicit Substitutions Revisited -- A Soft Type Assignment System for ?-Calculus -- Lambda Theories of Effective Lambda Models -- Typed Normal Form Bisimulation -- Lambda Calculus 2 -- Not Enough Points Is Enough -- Classical Program Extraction in the Calculus of Constructions -- Building Decision Procedures in the Calculus of Inductive Constructions -- Finite Model Theory -- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words -- On the Complexity of Reasoning About Dynamic Policies -- Relativizing Small Complexity Classes and Their Theories -- Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping -- Linear Logic -- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic -- Linear Realizability -…
  note: edited by Jacques Duparc, Thomas A. Henzinger.
  subject:
    topic: Computer science
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computers
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer Science
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Theory of Computation
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Artificial Intelligence (incl. Robotics)
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Mathematical Logic and Foundations
  classification: QA76.7-76.73
  classification: QA76.76.C65
  classification: 005.13
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 4646
  identifier: 9783540749158
  identifier: http://dx.doi.org/10.1007/978-3-540-74915-8
  record info:
    record creation date: 100301
    record change date: 20151204183842.0
    record identifier: 978-3-540-74915-8