Cargando…

Elementary induction on abstract structures /

Provability, Computability and Reflection.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Moschovakis, Yiannis N.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Amsterdam : New York : North-Holland Pub. Co. ; American Elsevier Pub. Co., 1974.
Colección:Studies in logic and the foundations of mathematics ; v. 77.
Temas:
Acceso en línea:Texto completo
Texto completo
Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 SCIDIR_ocn428101583
003 OCoLC
005 20231117032826.0
006 m o d
007 cr cn|||||||||
008 090728s1974 ne ob 001 0 eng d
040 |a OPELS  |b eng  |e pn  |c OPELS  |d OCLCQ  |d E7B  |d N$T  |d OCLCQ  |d OPELS  |d OCLCF  |d YDXCP  |d OCLCQ  |d DEBSZ  |d LEAUB  |d VLY  |d S2H  |d OCLCO  |d INARC  |d OCLCQ  |d OCLCO 
019 |a 649907633  |a 1162532319 
020 |a 9780080954875  |q (electronic bk.) 
020 |a 0080954871  |q (electronic bk.) 
020 |a 1283525720 
020 |a 9781283525725 
020 |a 9786613838179 
020 |a 6613838179 
020 |z 9780444105370 
020 |z 0444105379 
035 |a (OCoLC)428101583  |z (OCoLC)649907633  |z (OCoLC)1162532319 
050 4 |a QA9.615  |b .M67 1974 
055 3 |a QA248.5  |b M67 
072 7 |a MAT  |x 000000  |2 bisacsh 
082 0 4 |a 511/.2  |2 22 
084 |a 31.10  |2 bcl 
084 |a P 64  |2 blsrissc 
084 |a 03C99  |2 msc 
084 |a 03D55  |2 msc 
100 1 |a Moschovakis, Yiannis N. 
245 1 0 |a Elementary induction on abstract structures /  |c Yiannis N. Moschovakis. 
260 |a Amsterdam :  |b North-Holland Pub. Co. ;  |a New York :  |b American Elsevier Pub. Co.,  |c 1974. 
300 |a 1 online resource (x, 218 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Studies in logic and the foundations of mathematics ;  |v v. 77 
504 |a Includes bibliographical references and index. 
588 0 |a Print version record. 
505 0 |a Front Cover; Elementary Induction on Abstract Structures; Copyright Page; Preface; CONTENTS; Introduction; Chapter 1. Positive elementary inductive deflnitions; 1A. Monotone operators; 1B. Relative positive inductive definability; 1C. Combining inductions; 1D. Inductive definability on a structure; Exercises; Chapter 2. The stages of an inductive definition; 2A. The Stage Comparison Theorem; 2B. Closure ordinals and the Closure Theorem; Exercises; Chapter 3. Structure theory for inductive relations; 3A. Inductive norms and the Prewellordering Theorem; 3B. Making hyperelementary selections 
505 8 |a 3C. The Boundedness and Covering Theorems. 3D. Expanding a structure by an inductive relation; 3E. Generalization of the theory to richer languages; Exercises; Chapter 4. Games and game quantifiers; 4A. Interpreting quantifier strings via games; 4B. A canonical form for positive formulas; 4C. Explicit formulas for inductive relations; Exercises; Chapter 5. Acceptable structures; 5A. Coding schemes; 5B. Satisfaction is hyperelementary; 5C. The quantifier G; 5D. Parametrizations and universal sets; Exercises; Chapter 6. Inductive second order relations 
505 8 |a 6A. Relativization of inductive definitions examples; 6B. Transitivity, Substitutivity and Positive Induction Completeness; 6C. Extension of the theory to second order relations; 6D. The class of hyperelementary relations; Exercises; Chapter 7. Second order characterizations; 7A. Inductive and S1 1 relations; 7B. Quasistrategies; 7C. The Second Stage Comparison Theorem; 7D. The Abstract Spector-Gandy Theorem; 7E. The hierarchy of hyperelementary sets; 7F. Model theoretic characterizations; Exercises; Chapter 8. Countable acceptable structures; 8A. The Abstract Kleene Theorem 
505 8 |a 8B. The Perfect Set Theorem8C. The intersection of U-models of second order comprehension; 8D. Counterexamples to special properties of arithmetic; the language L?1,G; 8E. The Suslin-Kleene Theorem; Exercises; Chapter 9. The next admissible set; 9A. Spector classes of relations; 9B. Examples of Spector classes; 9C. Structure theory for Spector classes; 9D. Admissible sets; 9E. The companion of a Spector class; 9F. The next admissible set; Exercises; References; Index; Index of symbols 
520 |a Provability, Computability and Reflection. 
546 |a English. 
650 0 |a Recursive functions. 
650 0 |a Induction (Mathematics) 
650 6 |a Induction (Math�ematiques)  |0 (CaQQLa)201-0049218 
650 6 |a Fonctions r�ecursives.  |0 (CaQQLa)201-0024594 
650 7 |a MATHEMATICS  |x General.  |2 bisacsh 
650 7 |a Induction (Mathematics)  |2 fast  |0 (OCoLC)fst00970742 
650 7 |a Recursive functions  |2 fast  |0 (OCoLC)fst01091984 
650 7 |a Recursive functions.  |2 nli 
650 7 |a Induction (Mathematics)  |2 nli 
776 0 8 |i Print version:  |a Moschovakis, Yiannis N.  |t Elementary induction on abstract structures.  |d Amsterdam : North-Holland Pub. Co. ; New York : American Elsevier Pub. Co., 1974  |z 0444105379  |z 9780444105370  |w (DLC) 73079100  |w (OCoLC)1087957 
830 0 |a Studies in logic and the foundations of mathematics ;  |v v. 77. 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/book/9780444105370  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/bookseries/0049237X/77  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/publication?issn=0049237X&volume=77  |z Texto completo