Metamathematics of First-Order Arithmetic

Name: Metamathematics of First-Order Arithmetic
Brand: Springer Nature
SKU: 9783540636489
Availability: InStock

Best Price (Coupon Required):
Buy Metamathematics of First-Order Arithmetic for $126.00 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: $139.99 - $139.99

BEST PRICE

Single Product Purchase

$126.00

@ 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		$139.99	$139.99		10% OFF This deals requires coupon	$126.00		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783540636489

Condition

New

Product Description

People have always been interested in numbers, in particular the natural numbers. Of course, we all have an intuitive notion of what these numbers are. In the late 19th century mathematicians, such as Grassmann, Frege and Dedekind, gave definitions for these familiar objects. Since then the development of axiomatic schemes for arithmetic have played a fundamental role in a logical understanding of mathematics. There has been a need for some time for a monograph on the metamathematics of first-order arithmetic. The aim of the book by Hajek and Pudlak is to cover some of the most important results in the study of a first order theory of the natural numbers, called Peano arithmetic and its fragments (subtheories). The field is quite active, but only a small part of the results has been covered in monographs. This book is divided into three parts. In Part A, the authors develop parts of mathematics and logic in various fragments. Part B is devoted to incompleteness. Part C studies systems that have the induction schema restricted to bounded formulas (Bounded Arithmetic). One highlight of this section is the relation of provability to computational complexity. The study of formal systems for arithmetic is a prerequisite for understanding results such as Gdel's theorems. This book is intended for those who want to learn more about such systems and who want to follow current research in the field. The book contains a bibliography of approximately 1000 items.

Available Colors

N/A

Available Sizes

N/A