On elimination of cut-type rules from Robinson and Presburger axiomatic systems
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part IV, Tome 20 (1971), pp. 186-199
Cet article a éte moissonné depuis la source Math-Net.Ru
There are investigated possibilities of elimination of the cut-rule (cut-formulas being subformulas of axioms) in sequenzenformulation of the systems mentioned in the title. For the Robinson system it proves possible to eliminate cut-rule entirely (and consequently to obtain a new proof of its consistency).
@article{ZNSL_1971_20_a17,
author = {A. Y. Plushkevichene},
title = {On elimination of cut-type rules from {Robinson} and {Presburger} axiomatic systems},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {186--199},
year = {1971},
volume = {20},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1971_20_a17/}
}
A. Y. Plushkevichene. On elimination of cut-type rules from Robinson and Presburger axiomatic systems. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part IV, Tome 20 (1971), pp. 186-199. http://geodesic.mathdoc.fr/item/ZNSL_1971_20_a17/