Pages that link to "Item:Q3399189"
From MaRDI portal
The following pages link to The existence of a near-unanimity term in a finite algebra is decidable (Q3399189):
Displaying 15 items.
- A short introduction to clones. (Q280194) (← links)
- Bounding essential arities of term operations in finitely decidable varieties (Q494631) (← links)
- Algebraic properties and dismantlability of finite posets (Q1356527) (← links)
- The decidability of the affine completeness generation problem. (Q1771940) (← links)
- Near unanimity: An obstacle to general duality theory (Q1891279) (← links)
- Existence of cube terms in finite algebras (Q2226982) (← links)
- Finite degree clones are undecidable (Q2333801) (← links)
- Testing for edge terms is decidable (Q2351513) (← links)
- The existence of a near-unanimity function is decidable (Q2449447) (← links)
- On the (un)decidability of a near-unanimity term (Q2474099) (← links)
- Near-unanimity is decomposable (Q2496166) (← links)
- Near-Unanimity Polymorphisms on Structures with Finite Duality (Q3094924) (← links)
- (Q3333034) (← links)
- Deciding the Existence of Minority Terms (Q5118446) (← links)
- Between an <i>n</i>-ary and an <i>n</i> + 1-ary near-unanimity term (Q5871383) (← links)
