Rabin style speedup of proofs: More generalized speedup in the systems of first order logic,Used

Rabin style speedup of proofs: More generalized speedup in the systems of first order logic,Used

In Stock
SKU: DADAX3843372551
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$84.81
Free Standard Shipping Across USA
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 3–5 business days
  • Estimated Delivery: 6–10 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

One of the main problems of quantitative study of proofs is speedup 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 Gdel. Now many results in this field are wellknown. 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 ? speedup. 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) speedup, 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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed