Cargando…
Logic Colloquium '95 : proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9-18, 1995 /
Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, covering classical topics of mathematical logic.
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , |
| Formato: | Electrónico Congresos, conferencias eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge : Ithaca, NY :
Cambridge University Press ; Association for Symbolic Logic,
[2016]
|
| Colección: | Lecture notes in logic ;
11. |
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Cover ; Half-title ; Series information ; Title page ; Copyright information ; Preface ; The Topics; Logic in Israel; The Participants; The Hosting Institutions; Financial Support; Teamwork; Plenary sessions; Tutorials; Plenary addresses; Special sessions; Finite model theory and computer science; Model theory; Set theory; Recursion theory; Proof theory; Non-monotonic and non-classical logic; Organizing and program committees; Program Committee; Special Session Advisors; Organizing Committee; Local Organizing Staff; Technical Support; Table of contents
- The Number of Path-Components of a Compact Subset of R[sup(n)] 0. Introduction; 1. Path-components ; 2. Statement of theorems; 3. Descriptive set theory and equivalence relations, I: Theorems of Silver and Burgess; 4. Path-components in compact subsets of R[sup(3)] ; 5. Descriptive set theory and equivalence relations, II: Stern's Theorem; 6. Theta-curves; 7. Path-components in compact subsets of R[sup(2)] ; References; Intervals Without Critical Triples; 1 Introduction; 2 Definitions and Examples; 3 The requirements N[sub(1)] ; 4 Lower Cones; 4.1 Nonbounding; 4.2 Splitting
- 4.3 Nonlow nonbounding5 The requirement P[sub())] ; 6 Upper Cones; 6.1 Upward nonbounding; 6.2 Upward and downward nonbounding; 6.3 P[sub(upharpoonleft, \S)] and lowness requirements ; References; Beyond Godel's Theorem: Turing Nonrigidity Revisited; References; Types and Indiscernibles in Finite Models; 1 Introduction; 2 Finite Variable Logics; 3 Finitary Lowenheim-Skolem Properties ; 4 Trees; 5 Indiscernibles; References; Model Theory of Modules ; References ; Noninterpretability of Infinite Linear Orders ; 1 Squares ; 2 Applications in recursion theory ; References
- Combinatorial Principles from Adding Cohen Reals 1 Introduction ; 2 The combinatorial principles ; 3 Consistency of the principles in the Cohen model ; 4 Applications ; References; Extensions of Models of PV; Introduction; 1 Preliminaries; 2 An ultrapower; 3 A compactness argument; 4 A Boolean-valued extension; 5 A construction of a counter-example function; References; Convergence Laws for Random Graphs; 1 Background; 2 Recursive Logics and Infinitary Logics; 3 Random Graphs; 4 Future Directions; References; V=L and Maximize ; 1 Naturalism; 2 Maximize and Unify; 3 Why V=L is restrictive
- 4 What goes wrongReferences; Towards a Categorical Foundation of Mathematics; 1. Introduction; 2. The universe and the language; 3. Abstract sets; 4. Functions, categories and isomorphisms; 5. A revision of category theory; 6. 2-dimensional categories; 7. Higher dimensional categories; 8. Dependent types; 9. Formal systems; 10. Equivalence in FOLDS; 11. In variance under L-equivalence; References; Strongly Minimal Sets and Geometry; 1 Strongly minimal sets and pregeometries; 2 Families of plane curves; 3 Algebraic structure; 4 Zariski geometries