Arithmetic, proof theory, and computational complexity, edited by Peter Clote and Jan Krajíček

Resource Information

The instance Arithmetic, proof theory, and computational complexity, edited by Peter Clote and Jan Krajíček represents a material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.

Image

http://covers.openlibrary.org/b/isbn/9780198536901-M.jpg?default=false

Label

Arithmetic, proof theory, and computational complexity, edited by Peter Clote and Jan Krajíček

Statement of responsibility

edited by Peter Clote and Jan Krajíček

Instantiates

• Arithmetic, proof theory, and computational complexity

Publication

• Oxford England, Clarendon Press, New York, Oxford University Press, ©1993

Bibliography note

Includes bibliographical references

Carrier category

volume

Carrier category code

• nc

Carrier MARC source

rdacarrier

Content category

text

Content type code

• txt

Content type MARC source

rdacontent

Contents

Note on the existence of most general semi-unifiers / Matthias Baaz -- Kreisel's conjecture for L[backwards E]1 (including a postscript by Georg Kreisel) / Matthias Baaz and Pavel Pudlák -- Number of symbols in Frege proofs with and without the deduction rule / Maria Luisa Bonet -- Algorithm for Boolean formula evaluation and for tree contraction / Samuel R. Buss -- Provably total functions in bounded arithmetic theories R3, U2 and V2 / Samuel R. Buss, Jan Krajíc̆ek and Gaisi Takeuti -- On polynomial size Frege proofs of certain combinatorial principles / Peter Clote -- Interpretability and fragments of arithmetic / Petr Hájek -- Abbreviating proofs using metamathematical rules / Petr Hájek, Franco Montagna and Pavel Pudlák -- Open induction, Tennenbaum phenomena, and complexity theory / Richard Kaye -- Using Herbrand-type theorems to separate strong fragments of arithmetic / Richard Kaye -- An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic / Alexander A. Razborov -- Integer parts of real closed exponential fields (extended abstract) / Jean-Pierre Ressayre -- Making infinite structures finite in models of second order bounded arithmetic / Søren Riis -- Ordinal arithmetic in I[triangle]0 / Richard Sommer -- RSUV isomorphism / Gaisi Takeuti -- Feasible interpretability / Rineke Verbrugge

Dimensions

25 cm.

Extent

xii, 428 pages

Isbn

9780198536901

Lccn

92041659

Media category

unmediated

Media MARC source

rdamedia

Media type code

• n

Other physical details

illustrations

Record ID

99184900760001161

System control number

• (OCoLC)27070235
• (OCoLC)ocm27070235