| Authors |
|
| Publication date |
2019
|
| Host editors |
-
A. Silva
-
S. Staton
-
P. Sutton
-
C. Umbach
|
| Book title |
Language, Logic, and Computation
|
| Book subtitle |
12th International Tbilisi Symposium, TbiLLC 2017, Lagodekhi, Georgia, September 18-22, 2017 : revised selected papers
|
| ISBN |
|
| ISBN (electronic) |
|
| Series |
Lecture Notes in Computer Science
|
| Event |
12th Tbilisi Symposium on Language, Logic and Computation
|
| Pages (from-to) |
166-186
|
| Number of pages |
21
|
| Publisher |
Berlin: Springer
|
| Organisations |
-
Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
|
| Abstract |
Inquisitive first-order logic, InqBQ, is an extension of classi- cal first-order logic with questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures. In this paper we describe an Ehrenfeucht-Fraïssé game for InqBQ and show that it characterizes the distinguishing power of the logic. We exploit this result to show a number of undefinability results: in particular, several variants of the question how many individuals have property P are not expressible in InqBQ, even in restriction to finite models.
|
| Document type |
Conference contribution
|
| Language |
English
|
| Published at |
https://doi.org/10.1007/978-3-662-59565-7_9
|
|
Permalink to this page
|