Logical operations and iterated infinitely deep languages

Studia Logica 42 (2-3):243 - 249 (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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01063843
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,392
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

22 ( #213,803 of 1,924,700 )

Recent downloads (6 months)

5 ( #187,017 of 1,924,700 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.