Invariant properties of systems of formulas of elementary axiomatic
Izvestiya. Mathematics , Tome 4 (1970) no. 5, pp. 965-978
Voir la notice de l'article provenant de la source Math-Net.Ru
Under a natural definition of the properties indicated in the title, we prove the undecidability of any such properties in the case of sufficiently powerful elementary theories.
In terms of invariant properties we shall formulate a general proposition which has as corollaries various results about realizable and deductively valid disjunctions of predicate formulas.
@article{IM2_1970_4_5_a0,
author = {M. M. Kipnis},
title = {Invariant properties of systems of formulas of elementary axiomatic},
journal = {Izvestiya. Mathematics },
pages = {965--978},
publisher = {mathdoc},
volume = {4},
number = {5},
year = {1970},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_1970_4_5_a0/}
}
M. M. Kipnis. Invariant properties of systems of formulas of elementary axiomatic. Izvestiya. Mathematics , Tome 4 (1970) no. 5, pp. 965-978. http://geodesic.mathdoc.fr/item/IM2_1970_4_5_a0/