A generalization of the interpolation theorem for the many-sorted calculus

Bulletin of the Section of Logic 13 (1):2-8 (1984)
  Copy   BIBTEX

Abstract

The purpose of the present paper is to prove the interpolation theorem for many-sorted languages which are, in terminology of Feferman neither restricted nor unrestricted. Such languages are often used in mathematical practice and have been investigated by several authors . The result is a generalization of the well-known Stern interpolation theorem for restricted m.s.l. and its proof depends heavily on that of Stern’s theorem. In place of the functions Rel + and Rel − our theorem treats the functions T yp + and T yp − giving much more information about any formula

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-25

Downloads
14 (#846,545)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Logic of many-sorted theories.Hao Wang - 1952 - Journal of Symbolic Logic 17 (2):105-116.
A new look at the interpolation problem.Jacques Stern - 1975 - Journal of Symbolic Logic 40 (1):1-13.

Add more references