The field of weak arithmetics is an application of logical
methods to number theory that was developed by mathematicians,
philosophers, and theoretical computer scientists. In this volume,
after a general presentation of weak arithmetics, the following
topics are studied: the properties of integers of a real closed
field equipped with exponentiation; conservation results for the
induction schema restricted to first-order formulas with a finite
number of alternations of quantifiers; a survey on a class of tools
called pebble games; the fact that the reals "e" and pi have
approximations expressed by first-order formulas using bounded
quantifiers; properties of infinite pictures depending on the
universe of sets used; a language that simulates in a sufficiently
nice manner all algorithms of a certain restricted class; the
logical complexity of the axiom of infinity in some variants of set
theory without the axiom of foundation; and the complexity to
determine whether a trace is included in another one.
General
| Imprint: |
Centre for the Study of Language & Information
|
| Country of origin: |
United States |
| Series: |
Lecture Notes |
| Release date: |
December 2009 |
| First published: |
December 2009 |
| Editors: |
Patrick Cegielski
|
| Dimensions: |
229 x 152 x 1mm (L x W x T) |
| Format: |
Paperback
|
| Pages: |
221 |
| Edition: |
New |
| ISBN-13: |
978-1-57586-602-4 |
| Categories: |
Books >
Science & Mathematics >
Mathematics >
Number theory >
General
Promotions
|
| LSN: |
1-57586-602-1 |
| Barcode: |
9781575866024 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!