ArticleOriginal scientific text

Title

Construction of sentences with specific interpretability properties

Authors 1

Affiliations

  1. The Rowland Institute for Science, 100 Cambridge Parkway, Cambridge, Massachusetts 02142, U.S.A.

Abstract

The Rowland Institute for Science, 100 Cambridge Parkway, Cambridge, Massachusetts 02142, U.S.A. A construction is presented for generating sentences that satisfy a recursively enumerable set of interpretability properties. This construction is then used to prove three previously announced results concerning the lattice of local interpretability types of theories (also known as the Lattice of Chapters).

Bibliography

  1. [K] J. Krajíček, Some theorems on the lattice of local interpretability types, Z. Math. Logik Grundlag. Math. 31 (1985), 449-460.
  2. [MPS] J. Mycielski, P. Pudlák and A. Stern, A lattice of chapters of mathematics (interpretations between theorems), Mem. Amer. Math. Soc. 426 (1990).
  3. [T] B. A. Trachtenbrot, On recursive inseparability, Dokl. Akad. Nauk SSSR 88 (1953), 953-956 (in Russian).
  4. [V] R. L. Vaught, Axiomatizability by a schema, J. Symbolic Logic 32 (1967), 473-479.

Additional information

http://matwbn.icm.edu.pl/ksiazki/fm/fm142/fm14227.pdf

Pages:
189-200
Main language of publication
English
Received
1992-08-08
Published
1993
Exact and natural sciences