Arithmetic, proof theory, and computational complexity /

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