Epistemic extensions of substructural inquisitive logics. Pun ̌cochá ̌r, V. & Sedlár, I. Journal of Logic and Computation, 2021. ![Epistemic extensions of substructural inquisitive logics [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 1 download In this paper, we study the epistemic extensions of distributive substructural inquisitive logics. Substructural inquisitive logics are logics of questions based on substructural logics of declarative sentences. They generalize basic inquisitive logic which is based on the classical logic of declaratives. We show that if the underlying substructural logic is distributive, the generalization can be extended to embrace also the epistemic modalities `knowing whether' and `wondering whether' that are applicable to questions. We construct a semantic framework for a language of propositional substructural logics enriched with a question-forming operator (inquisitive disjunction) and epistemic modalities. We show that within this framework, one can define a canonical model with suitable properties for any (syntactically defined) epistemic inquisitive logic. This leads to a general approach to completeness proofs for such logics. A deductive system for the weakest epistemic inquisitive logic is described and completeness proved for this special case using the general method.
@article{PuncocharSedlar:21jlc,
abstract = {In this paper, we study the epistemic extensions of distributive substructural inquisitive logics. Substructural inquisitive logics are logics of questions based on substructural logics of declarative sentences. They generalize basic inquisitive logic which is based on the classical logic of declaratives. We show that if the underlying substructural logic is distributive, the generalization can be extended to embrace also the epistemic modalities `knowing whether' and `wondering whether' that are applicable to questions. We construct a semantic framework for a language of propositional substructural logics enriched with a question-forming operator (inquisitive disjunction) and epistemic modalities. We show that within this framework, one can define a canonical model with suitable properties for any (syntactically defined) epistemic inquisitive logic. This leads to a general approach to completeness proofs for such logics. A deductive system for the weakest epistemic inquisitive logic is described and completeness proved for this special case using the general method.},
author = {Pun{\v c}och{\'a}{\v r}, V{\'\i}t and Sedl{\'a}r, Igor},
date-added = {2021-08-17 00:00:00 +0000},
date-modified = {2021-08-17 00:00:00 +0000},
doi = {10.1093/logcom/exab008},
journal = {Journal of Logic and Computation},
keywords = {inquisitive logic},
title = {Epistemic extensions of substructural inquisitive logics},
url = {https://academic.oup.com/logcom/advance-article/doi/10.1093/logcom/exab008/6259459},
volume = {exab008},
year = {2021},
Bdsk-Url-1 = {https://academic.oup.com/logcom/advance-article/doi/10.1093/logcom/exab008/6259459},
Bdsk-Url-2 = {https://doi.org/10.1093/logcom/exab008}}
Downloads: 1
{"_id":"ByuSAPyiZttru3L2X","bibbaseid":"puncochr-sedlr-epistemicextensionsofsubstructuralinquisitivelogics-2021","author_short":["Pun ̌cochá ̌r, V.","Sedlár, I."],"bibdata":{"bibtype":"article","type":"article","abstract":"In this paper, we study the epistemic extensions of distributive substructural inquisitive logics. Substructural inquisitive logics are logics of questions based on substructural logics of declarative sentences. They generalize basic inquisitive logic which is based on the classical logic of declaratives. We show that if the underlying substructural logic is distributive, the generalization can be extended to embrace also the epistemic modalities `knowing whether' and `wondering whether' that are applicable to questions. We construct a semantic framework for a language of propositional substructural logics enriched with a question-forming operator (inquisitive disjunction) and epistemic modalities. We show that within this framework, one can define a canonical model with suitable properties for any (syntactically defined) epistemic inquisitive logic. This leads to a general approach to completeness proofs for such logics. A deductive system for the weakest epistemic inquisitive logic is described and completeness proved for this special case using the general method.","author":[{"propositions":[],"lastnames":["Pun ̌cochá ̌r"],"firstnames":["Vı́t"],"suffixes":[]},{"propositions":[],"lastnames":["Sedlár"],"firstnames":["Igor"],"suffixes":[]}],"date-added":"2021-08-17 00:00:00 +0000","date-modified":"2021-08-17 00:00:00 +0000","doi":"10.1093/logcom/exab008","journal":"Journal of Logic and Computation","keywords":"inquisitive logic","title":"Epistemic extensions of substructural inquisitive logics","url":"https://academic.oup.com/logcom/advance-article/doi/10.1093/logcom/exab008/6259459","volume":"exab008","year":"2021","bdsk-url-1":"https://academic.oup.com/logcom/advance-article/doi/10.1093/logcom/exab008/6259459","bdsk-url-2":"https://doi.org/10.1093/logcom/exab008","bibtex":"@article{PuncocharSedlar:21jlc,\n\tabstract = {In this paper, we study the epistemic extensions of distributive substructural inquisitive logics. Substructural inquisitive logics are logics of questions based on substructural logics of declarative sentences. They generalize basic inquisitive logic which is based on the classical logic of declaratives. We show that if the underlying substructural logic is distributive, the generalization can be extended to embrace also the epistemic modalities `knowing whether' and `wondering whether' that are applicable to questions. We construct a semantic framework for a language of propositional substructural logics enriched with a question-forming operator (inquisitive disjunction) and epistemic modalities. We show that within this framework, one can define a canonical model with suitable properties for any (syntactically defined) epistemic inquisitive logic. This leads to a general approach to completeness proofs for such logics. A deductive system for the weakest epistemic inquisitive logic is described and completeness proved for this special case using the general method.},\n\tauthor = {Pun{\\v c}och{\\'a}{\\v r}, V{\\'\\i}t and Sedl{\\'a}r, Igor},\n\tdate-added = {2021-08-17 00:00:00 +0000},\n\tdate-modified = {2021-08-17 00:00:00 +0000},\n\tdoi = {10.1093/logcom/exab008},\n\tjournal = {Journal of Logic and Computation},\n\tkeywords = {inquisitive logic},\n\ttitle = {Epistemic extensions of substructural inquisitive logics},\n\turl = {https://academic.oup.com/logcom/advance-article/doi/10.1093/logcom/exab008/6259459},\n\tvolume = {exab008},\n\tyear = {2021},\n\tBdsk-Url-1 = {https://academic.oup.com/logcom/advance-article/doi/10.1093/logcom/exab008/6259459},\n\tBdsk-Url-2 = {https://doi.org/10.1093/logcom/exab008}}\n\n","author_short":["Pun ̌cochá ̌r, V.","Sedlár, I."],"key":"PuncocharSedlar:21jlc","id":"PuncocharSedlar:21jlc","bibbaseid":"puncochr-sedlr-epistemicextensionsofsubstructuralinquisitivelogics-2021","role":"author","urls":{"Paper":"https://academic.oup.com/logcom/advance-article/doi/10.1093/logcom/exab008/6259459"},"keyword":["inquisitive logic"],"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"article","biburl":"https://projects.illc.uva.nl/inquisitivesemantics/assets/files/papers.bib","dataSources":["LaLDs2mrYhQpgH6Lk"],"keywords":["inquisitive logic"],"search_terms":["epistemic","extensions","substructural","inquisitive","logics","pun ̌cochá ̌r","sedlár"],"title":"Epistemic extensions of substructural inquisitive logics","year":2021,"downloads":1}