skip to content
Computer science logic : 17th international workshop, CSL 2003, 12th annual conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003 : proceedings Preview this item
ClosePreview this item
Checking...

Computer science logic : 17th international workshop, CSL 2003, 12th annual conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003 : proceedings

Author: Matthias Baaz; Johann A Makowsky
Publisher: Berlin : Springer, 2003
Series: Lecture notes in computer science, 2803
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Matthias Baaz; Johann A Makowsky
ISBN: 3540408010 9783540408017
OCLC Number: 464864474
Description: 590 s.
Contents: Deciding Monotonic Games.- The Commuting V-Diagram.- Concurrent Construction of Proof-Nets.- Back to the Future: Explicit Logic for Computer Science.- Constraint Satisfaction with Countable Homogeneous Templates.- Quantified Constraints: Algorithms and Complexity.- Verification of Infinite State Systems.- Parity of Imperfection or Fixing Independence.- Atomic Cut Elimination for Classical Logic.- Computational Mathematics, Computational Logic, and Symbolic Computation.- Simple Stochastic Parity Games.- Machine Characterizations of the Classes of the W-Hierarchy.- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.- On Relativisation and Complexity Gap for Resolution-Based Proof Systems.- Strong Normalization of the Typed ? ws -Calculus.- A Fixed-Point Logic with Symmetric Choice.- Positive Games and Persistent Strategies.- Generating All Abductive Explanations for Queries on Propositional Horn Theories.- Refined Complexity Analysis of Cut Elimination.- Comparing the Succinctness of Monadic Query Languages over Finite Trees.- The Arithmetical Complexity of Dimension and Randomness.- Towards a Proof System for Admissibility.- Program Complexity of Dynamic LTL Model Checking.- Coping Polynomially with Numerous but Identical Elements within Planning Problems.- On Algebraic Specifications of Abstract Data Types.- On the Complexity of Existential Pebble Games.- Computational Aspects of ?-Definability over the Real Numbers without the Equality Test.- The Surprising Power of Restricted Programs and Godel's Functionals.- Pebble Games on Trees.- Bistability: An Extensional Characterization of Sequentiality.- Automata on Lempel-Ziv Compressed Strings.- Complexity of Some Problems in Modal and Intuitionistic Calculi.- Goal-Directed Calculi for Godel-Dummett Logics.- A Logic for Probability in Quantum Systems.- A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory.- The Epsilon Calculus.- Modular Semantics and Logics of Classes.- Validity of CTL Queries Revisited.- Calculi of Meta-variables.- Henkin Models of the Partial ?-Calculus.- Nominal Unification.- Friends or Foes? Communities in Software Verification.- More Computation Power for a Denotational Semantics for First Order Logic.- Effective Model Completeness of the Theory of Restricted Pfaffian Functions.- Effective Quantifier Elimination over Real Closed Fields.- Fast Infinite-State Model Checking in Integer-Based Systems.- Winning Strategies and Synthesis of Controllers.- Logical Relations for Dynamic Name Creation.
Series Title: Lecture notes in computer science, 2803
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/464864474>
library:oclcnum"464864474"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:contributor
schema:contributor
schema:datePublished"2003"
schema:exampleOfWork<http://worldcat.org/entity/work/id/840567016>
schema:inLanguage"en"
schema:isPartOf
schema:name"Computer science logic : 17th international workshop, CSL 2003, 12th annual conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003 : proceedings"
schema:publication
schema:publisher
schema:workExample
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.