EUR 8,41
Quantité disponible : 1 disponible(s)
Ajouter au panierCloth. Etat : Very Good. 212 pp. Tightly bound. Corners not bumped. Text is Free of Markings. No ownership markings.
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
EUR 8,29
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 MAC 9780817634391 Sprache: Englisch Gewicht in Gramm: 550.
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
EUR 8,34
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 MAC 9780817634391 Sprache: Englisch Gewicht in Gramm: 550.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 52,33
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 58,10
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 58,10
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 56,33
Quantité disponible : 10 disponible(s)
Ajouter au panierPaperback. Etat : New.
EUR 75,59
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 228.
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
EUR 89,99
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
EUR 48,37
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : ALLBOOKS1, Direk, SA, Australie
EUR 100,83
Quantité disponible : 1 disponible(s)
Ajouter au panierBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
EUR 64,08
Quantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : New.
EUR 50,95
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Structure of Decidable Locally Finite Varieties | Ralph McKenzie (u. a.) | Taschenbuch | viii | Englisch | 2011 | Birkhäuser | EAN 9781461289081 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 97,82
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. Like New. book.
EUR 37,78
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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, 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.
Edité par Birkhauser Boston Nov 1989, 1989
ISBN 10 : 0817634398 ISBN 13 : 9780817634391
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 86,02
Quantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. 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 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.
Edité par Birkhäuser, Birkhäuser Okt 2011, 2011
ISBN 10 : 1461289084 ISBN 13 : 9781461289081
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 53,49
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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 Alonzo 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.
Edité par Springer-Verlag New York Inc., 2011
ISBN 10 : 1461289084 ISBN 13 : 9781461289081
Langue: anglais
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 67,05
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 339.
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 67,05
Quantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 529.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 78,90
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : 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.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 80,20
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND pp. 228.