Computability of Heyting algebras and distributive lattices

Authors

Amy Turlington, University of Connecticut

Date of Completion

January 2010

Keywords

Mathematics

Degree

Ph.D.

Abstract

Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also consider special classes of distributive lattices, namely pseudocomplemented lattices and Heyting algebras. We examine the complexity of prime ideals in a computable distributive lattice, and we show that it is always possible to find a computable prime ideal in a computable distributive lattice. Furthermore, for any II⁰1 class, we prove that there is a computable (non-distributive) lattice such that the II⁰1 class can be coded into the (nontrivial) prime ideals of the lattice. We then consider the degree spectra and computable dimension of computable distributive lattices, pseudocomplemented lattices, and Heyting algebras. A characterization is given for the computable dimension of the free Heyting algebras on finitely or infinitely many generators. ^

Recommended Citation

Turlington, Amy, "Computability of Heyting algebras and distributive lattices" (2010). Doctoral Dissertations. AAI3415568.
https://digitalcommons.lib.uconn.edu/dissertations/AAI3415568