Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_BV017430834
    Format: XII, 590 S.
    ISBN: 3-540-40801-0
    Series Statement: Lecture notes in computer science 2803
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    RVK:
    Keywords: Theoretische Informatik ; Logik ; Programmierlogik ; Logische Programmierung ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Author information: Baaz, Matthias, 1960-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9947920716902882
    Format: XII, 596 p. , online resource.
    ISBN: 9783540452201
    Series Statement: Lecture Notes in Computer Science, 2803
    Content: This book constitutes the joint refereed proceedings of the 17th International Workshop on Computer Science Logic, CSL 2003, held as the 12th Annual Conference of the EACSL and of the 8th Kurt Gödel Colloquium, KGC 2003 in Vienna, Austria, in August 2003. The 30 revised full papers presented together with abstracts of 9 invited presentations were carefully reviewed and selected from a total of 112 submissions. All current aspects of computer science logic are addressed ranging from mathematical logic and logical foundations to the application of logics in various computing aspects.
    Note: 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 Gödel’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 Gödel-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.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540408017
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_749172193
    Format: Online-Ressource (XII, 589 p. Also available online) , digital
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9783540452201 , 3540408010 , 9783540408017
    Series Statement: Lecture Notes in Computer Science 2803
    Content: This book constitutes the joint refereed proceedings of the 17th International Workshop on Computer Science Logic, CSL 2003, held as the 12th Annual Conference of the EACSL and of the 8th Kurt Gödel Colloquium, KGC 2003 in Vienna, Austria, in August 2003. The 30 revised full papers presented together with abstracts of 9 invited presentations were carefully reviewed and selected from a total of 112 submissions. All current aspects of computer science logic are addressed ranging from mathematical logic and logical foundations to the application of logics in various computing aspects
    Additional Edition: ISBN 9783540408017
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662185407
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540408017
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almahu_9948621662002882
    Format: XII, 596 p. , online resource.
    Edition: 1st ed. 2003.
    ISBN: 9783540452201
    Series Statement: Lecture Notes in Computer Science, 2803
    Content: This book constitutes the joint refereed proceedings of the 17th International Workshop on Computer Science Logic, CSL 2003, held as the 12th Annual Conference of the EACSL and of the 8th Kurt Gödel Colloquium, KGC 2003 in Vienna, Austria, in August 2003. The 30 revised full papers presented together with abstracts of 9 invited presentations were carefully reviewed and selected from a total of 112 submissions. All current aspects of computer science logic are addressed ranging from mathematical logic and logical foundations to the application of logics in various computing aspects.
    Note: 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 Gödel'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 Gödel-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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662185407
    Additional Edition: Printed edition: ISBN 9783540408017
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    kobvindex_ZLB13534421
    Format: XII, 590 Seiten , graph. Darst.
    Edition: 1
    ISBN: 3540408010
    Series Statement: Lecture notes in computer science 2803
    Note: Text engl.
    Language: English
    Keywords: Theoretische Informatik ; Logik ; Kongress ; Wien 〈2003〉 ; Programmierlogik ; Kongress ; Wien 〈2003〉 ; Logische Programmierung ; Kongress ; Wien 〈2003〉 ; Kongress ; Konferenzschrift
    Author information: Baaz, Matthias
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    b3kat_BV017430834
    Format: XII, 590 S.
    ISBN: 3540408010
    Series Statement: Lecture notes in computer science 2803
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    RVK:
    Keywords: Theoretische Informatik ; Logik ; Programmierlogik ; Logische Programmierung ; Konferenzschrift
    Author information: Baaz, Matthias 1960-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783520608017?
Did you mean 9783540208037?
Did you mean 9783540338017?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages