Incompleteness for Higher-Order Arithmetic

Name: Incompleteness for Higher-Order Arithmetic
Brand: Springer Nature
SKU: 9789811399497
Availability: InStock

Best Price (Coupon Required):
Buy Incompleteness for Higher-Order Arithmetic for $40.50 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $44.99 - $44.99

BEST PRICE

Single Product Purchase

$40.50

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$44.99	$44.99		10% OFF This deals requires coupon	$40.50		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9789811399497

Condition

New

Product Description

Gdel's true-but-unprovable sentence from the first incompleteness theorem is purely logical in nature, i.e. not mathematically natural or interesting. An interesting problem is to find mathematically natural and interesting statements that are similarly unprovable. A lot of research has since been done in this direction, most notably by Harvey Friedman. A lot of examples of concrete incompleteness with real mathematical content have been found to date. This brief contributes to Harvey Friedman's research program on concrete incompleteness for higher-order arithmetic and gives a specific example of concrete mathematical theorems which is expressible in second-order arithmetic but the minimal system in higher-order arithmetic to prove it is fourth-order arithmetic. This book first examines the following foundational question: are all theorems in classic mathematics expressible in second-order arithmetic provable in second-order arithmetic? The author gives a counterexample for this question and isolates this counterexample from the Martin-Harrington Theorem in set theory. It shows that the statement Harrington's principle implies zero sharp" is not provable in second-order arithmetic. This book further examines what is the minimal system in higher-order arithmetic to prove the theorem Harrington's principle implies zero sharp" and shows that it is neither provable in second-order arithmetic or third-order arithmetic, but provable in fourth-order arithmetic. The book also examines the large cardinal strength of Harrington's principle and its strengthening over second-order arithmetic and third-order arithmetic.

Available Colors

N/A

Available Sizes

N/A