Some prime elements in the lattice of interpretability types
Author:
- Pavel PudlákPPPavel Pudlák
- 1 January 1983
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 280 (1) , 255-275
Abstract
A general theorem is proved which implies that the types of PA \text {PA} (Peano Arithmetic), ZF \text {ZF} (Zermelo-Fraenkel Set Theory) and GB \text {GB} (Gödel-Bernays Set Theory) are prime in the lattice of interpretability types.Keywords
This publication has 5 references indexed in Scilit:
- A note on the undefinability of cutsThe Journal of Symbolic Logic, 1983
- A lattice of interpretability types of theoriesThe Journal of Symbolic Logic, 1977
- Axiomatizability by a schemaThe Journal of Symbolic Logic, 1968
- Theories incomparable with respect to relative interpretabilityThe Journal of Symbolic Logic, 1962
- Undecidable Theories. By A. Tarski, A. Mostowski. and R. M. Robinson. Pp. 98. 18s. 1953. Studies in Logic and the Foundations of Mathematics. (North Holland Co., Amsterdam)The Mathematical Gazette, 1954