Rigidity is undecidable

DOI10.1017/S096012951300087XMaRDI QIDQ5740405zbMATH OpenOpenAlexFDO

Authors Mikołaj Bojańczyk, Stanisław Szawiel, Marek Zawadowski

Publication date 26 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.4906

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Equational classes, universal algebra in model theory (03C05)

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

Cites work

• Connected limits, familial representability and Artin glueing
• Corrigenda for Connected limits, familial representability and Artin glueing
• Recursive unsolvability of a problem of Thue

Cited in

(1)

• scientific article; zbMATH DE number 733392 (Why is no real title available?)

This page was built for publication: Rigidity is undecidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740405)