Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Library
Years
Person/Organisation
Subjects(RVK)
Access
  • 1
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almahu_9948233176202882
    Format: 1 online resource (xiv, 516 pages) : , digital, PDF file(s).
    ISBN: 9781108242066 (ebook)
    Series Statement: Encyclopedia of mathematics and its applications ; 170
    Content: Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.
    Note: Title from publisher's bibliographic system (viewed on 22 Mar 2019). , Concepts and problems -- Frege systems -- Sequent calculus -- Quantifed propositional calculus -- Resolution -- Algebraic and geometric proof systems -- Further proof systems -- Basic example of the correspondence -- Two worlds of bounded arithmetic -- Up to EF via the 〈...〉 translation -- Examples of upper bounds and p-simulations -- Beyond EF via the || ... || translation -- R and R-like proof systems -- LKD+1/2 and combinatorial restrictions -- Fd and logical restrictions -- Algebraic and geometric proof systems -- Feasible interpolation: a framework -- Feasible interpolation: applications -- Hard tautologies -- Model theory and lower bounds -- Optimality -- The nature of proof complexity.
    Additional Edition: Print version: ISBN 9781108416849
    Language: English
    Subjects: Mathematics
    RVK:
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Cambridge :Cambridge University Press,
    UID:
    almahu_BV046411033
    Format: xiv, 516 Seiten.
    ISBN: 978-1-108-41684-9
    Series Statement: Encyclopedia of mathematics and its applications 170
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-1-108-24206-6
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Beweistheorie ; Komplexitätstheorie
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9781108241366?
Did you mean 9781108002066?
Did you mean 9781108042666?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages