Loop conditions

DOI10.1007/s00012-019-0631-3OpenAlexW2796460935WikidataQ114693090 ScholiaQ114693090MaRDI QIDQ2283059

Miroslav Olšák

Publication date: 27 December 2019

Published in: Algebra Universalis (Search for Journal in Brave)

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

zbMATH Keywords

loop conditionsMaltsev conditionsSiggers term

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Free algebras (08B20)

Related Items (3)

Smooth digraphs modulo primitive positive constructability and cyclic loop conditions ⋮ Loop conditions for strongly connected digraphs ⋮ The local loop lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• Some very weak identities
• Taylor term does not imply any nontrivial linear one-equality Maltsev condition
• Non-covering in the interpretability lattice of equational theories
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• The weakest nontrivial idempotent equations

This page was built for publication: Loop conditions