Used
/
Quantity Available: 0

We're sorry; this specific copy is no longer available. AbeBooks has millions of books. We've listed similar copies below.

Rabin style speed-up of proofs: More generalized speed-up in the systems of first order logic. Bookseller Inventory #

**Synopsis:** One of the main problems of quantitative study of proofs is speed-up phenomenon, that is a situation, where two systems are compared such that some theorems have much shorter proof in one of them. For the first time such problem on the proof steps was considered for arithmetical systems by Gödel. Now many results in this field are well-known. In all of them by comparison of two systems for every recursive function ? can be pointed one formula or infinite set of formula, which has ? speed-up. We introduce the common notion of proof complexity (by analogy to Blum computational complexity), the notion of ordinary theory and formulate some conditions for any pair of theory, which are enough for possibility of the most generalized (Rabin style) speed-up, i.e. for arbitrary general recursive function ? there exists n0 such that for every n>n0 there is provable in both theories formula ??n such that its proof complexity in ?stronger? theory is no more than n and in the ?weaker? theory is greater than ?(n). Many pair systems with above conditions are considered as well as the constructive description of ?hard? provable formulas for some pair systems is given.

**About the Author:**
Anahit A. Chubaryan, Doctor of science, Professor of Mathematics, Full Professor of Department of Informatics and Applied Mathematics. Subjects: Mathematical Logic, Theory of Algorithms, Common Theory of Complexity, Proof Complexity. Major fields of Scientific Research: Proof Complexity, systems of nonclassical logic.

Title: **Rabin style speed-up of proofs: More ...**

Book Condition: **Good**

Published by
LAP Lambert Academic Publishing 2010-11-17
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
paperback
Quantity Available: > 20

Seller:

Rating

**Book Description **LAP Lambert Academic Publishing 2010-11-17, 2010. paperback. Book Condition: New. Bookseller Inventory # 9783843372558

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Quantity Available: 1

Seller:

Rating

**Book Description **Book Condition: New. Publisher/Verlag: LAP Lambert Academic Publishing | More generalized speed-up in the systems of first order logic | One of the main problems of quantitative study of proofs is speed-up phenomenon, that is a situation, where two systems are compared such that some theorems have much shorter proof in one of them. For the first time such problem on the proof steps was considered for arithmetical systems by Gödel. Now many results in this field are well-known. In all of them by comparison of two systems for every recursive function can be pointed one formula or infinite set of formula, which has speed-up. We introduce the common notion of proof complexity (by analogy to Blum computational complexity), the notion of ordinary theory and formulate some conditions for any pair of theory, which are enough for possibility of the most generalized (Rabin style) speed-up, i.e. for arbitrary general recursive function there exists n0 such that for every nn0 there is provable in both theories formula n such that its proof complexity in stronger theory is no more than n and in the weaker theory is greater than (n). Many pair systems with above conditions are considered as well as the constructive description of hard provable formulas for some pair systems is given. | Format: Paperback | Language/Sprache: english | 60 pp. Bookseller Inventory # K9783843372558

More Information About This Seller | Ask Bookseller a Question

Published by
LAP Lambert Academic Publishing
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Quantity Available: > 20

Seller:

Rating

**Book Description **LAP Lambert Academic Publishing, 2010. PAP. Book Condition: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # LQ-9783843372558

More Information About This Seller | Ask Bookseller a Question

Published by
LAP Lambert Acad. Publ. Nov 2010
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Taschenbuch
Quantity Available: 1

Seller:

Rating

**Book Description **LAP Lambert Acad. Publ. Nov 2010, 2010. Taschenbuch. Book Condition: Neu. Neuware - One of the main problems of quantitative study of proofs is speed-up phenomenon, that is a situation, where two systems are compared such that some theorems have much shorter proof in one of them. For the first time such problem on the proof steps was considered for arithmetical systems by Gödel. Now many results in this field are well-known. In all of them by comparison of two systems for every recursive function can be pointed one formula or infinite set of formula, which has speed-up. We introduce the common notion of proof complexity (by analogy to Blum computational complexity), the notion of ordinary theory and formulate some conditions for any pair of theory, which are enough for possibility of the most generalized (Rabin style) speed-up, i.e. for arbitrary general recursive function there exists n0 such that for every nn0 there is provable in both theories formula n such that its proof complexity in stronger theory is no more than n and in the weaker theory is greater than (n). Many pair systems with above conditions are considered as well as the constructive description of hard provable formulas for some pair systems is given. 60 pp. Englisch. Bookseller Inventory # 9783843372558

More Information About This Seller | Ask Bookseller a Question

Published by
LAP Lambert Acad. Publ. Nov 2010
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Taschenbuch
Quantity Available: 1

Seller:

Rating

**Book Description **LAP Lambert Acad. Publ. Nov 2010, 2010. Taschenbuch. Book Condition: Neu. Neuware - One of the main problems of quantitative study of proofs is speed-up phenomenon, that is a situation, where two systems are compared such that some theorems have much shorter proof in one of them. For the first time such problem on the proof steps was considered for arithmetical systems by Gödel. Now many results in this field are well-known. In all of them by comparison of two systems for every recursive function can be pointed one formula or infinite set of formula, which has speed-up. We introduce the common notion of proof complexity (by analogy to Blum computational complexity), the notion of ordinary theory and formulate some conditions for any pair of theory, which are enough for possibility of the most generalized (Rabin style) speed-up, i.e. for arbitrary general recursive function there exists n0 such that for every nn0 there is provable in both theories formula n such that its proof complexity in stronger theory is no more than n and in the weaker theory is greater than (n). Many pair systems with above conditions are considered as well as the constructive description of hard provable formulas for some pair systems is given. 60 pp. Englisch. Bookseller Inventory # 9783843372558

More Information About This Seller | Ask Bookseller a Question

Published by
LAP Lambert Acad. Publ. Nov 2010
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Taschenbuch
Quantity Available: 1

Seller:

Rating

**Book Description **LAP Lambert Acad. Publ. Nov 2010, 2010. Taschenbuch. Book Condition: Neu. This item is printed on demand - Print on Demand Neuware - One of the main problems of quantitative study of proofs is speed-up phenomenon, that is a situation, where two systems are compared such that some theorems have much shorter proof in one of them. For the first time such problem on the proof steps was considered for arithmetical systems by Gödel. Now many results in this field are well-known. In all of them by comparison of two systems for every recursive function can be pointed one formula or infinite set of formula, which has speed-up. We introduce the common notion of proof complexity (by analogy to Blum computational complexity), the notion of ordinary theory and formulate some conditions for any pair of theory, which are enough for possibility of the most generalized (Rabin style) speed-up, i.e. for arbitrary general recursive function there exists n0 such that for every nn0 there is provable in both theories formula n such that its proof complexity in stronger theory is no more than n and in the weaker theory is greater than (n). Many pair systems with above conditions are considered as well as the constructive description of hard provable formulas for some pair systems is given. 60 pp. Englisch. Bookseller Inventory # 9783843372558

More Information About This Seller | Ask Bookseller a Question

Published by
LAP Lambert Academic Publishing
(2016)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **LAP Lambert Academic Publishing, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9783843372558_lsuk

More Information About This Seller | Ask Bookseller a Question

Published by
LAP Lambert Academic Publishing
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Quantity Available: > 20

Seller:

Rating

**Book Description **LAP Lambert Academic Publishing, 2010. PAP. Book Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9783843372558

More Information About This Seller | Ask Bookseller a Question

Published by
LAP LAMBERT Academic Publishing
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

Used
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **LAP LAMBERT Academic Publishing, 2010. Paperback. Book Condition: Used: Good. Bookseller Inventory # SONG3843372551

More Information About This Seller | Ask Bookseller a Question

Published by
LAP Lambert Academic Publishing, Germany
(2010)

ISBN 10: 3843372551
ISBN 13: 9783843372558

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **LAP Lambert Academic Publishing, Germany, 2010. Paperback. Book Condition: New. Language: English . Brand New Book. One of the main problems of quantitative study of proofs is speed-up phenomenon, that is a situation, where two systems are compared such that some theorems have much shorter proof in one of them. For the first time such problem on the proof steps was considered for arithmetical systems by Godel. Now many results in this field are well-known. In all of them by comparison of two systems for every recursive function ? can be pointed one formula or infinite set of formula, which has ? speed-up. We introduce the common notion of proof complexity (by analogy to Blum computational complexity), the notion of ordinary theory and formulate some conditions for any pair of theory, which are enough for possibility of the most generalized (Rabin style) speed-up, i.e. for arbitrary general recursive function ? there exists n0 such that for every n>n0 there is provable in both theories formula ??n such that its proof complexity in stronger theory is no more than n and in the weaker theory is greater than ?(n). Many pair systems with above conditions are considered as well as the constructive description of hard provable formulas for some pair systems is given. Bookseller Inventory # KNV9783843372558

More Information About This Seller | Ask Bookseller a Question