Rigidity is undecidable

DOI10.1017/S096012951300087XzbMath1342.03014arXiv1204.4906OpenAlexW3106252756MaRDI QIDQ5740405

Stanisław Szawiel, Mikołaj Bojańczyk, Marek W. 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)

Cites Work

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

This page was built for publication: Rigidity is undecidable