Graduate Thesis Or Dissertation
The Undecidability of the Definability of Principal Subcongruences Public Deposited
https://scholar.colorado.edu/concern/graduate_thesis_or_dissertations/h989r345z
- Abstract
- For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is undecidable. Using this, we present another proof that A. Tarski's finite basis problem is undecidable.
- Creator
- Date Issued
- 2013
- Academic Affiliation
- Advisor
- Committee Member
- Degree Grantor
- Commencement Year
- Subject
- Last Modified
- 2019-11-13
- Resource Type
- Rights Statement
- Language
Relationships
Items
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
theUndecidabilityOfTheDefinabilityOfPrincipalSubcongruence.pdf | 2019-11-13 | Public | Download |