Cover Image

Arithmetic, proof theory, and computational complexity /

Show other versions (1)

This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions togeth...

Full description

Bibliographic Details
Other Authors: Clote, Peter (Editor), Krajíček, Jan (Editor)
Format: eBook
Language:English
Published: Oxford : Clarendon, 2023.
Subjects:
Proof theory.
Computational complexity.
Théorie de la preuve.
Complexité de calcul (Informatique)
Computational complexity
Proof theory
Electronic books.
Online Access:Connect to the full text of this electronic book
Description
Summary:This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.
Item Description:Previously issued in print: 1993.
Physical Description:1 online resource (xii,428 pages)
ISBN:9781383025989
1383025983