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
Citer cet article
Voir la notice du chapitre de livre 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.