9781461289081 - structure of decidable locally finite varieties: 79 di mckenzie, ralph; valeriote, matthew (13 risultati)

Lingua: Inglese
Editore: Birkhäuser 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,62
EUR 13,88 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.

Lingua: Inglese
Editore: Springer 2013-10-04 2013
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 57,04
EUR 17,95 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Paperback. Condizione: New.

Lingua: Inglese
Editore: Birkh?user 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 68,05
EUR 10,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 15 disponibili
Condizione: New. 2011. Paperback. . . . . .

Lingua: Inglese
Editore: Springer 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 79,52
EUR 3,50 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 228.

Lingua: Inglese
Editore: Birkh?user 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 85,65
EUR 9,22 spedizioneSpedito in U.S.A.Quantità: 15 disponibili
Condizione: New. 2011. Paperback. . . . . . Books ship from the US and Ireland.

Lingua: Inglese
Editore: Birkhäuser Boston 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.

Lingua: Inglese
Editore: Birkhäuser Boston 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 58,39
EUR 61,69 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - A mathematically precise definition of the intuitive notion of 'algorithm' was implicit in Kurt Godel's [1931] paper on formally undecidable propo sitions of arithmetic. During the 1930s, in the work of such mathemati cians as Alonzo Church, Steph…en Kleene, Barkley Rosser and Alfred Tarski, Godel's idea evolved into the concept of a recursive function. Church pro posed the thesis, generally accepted today, that an effective algorithm is the same thing as a procedure whose output is a recursive function of the input (suitably coded as an integer). With these concepts, it became possible to prove that many familiar theories are undecidable (or non-recursive)-i. e. , that there does not exist an effective algorithm (recursive function) which would allow one to determine which sentences belong to the theory. It was clear from the beginning that any theory with a rich enough mathematical content must be undecidable. On the other hand, some theories with a substantial content are decidable. Examples of such decidabLe theories are the theory of Boolean algebras (Tarski [1949]), the theory of Abelian groups (Szmiele~ [1955]), and the theories of elementary arithmetic and geometry (Tarski [1951]' but Tarski discovered these results around 1930). The de termination of precise lines of division between the classes of decidable and undecidable theories became an important goal of research in this area. algebra we mean simply any structure (A, h(i E I)} consisting of By an a nonvoid set A and a system of finitary operations Ii over A.

Lingua: Inglese
Editore: Birkhäuser 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 100,25
EUR 28,97 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Lingua: Inglese
Editore: Birkhäuser 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
- Print on Demand
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 46,22
EUR 5,50 spedizioneSpedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Condizione: new. Questo è un articolo print on demand.

Lingua: Inglese
Editore: Birkhäuser, Birkhäuser Okt 2011 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A mathematically precise definition of the intuitive notion of 'algorithm' was implicit in Kurt Godel's [1931] paper on formally undecidable propo sitions of arithmetic. During the 1930s, in the work of such mathemati cians as Alon…zo Church, Stephen Kleene, Barkley Rosser and Alfred Tarski, Godel's idea evolved into the concept of a recursive function. Church pro posed the thesis, generally accepted today, that an effective algorithm is the same thing as a procedure whose output is a recursive function of the input (suitably coded as an integer). With these concepts, it became possible to prove that many familiar theories are undecidable (or non-recursive)-i. e. , that there does not exist an effective algorithm (recursive function) which would allow one to determine which sentences belong to the theory. It was clear from the beginning that any theory with a rich enough mathematical content must be undecidable. On the other hand, some theories with a substantial content are decidable. Examples of such decidabLe theories are the theory of Boolean algebras (Tarski [1949]), the theory of Abelian groups (Szmiele~ [1955]), and the theories of elementary arithmetic and geometry (Tarski [1951]' but Tarski discovered these results around 1930). The de termination of precise lines of division between the classes of decidable and undecidable theories became an important goal of research in this area. algebra we mean simply any structure (A, h(i E I)} consisting of By an a nonvoid set A and a system of finitary operations Ii over A. 228 pp. Englisch.

Lingua: Inglese
Editore: Springer 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 80,25
EUR 7,53 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 228 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.

Lingua: Inglese
Editore: Springer 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 79,87
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 228.

Lingua: Inglese
Editore: Birkhäuser, Birkhäuser Okt 2011 2011
Serie: Progress in Mathematics, Libro 9 di 170. Libro 9 di 170 - Progress in Mathematics
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -A mathematically precise definition of the intuitive notion of 'algorithm' was implicit in Kurt Godel's [1931] paper on formally undecidable propo sitions of arithmetic. During the 1930s, in the work of such mathemati cians as Alonzo C…hurch, Stephen Kleene, Barkley Rosser and Alfred Tarski, Godel's idea evolved into the concept of a recursive function. Church pro posed the thesis, generally accepted today, that an effective algorithm is the same thing as a procedure whose output is a recursive function of the input (suitably coded as an integer). With these concepts, it became possible to prove that many familiar theories are undecidable (or non-recursive)-i. e. , that there does not exist an effective algorithm (recursive function) which would allow one to determine which sentences belong to the theory. It was clear from the beginning that any theory with a rich enough mathematical content must be undecidable. On the other hand, some theories with a substantial content are decidable. Examples of such decidabLe theories are the theory of Boolean algebras (Tarski [1949]), the theory of Abelian groups (Szmiele~ [1955]), and the theories of elementary arithmetic and geometry (Tarski [1951]' but Tarski discovered these results around 1930). The de termination of precise lines of division between the classes of decidable and undecidable theories became an important goal of research in this area. algebra we mean simply any structure (A, h(i E I)} consisting of By an a nonvoid set A and a system of finitary operations Ii over A.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 228 pp. Englisch.