Some prime elements in the lattice of interpretability types-Reference-Cited by-同舟云学术

Some prime elements in the lattice of interpretability types

Published:1983 Issue:1 Volume:280 Page:255-275
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Pudlák Pavel

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1983-280-01/S0002-9947-1983-0712260-2/S0002-9947-1983-0712260-2.pdf

Reference10 articles.

1. A. Ehrenfeucht and J. Mycielski, Theorems and problems on the lattice of local interpretability, manuscript.

2. Fragments of Peano’s arithmetic and the MRDP theorem;Gaifman, Haim,1982

3. Some results on interpretability;Lindström, Per,1979

4. Theories incomparable with respect to relative interpretability;Montague, Richard;J. Symbolic Logic,1962

5. A lattice of interpretability types of theories;Mycielski, Jan;J. Symbolic Logic,1977

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A weak theory of building blocks;Mathematical Logic Quarterly;2024-05

2. Weak Sequential Theories of Finite Full Binary Trees;Revolutions and Revelations in Computability;2022

3. The Arithmetics of a Theory;Notre Dame Journal of Formal Logic;2015-01-01

4. Can We Make the Second Incompleteness Theorem Coordinate Free?;Journal of Logic and Computation;2009-08-12

5. The unprovability of small inconsistency;Archive for Mathematical Logic;1993-07