Table of contents

Volume 51

Number 3, June 1996

Previous issue Next issue

COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY

MATHEMATICAL EVENTS

385

Contents Preface Introduction §1. On effective descriptive set theory 1.1. Spaces and sets 1.2. The classical hierarchies 1.3. Enumeration of bases 1.4. The effective hierarchy 1.5. Relationships between the classes 1.6. Uniformization, reduction, and separation 1.7. Enumeration of the classes §2. Topologies generated by effectively Suslin sets 2.1. Topology 2.2. Ensuring the non-emptiness of intersections 2.3. Some corollaries 2.4. Choquet spaces §3. First application: co-Suslin equivalence relations §4. Classification of Borel equivalence relations 4.1. Smooth relations 4.2. Glimm-Effros dichotomy 4.3. The case of closed relations 4.4. The case of non-closed relations 4.5. Embedding of E0 into E 4.6. Construction of the splitting system 4.7. Some other results §5. Decomposition of plane Borel sets 5.1. Decomposition theorem 5.2. Coding of Borel sets 5.3. Effective version of the Louveau theorem 5.4. Proof of the effective theorem 5.5. Concluding remark

Bibliography

419

Contents §1. The Suslin hypothesis SH and its reformulations §2. Research into SH up to the discovery of forcing §3. The Suslin hypothesis and forcing. The unsolvability of SH in the formal theory ZFC §4. Martin's axiom MA as the main 'auxiliary' result for a solution of SH §5. Suslin continua and their properties §6. Conditions under which there exists a solution to SH

Bibliography

439

and

Contents Introduction §1. On estimates of the first eigenvalue in a Sturm-Liouville problem §2. On other estimates for the first eigenvalue §3. On a more general Sturm-Liouville problem §4. On estimates for all the eigenvalues §5. On an estimate for the first eigenvalue of a Sturm-Liouville problem for a higher-order operator §6. On the problem of Lagrange §7. Appendix. Technical lemmas

Bibliography

509

Contents Preface §1. Introduction 1.1. Equivalences 1.2. Enumerated algebras 1.3. Specification of abstract data structures §2. Negative approximations 2.1. Criteria of recursive separability 2.2. Finitely generated algebras 2.3. Negative algebras §3. Topological aspects 3.1. Recursively separable enumerations 3.2. Separable enumerations §4. Uniformity 4.1. Equivalences 4.2. Algebras §5. Specifications 5.1. Algebraic specifications 5.2. Universal specifications 5.3. Recursive congruences §6. Positive algebras with countable congruence lattices 6.1. Noetherian case 6.2. General case §7. Some questions

Bibliography