This chapter examines substructure lattices, with emphasis on how to obtain models with specific finite lattices as substructure lattices. The finite distributive lattice case is presented in full. The general technique involving canonical partition properties using congruence lattices and theorems such as the Hales-Jewett theorem is described and applied. Wilkie's theorem for the pentagon lattice and Paris' theorem for all countable distributive lattices are also presented.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.