PROFINITENESS IN FINITELY GENERATED VARIETIES IS UNDECIDABLE
DOI10.1017/jsl.2017.89zbMath1412.08006arXiv1712.09056OpenAlexW3106192713WikidataQ128776174 ScholiaQ128776174MaRDI QIDQ4647112
Michał M. Stronkowski, Anvar M. Nurakunov
Publication date: 4 January 2019
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.09056
Undecidability and degrees of sets of sentences (03D35) Stone spaces (Boolean spaces) and related structures (06E15) Equational classes, universal algebra in model theory (03C05) Products, amalgamated products, and other kinds of limits and colimits (08B25) Other topological algebraic systems and their representations (22A30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Profinite algebras and affine boundedness
- Relation formulas for protoalgebraic equality free quasivarieties; Pałasińska's theorem revisited
- The axiomatizability of topological prevarieties
- Quasivarieties with definable relative principal subcongruences
- A partially ordered space which is not a Priestley space
- Finite equational bases for finite algebras in a congruence-distributive equational class
- Para primal varieties: A study of finite axiomatizability and definable principal congruences in locally finite varieties
- Definable principal subcongruences.
- The parameterized local deduction theorem for quasivarieties of algebras and its application
- Standard topological algebras: syntactic and principal congruences and profiniteness
- The variety generated by \(\mathbb {A}(\mathcal {T})\) -- two counterexamples
- PRINCIPAL AND SYNTACTIC CONGRUENCES IN CONGRUENCE-DISTRIBUTIVE AND CONGRUENCE-PERMUTABLE VARIETIES
- THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
- THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES
- Representation of Distributive Lattices by means of ordered Stone Spaces
- The Theory of Representation for Boolean Algebras
- Simple compact topological lattices
This page was built for publication: PROFINITENESS IN FINITELY GENERATED VARIETIES IS UNDECIDABLE
