Graduate Thesis Or Dissertation
The Undecidability of the Definability of Principal Subcongruences 公开 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
- 最新修改
- 2019-11-13
- Resource Type
- 权利声明
- Language
关联
单件
缩略图 | 标题 | 上传日期 | 公开度 | 行动 |
---|---|---|---|---|
theUndecidabilityOfTheDefinabilityOfPrincipalSubcongruence.pdf | 2019-11-13 | 公开 | 下载 |