Rigidity is undecidable
Logic
2019-02-20 v1 Logic in Computer Science
Category Theory
Abstract
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
Keywords
Cite
@article{arxiv.1204.4906,
title = {Rigidity is undecidable},
author = {Mikołaj Bojanczyk and Stanisław Szawiel and Marek Zawadowski},
journal= {arXiv preprint arXiv:1204.4906},
year = {2019}
}
Comments
8 pages