KeywordsPowerful Type Type Reduction
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.M. Benda, “Remarks on countable models,” fund. Math.,81, No. 2, 107–119 (1974).Google Scholar
- 2.A. Pillay, “133-1 over a predicate,” Notre Dame J. Formal Logic,24, No. 3, 527–536 (1983).Google Scholar
- 3.W. Hodges, I. H. Hodkinson, and D. Macpherson, “Omega-categoricity, relative categoricity and coordinatisation,” Ann. Pure Appl. Log.,46, No. 2, 169–200 (1990).Google Scholar
- 4.A. Pillay, A Note on One-Based Theories, Preprint, University of Notre Dame (1989).Google Scholar
- 5.S. V. Sudoplatov, “Powerful types in small theories,” Sib. Mat. Zh.,31, No. 4, 118–128 (1990).Google Scholar
- 6.S. V. Sudoplatov, Basedness in Plane-Predicate Theories and Theories without Semicontours, Dep. VINITI 15.01.91, No. 245-13 91, Novosibirsk (1990).Google Scholar
- 7.S. V. Sudoplatov, Powerful Types and the Property of Reduction, in 9th All-Union Conference on Mathematical Logic, Leningrad, Sept., 1988: Thesis Report, Nauka, Leningrad (1988).Google Scholar
- 8.Handbook of Mathematical Logic. Part 1: Model Theory [in Russian], Nauka, Moscow (1982).Google Scholar
- 9.F. Harary, Graph Theory, Addison-Wesley, Reading, MA (1969).Google Scholar
- 10.S. Shelah, Classification Theory and the Number of Non-Isomorphic Models, North-Holland, Amsterdam (1978).Google Scholar
- 11.H. Herre, A. H. Mekler, and K. W. Smith, “Superstable graphs,” Fund. Math.,118, No. 2 75–79 (1983).Google Scholar
- 12.V. Harnik and L. Harrington, “Fundamentals of forking,” Ann. Pure and Appl. Log.,26, No. 3, 245–286 (1984).Google Scholar
© Plenum Publishing Corporation 1992