Imagen 1 de 1

¿Quieres vender uno?

Véndelo tú mismo

Aritmética, teoría de pruebas y complejidad computacional (Oxford L)-

Estado:

En muy buen estado

Precio:

USD81,68

Aproximadamente76,47 EUR

Respira tranquilidad. Se aceptan devoluciones.

Envío:

Gratis Envío Económico. Ver detallespara el envío

Ubicado en: NY, Estados Unidos

Entrega:

Entrega prevista entre el lun. 1 jul. y el sáb. 6 jul. a 43230

Devoluciones:

30 días para devoluciones. El comprador paga el envío de la devolución. Ver detalles- Más información sobre devoluciones

Pagos:

Compra con confianza

Garantía al cliente de eBay

Si no recibes el artículo que has pedido, te devolvemos el dinero.

Más informaciónGarantía al cliente de eBay - se abre en una nueva ventana o pestaña

Información del vendedor

awesomebooksusa (413756)
98% de votos positivos

Registrado como vendedor profesional

Informar sobre este artículo (se abre en una nueva ventana o pestaña)

El vendedor asume toda la responsabilidad de este anuncio.

N.º de artículo de eBay:394963968035

Características del artículo

Estado: En muy buen estado: Libro que se ha leído y que no tiene un aspecto nuevo, pero que está en un ... En muy buen estado: Libro que se ha leído y que no tiene un aspecto nuevo, pero que está en un estado excelente. No hay desperfectos visibles en la tapa y se incluye sobrecubierta, si procede, para las tapas duras. Todas las páginas están en perfecto estado, sin arrugas ni roturas y no falta ninguna. El texto no está subrayado ni resaltado de forma alguna, y no hay anotaciones en los márgenes. Puede presentar marcas de identificación mínimas en la contraportada o las guardas. Muy poco usado. Consulta el anuncio del vendedor para obtener más información y la descripción de cualquier posible imperfección. Ver todas las definiciones de estadose abre en una nueva ventana o pestaña

Title: Arithmetic, Proof Theory, and Computational Complexity (Oxford L

ISBN: 9780198536901

Subject Area: Mathematics, Computers

Publication Name: Arithmetic, Proof Theory, and Computational Complexity

Publisher: Oxford University Press, Incorporated

Item Length: 9.5 in

Subject: Machine Theory, Logic, Arithmetic

Publication Year: 1993

Series: Oxford Logic Guides

Type: Textbook

Format: Hardcover

Language: English

Item Height: 1.2 in

Author: Jan Krajícek

Item Weight: 28.6 Oz

Item Width: 6.4 in

Number of Pages: 442 Pages

Acerca de este producto

Product Identifiers

Publisher

Oxford University Press, Incorporated

ISBN-10

0198536909

ISBN-13

9780198536901

eBay Product ID (ePID)

1412592

Product Key Features

Number of Pages

442 Pages

Language

English

Publication Name

Arithmetic, Proof Theory, and Computational Complexity

Subject

Machine Theory, Logic, Arithmetic

Publication Year

1993

Type

Textbook

Subject Area

Mathematics, Computers

Author

Jan Krajícek

Series

Oxford Logic Guides

Format

Hardcover

Dimensions

Item Height

1.2 in

Item Weight

28.6 Oz

Item Length

9.5 in

Item Width

6.4 in

Additional Product Features

Intended Audience

College Audience

LCCN

92-041659

Dewey Edition

Reviews

'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 of problems to work on.'Journal of Logic & Computation, June '95'This 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 of problems to work on.'Journal of Logic and Computation'The book is on the level of a graduate course, and in this is superb. A highly recommendable book.'Mededelingen van Het Wiskundig Genootschaap, September 1996, 'The book is on the level of a graduate course, and in this is superb. A highly recommendable book.'Mededelingen van Het Wiskundig Genootschaap, September 1996, '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 of problems to work on.'Journal of Logic and Computation, June '95, 'This 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 of problems to work on.'Journal of Logic and Computation

Series Volume Number

CLASSIFICATION_METADATA

{"IsNonfiction":["No"],"IsOther":["No"],"IsAdult":["No"],"MuzeFormatDesc":["Hardcover"],"IsChildren":["No"],"Genre":["COMPUTERS","MATHEMATICS"],"Topic":["Arithmetic","Logic","Machine Theory"],"IsTextBook":["Yes"],"IsFiction":["No"]}

Illustrated

Yes

Dewey Decimal

511.3

Table Of Content

Preface1. Open Problems2. Note on the Existence of Most General Semi-unifiers3. Kreisel's Conjecture for L31 (including a postscript by George Kreisel)4. Number of Symbols in Frege Proofs with and without the Deduction Rule5. Algorithm for Boolean Formula Evolution and for Tree Contraction6. Provably Total Functions in Bounded Arithmetic Theories Ri3, Ui2 and Vi27. On Polynomial Size Frege Proofs of Certain Combinatorial Principles8. Interpretability and Fragments of arithmetic9. Abbreviating Proofs Using Metamathematical Rules10. Open Induction, Tennenbaum Phenomena, and Complexity Theory11. Using Herbrand-type Theorems to Separate Strong Fragments of Arithmetic12. An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic13. Integer Parts of Real Closed Exponential Fields (extended abstract)14. Making Infinite Structures Finite in Models of Second Order Bounded Arithmetic15. Ordinal Arithmetic in I16. RSUV Isomorphism17. Feasible Interpretability

Synopsis

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 the most 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 to branching 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 Î› Î” 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., 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, and similar themes, and the relations of these topics to computational complexity theory. Issuing from a two-year international collaboration, the book contains articles concerning the existence of the most 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 to branching 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, and 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 exponential fields. Additional features of the book include the transcription and translation of a recently discovered 1956 letter from Kurt 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); and an open problem list consisting of seven fundamental and 39 technical questions contributed by many researchers, together with a bibliography of relevant references. This scholarly work will interest mathematical logicians, proof and recursion theorists, and researchers in computational complexity., This book principally concerns the rapidly growing area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. 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., 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, and similar themes, and the relations of these topics to computational complexity theory. Issuing from a two-year international collaboration, the book contains articles concerning the existence of the most 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 to branching 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, and ordinal arithmetic in [o. Also included is an extended abstract of J.P. Ressayre's new approach concerning the model completeness of the theory of real closed exponential fields. Additional features of the book include the transcription and translation of a recently discovered 1956 letter from Kurt 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); and an open problem list consisting of seven fundamental and 39 technical questions contributed by many researchers, together with a bibliography of relevant references. This scholarly work will interest mathematical logicians, proof and recursion theorists, and researchers in computational complexity.

1993

ebay_catalog_id

Descripción del artículo del vendedor

Información de vendedor profesional

WRAP Ltd

Mubin Ahmed

2 Lester Way

Wallingford

OX10 9TA

United Kingdom

Mostrar información de contacto

:ocinórtcele oerroCku.oc.skoobemosewa@asuyabe

Número de IVA:

GB 724498118

Número de inscripción en el Registro Mercantil:

03800600

Certifico que todas mis actividades de venta cumplirán todas las leyes y reglamentos de la UE.

Número CRN:

03800600

El vendedor asume toda la responsabilidad de este anuncio.

N.º de artículo de eBay:394963968035

Envío y manipulación

Ubicación del artículo:

NY, Estados Unidos

Realiza envíos a:

Todo el mundo

Excluye:

Alaska/Hawái, Argentina, Barbados, Brasil, China, Federación Rusa, Guadalupe, Guayana Francesa, Irlanda, Libia, Martinica, México, Nueva Caledonia, Polinesia Francesa, Puerto Rico, Reino Unido, Reunión, Sudáfrica, Ucrania, Venezuela

Cambia el país:

Código postal:

Envío y manipulación	A	Servicio	Entrega*Consulta las notas de entrega
Envío gratis	Estados Unidos	Envío Económico (USPS Media MailTM)	Entrega prevista entre el lun. 1 jul. y el sáb. 6 jul. a 43230

Notas de entrega *Las fechas previstas de entrega tienen en cuenta el tiempo de manipulación del vendedor, el código postal de origen, el código postal de destino y la hora de aceptación, y dependen del servicio de envío seleccionado y de que el pago se haya hecho efectivo. Los plazos de entrega pueden variar, especialmente en épocas de mucha actividad.

Tiempo de manipulación

Normalmente, se enviará en un plazo de 2 días laborables desde que se haga efectivo el pago.

Impuestos

Puede que se apliquen impuestos durante el pago y envío. Más informaciónMás información sobre el pago de impuestos en las compras de eBay.

Impuesto de ventas del artículo 394963968035

El vendedor carga un impuesto de ventas por los artículos enviados a los siguientes estados:

Estado o provincia	Porcentaje de impuesto de ventas

* El impuesto se aplica al subtotal más gastos de envío y manipulación solo en estas comunidades

Política de devoluciones

Cuando recibas el artículo, ponte en contacto con el vendedor en un plazo de	Forma del reembolso	Gastos de envío de la devolución
30 días	Reembolso del dinero	El comprador paga el envío de la devolución

Pulsa aquíaquí para obtener más información sobre devoluciones. En las transacciones que cumplan los requisitos necesarios, estarás cubierto por la Garantía al cliente de eBay si recibiste un artículo que es distinto de la descripción que aparece en el anuncio.

El comprador es responsable de los gastos de envío de la devolución.

Detalles de la política de devoluciones
Se aceptan devoluciones

Detalles de pago

Formas de pago

Nota: como resultado de la valoración de riesgo del comprador, es posible que algunas formas de pago no estén disponibles en el proceso de Pago y envío.