An Ehrenfeucht-Fraı̈ssé Game for Inquisitive First-Order Logic. Grilletti, G. & Ciardelli, I. In Silva, A., Staton, S., Sutton, P., & Umbach, C., editors, Language, Logic, and Computation, pages 166–186, Berlin, Heidelberg, 2019. Springer Berlin Heidelberg. ![An Ehrenfeucht-Fraı̈ssé Game for Inquisitive First-Order Logic [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 1 download Inquisitive first-order logic, InqBQ, is an extension of classical 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.
@inproceedings{GrillettiCiardelli:19,
abstract = {Inquisitive first-order logic, InqBQ, is an extension of classical 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{\"\i}ss{\'e} 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.},
address = {Berlin, Heidelberg},
author = {Grilletti, Gianluca and Ciardelli, Ivano},
booktitle = {Language, Logic, and Computation},
date-added = {2021-08-17 00:00:00 +0000},
date-modified = {2021-08-17 00:00:00 +0000},
doi = {10.1007/978-3-662-59565-7_9},
editor = {Silva, Alexandra and Staton, Sam and Sutton, Peter and Umbach, Carla},
isbn = {978-3-662-59565-7},
pages = {166--186},
publisher = {Springer Berlin Heidelberg},
title = {An Ehrenfeucht-Fra{\"\i}ss{\'e} Game for Inquisitive First-Order Logic},
url = {https://link.springer.com/chapter/10.1007/978-3-662-59565-7_9},
year = {2019},
Bdsk-Url-1 = {https://link.springer.com/chapter/10.1007/978-3-662-59565-7_9},
Bdsk-Url-2 = {https://doi.org/10.1007/978-3-662-59565-7_9}}
Downloads: 1
{"_id":"9H3s5pgQ5CM76RzSK","bibbaseid":"grilletti-ciardelli-anehrenfeuchtfrassgameforinquisitivefirstorderlogic-2019","author_short":["Grilletti, G.","Ciardelli, I."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Inquisitive first-order logic, InqBQ, is an extension of classical 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.","address":"Berlin, Heidelberg","author":[{"propositions":[],"lastnames":["Grilletti"],"firstnames":["Gianluca"],"suffixes":[]},{"propositions":[],"lastnames":["Ciardelli"],"firstnames":["Ivano"],"suffixes":[]}],"booktitle":"Language, Logic, and Computation","date-added":"2021-08-17 00:00:00 +0000","date-modified":"2021-08-17 00:00:00 +0000","doi":"10.1007/978-3-662-59565-7_9","editor":[{"propositions":[],"lastnames":["Silva"],"firstnames":["Alexandra"],"suffixes":[]},{"propositions":[],"lastnames":["Staton"],"firstnames":["Sam"],"suffixes":[]},{"propositions":[],"lastnames":["Sutton"],"firstnames":["Peter"],"suffixes":[]},{"propositions":[],"lastnames":["Umbach"],"firstnames":["Carla"],"suffixes":[]}],"isbn":"978-3-662-59565-7","pages":"166–186","publisher":"Springer Berlin Heidelberg","title":"An Ehrenfeucht-Fraı̈ssé Game for Inquisitive First-Order Logic","url":"https://link.springer.com/chapter/10.1007/978-3-662-59565-7_9","year":"2019","bdsk-url-1":"https://link.springer.com/chapter/10.1007/978-3-662-59565-7_9","bdsk-url-2":"https://doi.org/10.1007/978-3-662-59565-7_9","bibtex":"@inproceedings{GrillettiCiardelli:19,\n\tabstract = {Inquisitive first-order logic, InqBQ, is an extension of classical 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{\\\"\\i}ss{\\'e} 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.},\n\taddress = {Berlin, Heidelberg},\n\tauthor = {Grilletti, Gianluca and Ciardelli, Ivano},\n\tbooktitle = {Language, Logic, and Computation},\n\tdate-added = {2021-08-17 00:00:00 +0000},\n\tdate-modified = {2021-08-17 00:00:00 +0000},\n\tdoi = {10.1007/978-3-662-59565-7_9},\n\teditor = {Silva, Alexandra and Staton, Sam and Sutton, Peter and Umbach, Carla},\n\tisbn = {978-3-662-59565-7},\n\tpages = {166--186},\n\tpublisher = {Springer Berlin Heidelberg},\n\ttitle = {An Ehrenfeucht-Fra{\\\"\\i}ss{\\'e} Game for Inquisitive First-Order Logic},\n\turl = {https://link.springer.com/chapter/10.1007/978-3-662-59565-7_9},\n\tyear = {2019},\n\tBdsk-Url-1 = {https://link.springer.com/chapter/10.1007/978-3-662-59565-7_9},\n\tBdsk-Url-2 = {https://doi.org/10.1007/978-3-662-59565-7_9}}\n\n","author_short":["Grilletti, G.","Ciardelli, I."],"editor_short":["Silva, A.","Staton, S.","Sutton, P.","Umbach, C."],"key":"GrillettiCiardelli:19","id":"GrillettiCiardelli:19","bibbaseid":"grilletti-ciardelli-anehrenfeuchtfrassgameforinquisitivefirstorderlogic-2019","role":"author","urls":{"Paper":"https://link.springer.com/chapter/10.1007/978-3-662-59565-7_9"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://projects.illc.uva.nl/inquisitivesemantics/assets/files/papers.bib","dataSources":["x2Aox4ZP7RsyuDjWX","LaLDs2mrYhQpgH6Lk"],"keywords":[],"search_terms":["ehrenfeucht","fra","game","inquisitive","first","order","logic","grilletti","ciardelli"],"title":"An Ehrenfeucht-Fraı̈ssé Game for Inquisitive First-Order Logic","year":2019,"downloads":1}