Russell's paradox arises when we consider those sets that do not belong to themselves. The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarski's result on the undefinability of truth. Variations on the same idea yield the famous results of Gödel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Gödel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarski's Theorem to Gödel's Second Incompleteness Theorem. Exercises are scattered throughout.

*"synopsis" may belong to another edition of this title.*

US$ 22.95

**Shipping:**
FREE

From United Kingdom to U.S.A.

Published by
College Publications, United Kingdom
(2007)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **College Publications, United Kingdom, 2007. Paperback. Book Condition: New. Language: English . Brand New Book ***** Print on Demand *****.Russell s paradox arises when we consider those sets that do not belong to themselves. The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarski s result on the undefinability of truth. Variations on the same idea yield the famous results of Godel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Godel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarski s Theorem to Godel s Second Incompleteness Theorem. Exercises are scattered throughout. Bookseller Inventory # AAV9781904987345

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications
(2016)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **College Publications, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9781904987345_lsuk

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications, United Kingdom
(2007)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **College Publications, United Kingdom, 2007. Paperback. Book Condition: New. Language: English . Brand New Book ***** Print on Demand *****. Russell s paradox arises when we consider those sets that do not belong to themselves. The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarski s result on the undefinability of truth. Variations on the same idea yield the famous results of Godel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Godel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarski s Theorem to Godel s Second Incompleteness Theorem. Exercises are scattered throughout. Bookseller Inventory # AAV9781904987345

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications
(2007)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Quantity Available: > 20

Seller:

Rating

**Book Description **College Publications, 2007. 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-9781904987345

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications
(2007)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Quantity Available: > 20

Seller:

Rating

**Book Description **College Publications, 2007. 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-9781904987345

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications
(2007)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Softcover
Quantity Available: 1

Seller:

Rating

**Book Description **College Publications, 2007. Book Condition: New. This item is printed on demand for shipment within 3 working days. Bookseller Inventory # GM9781904987345

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications, United Kingdom
(2007)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **College Publications, United Kingdom, 2007. Paperback. Book Condition: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. Russell s paradox arises when we consider those sets that do not belong to themselves. The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarski s result on the undefinability of truth. Variations on the same idea yield the famous results of Godel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Godel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarski s Theorem to Godel s Second Incompleteness Theorem. Exercises are scattered throughout. Bookseller Inventory # LIE9781904987345

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications
(2017)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Paperback
Quantity Available: > 20

Seller:

Rating

**Book Description **College Publications, 2017. Paperback. Book Condition: New. Never used! This item is printed on demand. Bookseller Inventory # 1904987346

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications 2/19/2007
(2007)

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Paperback or Softback
Quantity Available: 10

Seller:

Rating

**Book Description **College Publications 2/19/2007, 2007. Paperback or Softback. Book Condition: New. Incompleteness in the Land of Sets. Book. Bookseller Inventory # BBS-9781904987345

More Information About This Seller | Ask Bookseller a Question

Published by
College Publications

ISBN 10: 1904987346
ISBN 13: 9781904987345

New
Paperback
Quantity Available: > 20

Seller:

Rating

**Book Description **College Publications. Paperback. Book Condition: New. Paperback. 156 pages. Dimensions: 9.0in. x 5.9in. x 0.5in.Russells paradox arises when we consider those sets that do not belong to themselves. The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarskis result on the undefinability of truth. Variations on the same idea yield the famous results of Gdel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Gdel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarskis Theorem to Gdels Second Incompleteness Theorem. Exercises are scattered throughout. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Bookseller Inventory # 9781904987345

More Information About This Seller | Ask Bookseller a Question