The Finite Type Problem for unary algebras
We solve a restricted version of the Finite Type Problem from natural duality theory: if a finite unary algebra is dualisable, then it is dualisable via a finite set of relations.
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
Bolyai Institute, University of Szeged
Szeged
2010
|
| Sorozat: | Acta scientiarum mathematicarum
76 No. 3-4 |
| Kulcsszavak: | Matematika, Algebra |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/16353 |
| LEADER | 00938nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta16353 | ||
| 005 | 20260310094749.0 | ||
| 008 | 161015s2010 hu o 000 eng d | ||
| 022 | |a 0001-6969 | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Pitkethly Jane G. | |
| 245 | 1 | 4 | |a The Finite Type Problem for unary algebras |h [elektronikus dokumentum] / |c Pitkethly Jane G. |
| 260 | |a Bolyai Institute, University of Szeged |b Szeged |c 2010 | ||
| 300 | |a 359-370 | ||
| 490 | 0 | |a Acta scientiarum mathematicarum |v 76 No. 3-4 | |
| 520 | 3 | |a We solve a restricted version of the Finite Type Problem from natural duality theory: if a finite unary algebra is dualisable, then it is dualisable via a finite set of relations. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Matematika | |
| 695 | |a Matematika, Algebra | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/16353/1/math_076_numb_003_004_359-370.pdf |z Dokumentum-elérés |