Neuware - 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 atwo-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 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, 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 relevantreferences. This scholarly work will interest mathematical logicians, proof and recursion theorists, and researchers in computational complexity.

N� de ref. del art�culo 9780198536901

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Arithmetic, Proof Theory, and Computational Complexity
Editor: Clarendon Press Jun 1993
Fecha de publicaci�n: 1993
Idioma: Ingl�s
ISBN 10: 0198536909
ISBN 13: 9780198536901
Encuadernaci�n: Buch
Estado: Neu
Dimensiones: 229�mil�metros de ancho por 152 de alto por 29 de largo
Peso: 816 gramos

Acerca de

Sinopsis

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.

Cr�ticas

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)

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Das Unternehmen AHA-BUCH GmbH: Seit der Gr�ndung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisg�nstig wie m�glich ihren B�cherwunsch zu erf�llen. Unsere Firma besch�ftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine W�nsche! Auf �ber 3700 m2 Fl�che haben wir �ber 100.000 B�cher, Modernes Antiquariat und Spiele auf Lager.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

AHA-BUCH GmbH
Garlebsen 48, Einbeck, 37574, Germany

Condiciones de venta y env�o

Condiciones de venta

T�rminos y Condiciones Generales e Informaci�n del Cliente / Pol�tica de Privacidad

I. T�rminos y Condiciones Generales

� 1 Disposiciones b�sicas

(1)Los siguientes t�rminos y condiciones se aplican a todos los contratos que celebre con nosotros como proveedor (AHA-BUCH GmbH) a trav�s de las plataformas de Internet AbeBooks y/o ZVAB. A menos que se acuerde lo contrario, se objetar� la inclusi�n de cualquiera de sus propios t�rminos y condiciones utilizados por usted.
(2)Un consumidor en el sentid...

M�s informaci�n

Derecho a cancelaci�n

Condiciones de env�o

Enviamos su pedido despu�s de recibirlos
para art�culos disponibles las �ltimas 24 horas,
para art�culos con suministro nocturno a m�s tardar 48 horas.
En caso de que necesitemos pedir un art�culo a nuestro proveedor, nuestro tiempo de env�o depende de la fecha de recepci�n de los art�culos, pero los art�culos se enviar�n el mismo d�a.

Nuestro objetivo es enviar los art�culos pedidos de la manera m�s r�pida, pero tambi�n m�s eficiente y segura a nuestros clientes.

Tarifas de env�o de Alemania a Estados Unidos de America

Tarifas de env�o de Alemania a Estados Unidos de America
Cantidad del pedido	De 30 a 40 d�as h�biles	De 7 a 14 d�as h�biles
Primer art�culo	EUR 64.08	EUR 74.08

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.

Informaci�n detallada sobre el vendedor