Arithmetic, Proof Theory, and Computational Complexity (Hardcover)

Lingua: inglese

Editore: Oxford University Press, Oxford, 1993

0198536909 / 9780198536901

Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail

Venditore con 5 stelle

Venditore AbeBooks dal 12 ottobre 2005

Rilegato

Condizione: Nuovo

EUR 136,68

 Spedizione gratuita 
Spedito in U.S.A.

Quantità: 1 disponibile

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

Hardcover. This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. Issuing from a two-year NSF and Czech Academy of Sciences grant supporting a month-long workshop and 3-day conference in San Diego (1990) and Prague (1991), the book contains refereed articles concerning the existence of themost general unifier, a special case of Kreisel's conjecture on length-of-proof, propositional logic proof size, a new alternating logtime algorithm for boolean formula evaluation and relation tobranching programs, interpretability between fragments of arithmetic, feasible interpretability, provability logic, open induction, Herbrand-type theorems, isomorphism between first and second order bounded arithmetics, forcing techniques in bounded arithmetic, ordinal arithmetic in *L *D o . Also included is an extended abstract of J P Ressayre's new approach concerning the model completeness of the theory of real closed expotential fields. Additional features of the book include(1) the transcription and translation of a recently discovered 1956 letter from K Godel to J von Neumann, asking about a polynomial time algorithm for the proof in k-symbols of predicate calculus formulas(equivalent to the P-NP question), (2) an OPEN PROBLEM LIST consisting of 7 fundamental and 39 technical questions contributed by many researchers, together with a bibliography of relevant references. A consideration of Logical Complexity Theory, the study of bounded arithmetic, propositional proof systems, length of proof, etc, and relations to computational complexity theory. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Codice articolo 9780198536901

Titolo
Arithmetic, Proof Theory, and Computational Complexity (Hardcover)
Autore
Peter Clote
Editore
Oxford University Press, Oxford
Anno di pubblicazione
1993
Condizione
new
Rilegatura
Hardcover
Lingua
inglese
ISBN 10
0198536909
ISBN 13
9780198536901

Grand Eagle Retail

Bensenville, IL, U.S.A.

Venditore con 5 stelle

Venditore AbeBooks dal 12 ottobre 2005

Tariffe di spedizione nazionale per U.S.A.

ArticoloDa 6 a 14 giorni lavorativiDa 6 a 16 giorni lavorativi
Primo articoloEUR 0,00EUR 0,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Informazioni sull’azienda del venditore

APOLLO ONLINE CORP.

605 Geddes Street
Wilmington, DE U.S.A. 19805