Studies in Weak Arithmetics - Brossura

Brossura

ISBN 10: 1575866021 ISBN 13: 9781575866024

Casa editrice: Stanford Univ Center for the Study, 2009

Riassunto

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.

Su questo libro

Informazioni sugli autori

Patrick Cégielski is professor at Université Paris-Est Créteil-IUT de Sénart-Fontainebleau.

Patrick Cegielski, Professor at University Paris-Est Cretell-IUT de Senart Fontainebleau, is the coordinator of a European consortium of teams working on weak arithmetics, mainly from armenia, belgium, Czech Republic, Federation of Russia, France, Great Britain, Greece, Israel, Italy, Poland, Portugal, Slovakia, Spain, Tunisia, and Ukraine.

Dettagli dell'edizione

• Editore: Stanford Univ Center for the Study
• Data di pubblicazione: 2009
• Lingua: Inglese
• ISBN 10: 1575866021
• ISBN 13: 9781575866024
• Rilegatura: Copertina flessibile
• Numero di pagine: 213
• Redattore: Cegielski Patrick
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile