If you need an accessible version of this item please contact JSTOR User Support

Logical Operations and Iterated Infinitely Deep Languages

Juha Oikkonen
Studia Logica: An International Journal for Symbolic Logic
Vol. 42, No. 2/3, Proceedings of the Finnish-Polish-Soviet Logic Conference (1983), pp. 243-249
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015112
Page Count: 7
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Logical Operations and Iterated Infinitely Deep Languages
Preview not available

Abstract

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 $\scr{L}^{\ast}$, 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.

Page Thumbnails

  • Thumbnail: Page 
[243]
    [243]
  • Thumbnail: Page 
244
    244
  • Thumbnail: Page 
245
    245
  • Thumbnail: Page 
246
    246
  • Thumbnail: Page 
247
    247
  • Thumbnail: Page 
248
    248
  • Thumbnail: Page 
249
    249