Geodesic
A lower bound for the complexity of Craig's interpolants in sentinential logic.
Archiv für mathematische Logik und Grundlagenforschung, Tome 23 (1983), pp. 27-36
Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : complexity of boolean function, lower bound on complexity, Craig's interpolants, computation theory 
@article{AMLG_1983__23_138004,
     author = {Daniele Mundici},
     title = {A lower bound for the complexity of {Craig's} interpolants in sentinential logic.},
     journal = {Archiv f\"ur mathematische Logik und Grundlagenforschung},
     pages = {27--36},
     year = {1983},
     volume = {23},
     zbl = {0511.03004},
     url = {http://geodesic.mathdoc.fr/item/AMLG_1983__23_138004/}
}
TY  - JOUR
AU  - Daniele Mundici
TI  - A lower bound for the complexity of Craig's interpolants in sentinential logic.
JO  - Archiv für mathematische Logik und Grundlagenforschung
PY  - 1983
SP  - 27
EP  - 36
VL  - 23
UR  - http://geodesic.mathdoc.fr/item/AMLG_1983__23_138004/
ID  - AMLG_1983__23_138004
ER  - 
%0 Journal Article
%A Daniele Mundici
%T A lower bound for the complexity of Craig's interpolants in sentinential logic.
%J Archiv für mathematische Logik und Grundlagenforschung
%D 1983
%P 27-36
%V 23
%U http://geodesic.mathdoc.fr/item/AMLG_1983__23_138004/
%F AMLG_1983__23_138004
Daniele Mundici. A lower bound for the complexity of Craig's interpolants in sentinential logic.. Archiv für mathematische Logik und Grundlagenforschung, Tome 23 (1983), pp. 27-36. http://geodesic.mathdoc.fr/item/AMLG_1983__23_138004/