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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
0 Preliminaries.- 0.1 Languages, structures, algebras, and graphs.- 0.2 Decidability and interpretability.- 0.3 Varieties.- 0.4 Abelian and solvable algebras.- 0.5 Special kinds of varieties.- 0.6 Tame congruence theory.- 0.7 Definable relations in subdirect powers.- 1 Preview: The three sub varieties.- I: Structured Varieties.- 2: a property of the center.- 3: Centerless algebras.- 4: The discriminator subvariety.- 5: The Abelian subvariety.- 6: Transfer principles.- Summary of Part I.- II: Structured Abelian Varieties.- 7: Strongly solvable varieties.- 8: More transfer principles.- 9: Consequences of the transfer principles.- 10: Three interpretations.- 11: From strongly Abelian to essentially unary varieties.- 12: The unary case.- III: The Decomposition.- 13: The decomposition theorem.- 14: Conclusion.- Notation.
Book by McKenzie Ralph Valeriote Matthew
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 7,00 per la spedizione da Germania a Italia
Destinazione, tempi e costiEUR 10,43 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: Antiquariat Bookfarm, Löbnitz, Germania
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. Codice articolo 2508838
Quantità: 1 disponibili
Da: Antiquariat Bookfarm, Löbnitz, Germania
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. Codice articolo 2502730
Quantità: 1 disponibili
Da: Book Bear, West Brookfield, MA, U.S.A.
Cloth. Condizione: Very Good. 212 pp. Tightly bound. Corners not bumped. Text is Free of Markings. No ownership markings. Codice articolo 025649
Quantità: 1 disponibili
Da: Buchpark, Trebbin, Germania
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 216 | Sprache: Englisch | Produktart: Bücher. Codice articolo 581532/12
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780817634391_new
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Codice articolo 458444285
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 529. Codice articolo C9780817634391
Quantità: Più di 20 disponibili
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: 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. Codice articolo ABNR-92733
Quantità: 1 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-129657
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: 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. Codice articolo 9780817634391
Quantità: 2 disponibili