Logical operations and iterated deep languages

Studia Logica 42:243 (1983)


We discuss an abstract notion of a logical operation and corresponding logics. It is shown that if all the logical operations considered are implicitely definable in a logic *, then the same holds also for the logic obtained from these operations. As an application we show that certain iterated forms of infinitely deep languages are implicitely definable in game quantifier languages. We consider also relations between structures and show that Karttunen's characterization of elementary equivalence for the ordinary infinitely deep languages can be generalized to hold for the iterated infinitely deep languages. An early version of this work was presented in the Abstracts Section of ICM '78.

Download options


    Upload a copy of this work     Papers currently archived: 72,743

External links

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

Through your library


Added to PP

31 (#373,271)

6 months
1 (#386,989)

Historical graph of downloads
How can I increase my downloads?

References found in this work

A New Approach to Infinitary Languages.J. Hintikka - 1976 - Annals of Mathematical Logic 10 (1):95.
Axioms for Abstract Model Theory.K. J. Barwise - 1974 - Annals of Mathematical Logic 7 (2/3):221.
Δ-Logics and Generalized Quantifiers.J. A. Makowsky - 1976 - Annals of Mathematical Logic 10 (2):155.

Add more references

Citations of this work

No citations found.

Add more citations

Similar books and articles

Logicality and Invariance.Denis Bonnay - 2006 - Bulletin of Symbolic Logic 14 (1):29-68.
Logical Operations.Vann McGee - 1996 - Journal of Philosophical Logic 25 (6):567 - 580.
Are Logical Languages Compositional?Marcus Kracht - 2013 - Studia Logica 101 (6):1319-1340.
Philosophy of Languages and Languages as Framework of Philosophies.Pablo Lopez Lopez - 2008 - Proceedings of the Xxii World Congress of Philosophy 39:137-141.
Iterated Local Reflection Versus Iterated Consistency.Lev Beklemishev - 1995 - Annals of Pure and Applied Logic 75 (1-2):25-48.