Proof complexity / | NDL Search | National Diet Library

Proof complexity /

Material type: 図書

Author: -

Publisher: Cambridge University Press,

Publication date: 2019,

Material Format: Paper

Capacity, size, etc.: xiv, 516 pages ; ; 24 cm.

Collection: -

View All

Notes on use

Note (General)：: Concepts and problems -- Frege systems -- Sequent calculus -- Quantifed propositional calculus -- Resolution -- Algebraic and geometric proof systems ...

Search by Bookstore

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

Kanto

東京都立中央図書館
Paper
Call No.：
410.8-E56-E1-170
Book Registration Number：
7111986385
東京都立中央図書館

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Paper

Material Type: 図書
ISBN: 1108416845 (hardcover ; alkaline paper)
9781108416849 (hardcover ; alkaline paper)
Title: Proof complexity /
Publication, Distribution, etc.: Cambridge, United Kingdom ; : Cambridge University Press,
Publication Date: 2019,
Extent: xiv, 516 pages ; ; 24 cm.
Contributor: Jan Krajíček, Charles University, Prague.
Text Language Code: eng
NDC 10th ed.: 410.8 : Mathematics
410.96 : Mathematics
Target Audience: 一般
Note (General): Concepts and problems -- Frege systems -- Sequent calculus -- Quantifed propositional calculus -- Resolution -- Algebraic and geometric proof systems -- Further proof systems -- Basic example of the correspondence between theories and proof systems -- 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.
Availability: 閲可/個否/協可
Holding library: 東京都立中央図書館
Note (Library): 所蔵場所 : 2F開
301
Call No.: 410.8-E56-E1-170
Data Provider (Database): 東京都立中央図書館 : 公共図書館蔵書
Bibliographic ID (SomokuID): 1352037299
7111986385
OCLC No.: 2018042527
https://www.worldcat.org/oclc/2018042527
(OCoLC)1045390825
https://www.worldcat.org/oclc/(OCoLC)1045390825