2014
DOI: 10.1017/s096012951300087x
|View full text |Cite
|
Sign up to set email alerts
|

Rigidity is undecidable

Abstract: We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.Comment: 8 page

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…However, the problem of whether a finite set of linear-regular equations defines a rigid theory is undecidable (Bojańczyk et al 2014). The notion of a linear-regular theory was considered in universal algebra but the notion of a rigid theory, as well as that of a linear-regular interpretation, seems to be new.…”
Section: Introductionmentioning
confidence: 99%
“…However, the problem of whether a finite set of linear-regular equations defines a rigid theory is undecidable (Bojańczyk et al 2014). The notion of a linear-regular theory was considered in universal algebra but the notion of a rigid theory, as well as that of a linear-regular interpretation, seems to be new.…”
Section: Introductionmentioning
confidence: 99%