Geodesic
Some decidable theories with finitely many covers which are decidable and algorithmically found
Colloquium Mathematicum, Tome 67 (1994) no. 1, pp. 61-67.

Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences

In any recursive algebraic language, I find an interval of the lattice of equational theories, every element of which has finitely many covers. With every finite set of equations of this language, an equational theory of this interval is associated, which is decidable with decidable covers that can be algorithmically found. If the language is finite, both this theory and its covers are finitely based. Also, for every finite language and for every natural number n, I construct a finitely based decidable theory together with its exactly n covers which are decidable and finitely based. The construction is algorithmic.
DOI : 10.4064/cm-67-1-61-67

Cornelia Kalfa 1

1 
@article{10_4064_cm_67_1_61_67,
     author = {Cornelia Kalfa},
     title = {Some decidable theories with finitely many covers which are decidable and algorithmically found},
     journal = {Colloquium Mathematicum},
     pages = {61--67},
     publisher = {mathdoc},
     volume = {67},
     number = {1},
     year = {1994},
     doi = {10.4064/cm-67-1-61-67},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4064/cm-67-1-61-67/}
}
TY  - JOUR
AU  - Cornelia Kalfa
TI  - Some decidable theories with finitely many covers which are decidable and algorithmically found
JO  - Colloquium Mathematicum
PY  - 1994
SP  - 61
EP  - 67
VL  - 67
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.4064/cm-67-1-61-67/
DO  - 10.4064/cm-67-1-61-67
LA  - en
ID  - 10_4064_cm_67_1_61_67
ER  - 
%0 Journal Article
%A Cornelia Kalfa
%T Some decidable theories with finitely many covers which are decidable and algorithmically found
%J Colloquium Mathematicum
%D 1994
%P 61-67
%V 67
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.4064/cm-67-1-61-67/
%R 10.4064/cm-67-1-61-67
%G en
%F 10_4064_cm_67_1_61_67
Cornelia Kalfa. Some decidable theories with finitely many covers which are decidable and algorithmically found. Colloquium Mathematicum, Tome 67 (1994) no. 1, pp. 61-67. doi : 10.4064/cm-67-1-61-67. http://geodesic.mathdoc.fr/articles/10.4064/cm-67-1-61-67/

Cité par Sources :