![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Lauri Hella, Tampere University
Thursday 29 September 2022, 14:00-15:00
The Expressive Power of CSP Quantifiers
- 👤 Speaker: Lauri Hella, Tampere University
- 📅 Date & Time: Thursday 29 September 2022, 14:00 - 15:00
- 📍 Venue: SS03
Abstract
A generalized quantifier Q is called a CSP -quantifier if its defining class consists of all structures that can be homomorphically mapped to a fixed finite template structure. For all positive integers n>1 and k, we define a pebble game that characterizes equivalence of structures with respect to the extension of the infinitary k-variable logic by all unary quantifiers and the class C_n of all CSP quantifiers with template structures that have at most n elements. Using these games we prove that for every n>1 there exists a CSP -quantifier with template of size n+1 which is not definable in finite variable logic with all unary quantifiers and quantifiers in C_n. The proof of this result is based on a new variation of the well-known Cai-Fürer-Immerman construction.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- SS03
- tcw57’s list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.