Rabin style speed-up of proofs: More generalized speed-up in the systems of first order logic - Softcover
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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
- PublisherLAP LAMBERT Academic Publishing
- Publication date2010
- ISBN 10 3843372551
- ISBN 13 9783843372558
- BindingPaperback
- Number of pages60
Buy New
Learn more about this copy
US$ 64.39
Shipping:
US$ 3.99
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Stock Image
Rabin style speed-up of proofs: More generalized speed-up in the systems of first order logic
Published by
LAP LAMBERT Academic Publishing
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
Softcover
Quantity: 19
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLING22Oct2817100612809
Buy New
US$ 64.39
Convert currency
Stock Image
Rabin Style Speed-Up of Proofs
Published by
LAP Lambert Academic Publishing
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783843372558_lsuk
Buy New
US$ 55.93
Convert currency
Stock Image
Rabin Style Speed-Up of Proofs
Published by
LAP Lambert Academic Publishing 2010-11
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
PF
Quantity: 10
Seller:
Rating
Book Description PF. Condition: New. Seller Inventory # 6666-IUK-9783843372558
Buy New
US$ 52.63
Convert currency
Stock Image
Rabin style speedup of proofs More generalized speedup in the systems of first order logic
Published by
LAP LAMBERT Academic Publishing
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
PAP
Quantity: > 20
Seller:
Rating
Book Description PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783843372558
Buy New
US$ 77.35
Convert currency
Seller Image
Rabin style speed-up of proofs
Published by
LAP LAMBERT Academic Publishing Nov 2010
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
Taschenbuch
Quantity: 2
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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. Seller Inventory # 9783843372558
Buy New
US$ 54.58
Convert currency
Seller Image
Rabin style speed-up of proofs : More generalized speed-up in the systems of first order logic
Published by
LAP LAMBERT Academic Publishing
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
Taschenbuch
Quantity: 1
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783843372558
Buy New
US$ 54.58
Convert currency
Stock Image
Rabin style speedup of proofs More generalized speedup in the systems of first order logic
Published by
LAP LAMBERT Academic Publishing
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
PAP
Quantity: > 20
Seller:
Rating
Book Description PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783843372558
Buy New
US$ 58.83
Convert currency
Seller Image
Rabin style speed-up of proofs
Published by
LAP LAMBERT Academic Publishing
(2010)
ISBN 10: 3843372551
ISBN 13: 9783843372558
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Chubaryan AnahitAnahit 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 Complex. Seller Inventory # 5467164
Buy New
US$ 45.72
Convert currency