Graduate studies at Western
Studia Logica 42 (2-3):243 - 249 (1983)
|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 *, 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)|
|Through your library||Configure|
Similar books and articles
Patrick Blackburn & Maarten de Rijke (1997). Why Combine Logics? Studia Logica 59 (1):5-27.
Eric Steinhart (2007). Infinitely Complex Machines. In Intelligent Computing Everywhere. Springer.
Johan van Benthem (2003). Logic Games Are Complete for Game Logics. Studia Logica 75 (2):183-203.
Johan Van Benthem (2003). Logic Games Are Complete for Game Logics. Studia Logica 75 (2):183 - 203.
Denis Bonnay (2006). Logicality and Invariance. Bulletin of Symbolic Logic 14 (1):29-68.
Vann McGee (1996). Logical Operations. Journal of Philosophical Logic 25 (6):567 - 580.
A. Pétry (1992). Stratified Languages. Journal of Symbolic Logic 57 (4):1366-1376.
Ian Pratt & Dominik Schoop (2000). Expressivity in Polygonal, Plane Mereotopology. Journal of Symbolic Logic 65 (2):822-838.
Maaret Karttunen (1983). Model Theoretic Results for Infinitely Deep Languages. Studia Logica 42 (2-3):223 - 241.
Added to index2009-01-28
Total downloads2 ( #246,187 of 733,590 )
Recent downloads (6 months)0
How can I increase my downloads?