skip to content
Arithmetic, proof theory, and computational complexity Preview this item
ClosePreview this item
Checking...

Arithmetic, proof theory, and computational complexity

Author: Peter Clote; Jan Krajíček
Publisher: Oxford [England] : Clarendon Press ; New York : Oxford University Press, ©1993.
Series: Oxford logic guides, 23.; Oxford science publications.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
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  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Peter Clote; Jan Krajíček
ISBN: 0198536909 9780198536901 0820519650 9780820519654
OCLC Number: 27070235
Description: xii, 428 pages : illustrations ; 25 cm.
Contents: Note on the existence of most general semi-unifiers / Matthias Baaz --
Kreisel's conjecture for L[backwards E]₁ (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 R₃, U₂ and V₂ / 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]₀ / Richard Sommer --
RSUV isomorphism / Gaisi Takeuti --
Feasible interpretability / Rineke Verbrugge.
Series Title: Oxford logic guides, 23.; Oxford science publications.
Responsibility: edited by Peter Clote and Jan Krajíček.
More information:

Reviews

Editorial reviews

Publisher Synopsis

This book is a valuable survey of the present state of research in this fascinating domain of foundational studies. It can certainly serve as an information and reference source as well as a source Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/27070235> # Arithmetic, proof theory, and computational complexity
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "27070235" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/347522273#Place/oxford_england> ; # Oxford England
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/bewijstheorie> ; # Bewijstheorie
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/symbolische_logica> ; # Symbolische logica
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/algoritmen> ; # Algoritmen
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/complexite_de_calcul_informatique> ; # Complexité de calcul (Informatique)
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/recursie> ; # Recursie
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Thing/mathematical_logic> ; # Mathematical logic
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/complexite> ; # complexité
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/mathematics> ; # Mathematics
    schema:about <http://id.worldcat.org/fast/1078942> ; # Proof theory
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/theorie_nombre> ; # théorie nombre
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/preuve_theorie_de_la> ; # Preuve, théorie de la
    schema:about <http://dewey.info/class/511.3/e20/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/347522273#Topic/theorie_demonstration> ; # théorie démonstration
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/12378002> ; # Jan Krajíček
    schema:contributor <http://viaf.org/viaf/24671463> ; # Peter Clote
    schema:copyrightYear "1993" ;
    schema:datePublished "1993" ;
    schema:description "Note on the existence of most general semi-unifiers / Matthias Baaz -- Kreisel's conjecture for L[backwards E]₁ (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 R₃, U₂ and V₂ / 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]₀ / Richard Sommer -- RSUV isomorphism / Gaisi Takeuti -- Feasible interpretability / Rineke Verbrugge."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/347522273> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/347522273#Series/oxford_logic_guides> ; # Oxford logic guides ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/347522273#Series/oxford_science_publications> ; # Oxford science publications.
    schema:name "Arithmetic, proof theory, and computational complexity"@en ;
    schema:productID "27070235" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/27070235#PublicationEvent/oxford_england_clarendon_press_new_york_oxford_university_press_1993> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/347522273#Agent/oxford_university_press> ; # Oxford University Press
    schema:publisher <http://experiment.worldcat.org/entity/work/data/347522273#Agent/clarendon_press> ; # Clarendon Press
    schema:url <http://www.gbv.de/dms/ilmenau/toc/122326652.PDF> ;
    schema:url <http://catdir.loc.gov/catdir/enhancements/fy0605/92041659-t.html> ;
    schema:workExample <http://worldcat.org/isbn/9780198536901> ;
    schema:workExample <http://worldcat.org/isbn/9780820519654> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GB9328288> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/27070235> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Agent/clarendon_press> # Clarendon Press
    a bgn:Agent ;
    schema:name "Clarendon Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Agent/oxford_university_press> # Oxford University Press
    a bgn:Agent ;
    schema:name "Oxford University Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Place/oxford_england> # Oxford England
    a schema:Place ;
    schema:name "Oxford England" ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Series/oxford_logic_guides> # Oxford logic guides ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/27070235> ; # Arithmetic, proof theory, and computational complexity
    schema:name "Oxford logic guides ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Series/oxford_science_publications> # Oxford science publications.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/27070235> ; # Arithmetic, proof theory, and computational complexity
    schema:name "Oxford science publications." ;
    schema:name "Oxford science publications" ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Thing/mathematical_logic> # Mathematical logic
    a schema:Thing ;
    schema:name "Mathematical logic" ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Topic/complexite_de_calcul_informatique> # Complexité de calcul (Informatique)
    a schema:Intangible ;
    schema:name "Complexité de calcul (Informatique)"@en ;
    schema:name "Complexité de calcul (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Topic/preuve_theorie_de_la> # Preuve, théorie de la
    a schema:Intangible ;
    schema:name "Preuve, théorie de la"@en ;
    schema:name "Preuve, Théorie de la"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Topic/symbolische_logica> # Symbolische logica
    a schema:Intangible ;
    schema:name "Symbolische logica"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/347522273#Topic/theorie_demonstration> # théorie démonstration
    a schema:Intangible ;
    schema:name "théorie démonstration"@en ;
    .

<http://id.worldcat.org/fast/1078942> # Proof theory
    a schema:Intangible ;
    schema:name "Proof theory"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://viaf.org/viaf/12378002> # Jan Krajíček
    a schema:Person ;
    schema:familyName "Krajíček" ;
    schema:givenName "Jan" ;
    schema:name "Jan Krajíček" ;
    .

<http://viaf.org/viaf/24671463> # Peter Clote
    a schema:Person ;
    schema:familyName "Clote" ;
    schema:givenName "Peter" ;
    schema:name "Peter Clote" ;
    .

<http://worldcat.org/isbn/9780198536901>
    a schema:ProductModel ;
    schema:isbn "0198536909" ;
    schema:isbn "9780198536901" ;
    .

<http://worldcat.org/isbn/9780820519654>
    a schema:ProductModel ;
    schema:isbn "0820519650" ;
    schema:isbn "9780820519654" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.