On cut-type rules for calculuses of general type
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 63-76
Voir la notice de l'article provenant de la source Math-Net.Ru
The problem of the cut-elimination for calculuses of general type is formulated as the problem of strict representability by means of Post canonical systems satisfying the additional requirement: each word can be a conclusion only of a finite member of applications of rules. Possibilities of elimination and of algorithmic elimination of cut-type rules are studied.
@article{ZNSL_1974_40_a8,
author = {S. Yu. Maslov and S. A. Norgela},
title = {On cut-type rules for calculuses of general type},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {63--76},
publisher = {mathdoc},
volume = {40},
year = {1974},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a8/}
}
S. Yu. Maslov; S. A. Norgela. On cut-type rules for calculuses of general type. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 63-76. http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a8/