Photo 1/1
![Arithmétique, théorie des preuves et complexité informatique (Oxford L - Photo 1/1](https://i.ebayimg.com/images/g/V0UAAOSw5cplPHae/s-l500.jpg)
Arithmétique, théorie des preuves et complexité informatique (Oxford L-
État :
Livraison :
Lieu où se trouve l'objet : NY, États-Unis
Délai de livraison :
Estimé entre le lun. 1 juil. et le sam. 6 juil. à 43230
Retours :
Retour sous 30 jours. L'acheteur paie les frais de retour. Afficher les détails- pour en savoir plus sur les retours
Paiements :
Achetez en toute confiance
Détails sur le vendeur
- 98 % d'évaluations positives
Inscrit comme vendeur professionnel
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :394963968035
Caractéristiques de l'objet
- État
- 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
- Item Weight
- 28.6 Oz
- Item Width
- 6.4 in
- Number of Pages
- 442 Pages
À propos de ce produit
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
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
20
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
23
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.
Copyright Date
1993
ebay_catalog_id
4
Description de l'objet fournie par le vendeur
Informations sur le vendeur professionnel
WRAP Ltd
Mubin Ahmed
2 Lester Way
Wallingford
OX10 9TA
United Kingdom
Numéro de TVA :
- GB 724498118
Numéro d'immatriculation de la société :
- 03800600
Je certifie que toutes mes activités de vente seront conformes à toutes les lois et réglementations de l'UE.
Numéro CRN :
- 03800600
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :394963968035
Livraison et expédition
Lieu où se trouve l'objet :
NY, États-Unis
Destination :
Monde entier
Exclus :
Afrique du Sud, Alaska/Hawaï, Argentine, Barbade, Brésil, Chine, Guadeloupe, Guyane, Irlande, Libye, Martinique, Mexique, Nouvelle-Calédonie, Polynésie française, Porto Rico, Royaume-Uni, Russie, Réunion, Ukraine, Venezuela
Livraison et expédition | à | Service | Livraison*Afficher les instructions de livraison |
---|---|---|---|
Livraison gratuite | États-Unis | Economique (USPS Media MailTM) | Estimé entre le lun. 1 juil. et le sam. 6 juil. à 43230 |
Délai d'expédition |
---|
Envoi sous 2 jours ouvrés après réception du paiement. |
Taxes |
---|
Des taxes pourront être appliquées lors de la finalisation de l'achat. En savoir plusEn savoir plus sur le paiement des taxes sur les achats eBay |
Taxe de vente pour l'objet n°394963968035
Taxe de vente pour l'objet n°394963968035
Le vendeur facture une taxe de vente pour les États suivants :
État | Taux de la taxe de vente |
---|
Conditions de retour
Une fois l'objet reçu, contactez le vendeur dans un délai de | Mode de remboursement | Frais de retour |
---|---|---|
30 jours | Remboursement | L'acheteur paie les frais de retour |
Cliquez iciici pour en savoir plus sur les retours. Pour les transactions répondant aux conditions requises, vous êtes couvert par la Garantie client eBay si l'objet que vous avez reçu ne correspond pas à la description fournie dans l'annonce.
L'acheteur doit payer les frais de retour.
Détails des conditions de retour |
---|
Retours acceptés |
Détails du paiement
Modes de paiement
Remarque : il se peut que certains modes de paiement ne soient pas disponibles lors de la finalisation de l'achat en raison de l'évaluation des risques associés à l'acheteur.
Catégories populaires de cette Boutique
Inscrit comme vendeur professionnel
Évaluations en tant que vendeur (515 113)
m***m (498)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
Thanks
e***t (198)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
Great!
n***n (2156)- Évaluations laissées par l'acheteur.
Dernier mois
Achat vérifié
Excellent
Notes et avis sur le produit
Rédigez un avis en premier.
Découvrir d'autres objets :
- Cours de langues Oxford University Press,
- Cours de langues Oxford University Press, en anglais,
- Manuels et guides scolaires Oxford University Press,
- Cours de langues poche Oxford University Press,
- Manuels scolaires Oxford University Press pour adulte et université,
- Manuels et guides scolaires Oxford University Press, en anglais,
- Manuels scolaires, d'éducation et références Oxford University Press, en anglais,
- Manuels scolaires, d'éducation et références poche Oxford University Press,
- Manuels scolaires poche Oxford University Press pour adulte et université,
- Manuels scolaires, d'éducation et références 2010-maintenant Oxford University Press