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: 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings
  name:
    name part: Fribourg, Laurent.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2001
    edition: 1st ed. 2001.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 628 p. online resource.
  table of contents: 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 Bü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 Conte…
  note: edited by Laurent Fribourg.
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Artificial intelligence
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer logic
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Mathematical Logic and Formal Languages
  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, 2142
  identifier: 9783540448020
  identifier: https://doi.org/10.1007/3-540-44802-0
  record info:
    record creation date: 121227
    record change date: 20191026022233.0
    record identifier: 978-3-540-44802-0