Structure of Decidable Locally Finite Varieties: 79 (Progress in Mathematics) - Hardcover

Valeriote, Matthew; McKenzie, Ralph

 
9780817634391: Structure of Decidable Locally Finite Varieties: 79 (Progress in Mathematics)
Hardcover
ISBN 10: 0817634398 ISBN 13: 9780817634391
Verlag: Birkhäuser, 1989

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Birkhäuser
Erscheinungsdatum
1989
Sprache
Englisch
ISBN 10 
0817634398
ISBN 13 
9780817634391
Einband
Tapa dura
Anzahl der Seiten
228
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar

Weitere beliebte Ausgaben desselben Titels

9781461289081: Structure of Decidable Locally Finite Varieties: 79 (Progress in Mathematics)

Vorgestellte Ausgabe

ISBN 10:  1461289084 ISBN 13:  9781461289081
Verlag: Birkhäuser, 2011
Softcover