9780817634391 - Structure of Decidable Locally Finite Varieties: 79 (Progress in Mathematics) de Valeriote, Matthew; McKenzie, Ralph (13 resultados)

Cloth. Condición: Very Good. 212 pp. Tightly bound. Corners not bumped. Text is Free of Markings. No ownership markings.

Hardcover. Condición: Near Fine. Boston: Birkhauser, 1989. viii,212 pp. 23.5 x 15.5 cm. Glossy paper covered boards printed dark green with white lettering. Very light rubbing to covers consistent with minimal shelfwear. Interior is clean and unmarked. Binding firm. . Hard Cover. Near Fine.

Hardcover. 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.

Hardcover. 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.

Condición: New. In.

Condición: New. Series: Progress in Mathematics. Num Pages: 216 pages, biography. BIC Classification: PBF. Category: (G) General (US: Trade); (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 14. Weight in Grams: 1100. . 1989. Hardback. . . . .

Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condición: 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.

Condición: New. Series: Progress in Mathematics. Num Pages: 216 pages, biography. BIC Classification: PBF. Category: (G) General (US: Trade); (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 14. Weight in Grams: 1100. . 1989. Hardback. . . . . Books ship from the US and Ireland.

Gebunden. Condición: New.

Buch. Condición: 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.

Condición: 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.

Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.