Definability of second order generalized quantifiers
نویسنده
چکیده
Acknowledgements I wish to express my sincere gratitude to my supervisor Professor Jouko Väänänen for introducing me to this subject and for his inspiring guidance and support during my doctoral studies. I am also grateful to Professor Lauri Hella and Docent Kerkko Luosto for carefully reading the manuscript and making valuable comments on it. I am indebted to the Graduate School of Mathematical Analysis and Logic and to the Finnish Academy of Science and Letters (Vilho, Yrjö and Kalle Väisälä Foundation) for financial support. I want to thank my friends and colleagues at the Department of Mathematics and Statistics and the participants of the Finite Model Theory Seminar for their support and intrest. Especially, I want to thank Ph.Lic. Pekka Pankka and Ph.Lic. Jussi Laitila. I express my best thanks to my parents Raili and Esko for their continuous encouragement and support. My thanks are also due to my brother Jarmo. Finally, I am grateful to Ilona for her love and her important support during my doctoral studies.
منابع مشابه
Characterizing Definability of Second-Order Generalized Quantifiers
We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new de...
متن کاملA characterization of definability of second-order generalized quantifiers with applications to non-definability
Article history: Received 14 January 2012 Received in revised form 21 February 2013 Accepted 3 February 2014 Available online 4 April 2014
متن کاملHenkin and Function Quantifiers
Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...
متن کاملRamsey Theory Is Needed for Solving Definability Problems of Generalized Quantifiers
In recent years, generalized quantifiers (see [H3]) have received quite a lot of novel interest because of their applications to computer science and linguistics. Their definability theory has made considerable progress during the last decade, which will be the subject of the next section. The proofs of many of these results often use results of Ramsey theory, such as theorems of van der Waerde...
متن کاملGeneralized Quantifiers
We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.
متن کاملConnection Matrices and the Definability of Graph Parameters
In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A. Makowsky (2009). We demonstrate its vast applicability in simplifying known and new non-definability results of graph properties and finding new non-definability re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 49 شماره
صفحات -
تاریخ انتشار 2010