Rigidity is undecidable

arxiv: 1204.4906 · v1 · pith:5CIEARWWnew · submitted 2012-04-22 · 🧮 math.LO · cs.LO· math.CT

Miko{\l}aj Bojanczyk , Stanis{\l}aw Szawiel , Marek Zawadowski This is my paper

classification 🧮 math.LO cs.LOmath.CT

keywords undecidableaxiomsdefinesfiniteproblemregular-linearrigidrigidity

0 comments

read the original abstract

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

This paper has not been read by Pith yet.