Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Studies in Weak Arithmetics

Name: Studies in Weak Arithmetics
Brand: Centre for the Study of Language & Information
SKU: 06256998
Price: 41.24 EUR
Availability: InStock
Author: Patrick Cegielski
ISBN: 9781575866024

Patrick Cegielski

Língua

Inglês

Livro Capa mole

Código Libristo: 06256998

Editoras Centre for the Study of Language & Information, agosto 2010

The field of weak arithmetics is an application of logical methods to number theory that was develop... Descrição completa

Código Libristo: 06256998

100 b

41.24 €

Armazenamento externo Envio em 14-20 dias

Até 30 dias para devoluções

Os clientes também compraram

Markt China Dieter Kuhn

Livro de capa dura

98.80 €

Chimie Tout-en-un MP/MP*-PT/PT* - 6e éd. Bruno Fosset

Capa mole

32.62 €

Fyzika I 2.díl Jarmila Davidová

Capa mole

4.45 €

Planning the Murder of Anne Boleyn Angus

Livro de capa dura

21.78 €

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.