Complexity of index sets of computable lattices
Date
2014-08
Authors
Contributor
Advisor
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Narrator
Transcriber
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
University of Hawaii at Manoa
Volume
Number/Issue
Starting Page
Ending Page
Alternative Title
Abstract
We analyze computable algebras in the sense of universal algebra and the index set complexity of properties of such algebras. We look at the difficulty of determining properties of Con(A), the congruence lattice of an algebra A. In particular, we introduce the notion of a class of algebras witnessing the complexity of a property of algebras and show that computable lattices witness the 02-completeness of being simple, as well as witnessing the 03-completeness of having finitely many congruences. Finally, in our main result, we show that the property "to be subdirectly irreducible" is 03-complete as well, and in the process show that computable lattices witness this.
Description
Keywords
Algebras, Congruence lattices
Citation
Extent
Format
Geographic Location
Time Period
Related To
Theses for the degree of Doctor of Philosophy (University of Hawaii at Manoa). Mathematics.
Related To (URI)
Table of Contents
Rights
All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
Rights Holder
Local Contexts
Collections
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.