@inproceedings{Sano:09,
	abstract = {We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish that (i) our tree-sequent calculus is sound and complete with respect to Groenendijk's inquisitive semantics and that (ii) our tree-sequent calculus is decidable and enjoys cut-elimination theorem. (ii) is semantically revealed by our argument for (i). The key idea which allows us to obtain these results is as follows: In Groenendijk's inquisitive semantics, a formula of propositional logic is evaluated against a pair of worlds on a model. Given the appropriate pre-order on the set of such pairs, any inquisitive model can be regarded as a Kripke model for intuitionistic logic. This representation enables us to connect inquisitive semantics with the tree-sequent technique for non-classical logics (Kashima 1999).},
	author = {Katsuhiko Sano},
	booktitle = {Proceedings of the Sixteenth Workshop on Logic, Language, Information, 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-642-02261-6_29},
	title = {Sound and Complete Tree-Sequent Calculus for Inquisitive Logic},
	url = {https://link.springer.com/chapter/10.1007%2F978-3-642-02261-6_29},
	year = {2009},
	Bdsk-Url-1 = {https://link.springer.com/chapter/10.1007%2F978-3-642-02261-6_29},
	Bdsk-Url-2 = {https://doi.org/10.1007/978-3-642-02261-6_29}}

{"_id":"HrEr7PukRdhRjTnFQ","bibbaseid":"sano-soundandcompletetreesequentcalculusforinquisitivelogic-2009","author_short":["Sano, K."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish that (i) our tree-sequent calculus is sound and complete with respect to Groenendijk's inquisitive semantics and that (ii) our tree-sequent calculus is decidable and enjoys cut-elimination theorem. (ii) is semantically revealed by our argument for (i). The key idea which allows us to obtain these results is as follows: In Groenendijk's inquisitive semantics, a formula of propositional logic is evaluated against a pair of worlds on a model. Given the appropriate pre-order on the set of such pairs, any inquisitive model can be regarded as a Kripke model for intuitionistic logic. This representation enables us to connect inquisitive semantics with the tree-sequent technique for non-classical logics (Kashima 1999).","author":[{"firstnames":["Katsuhiko"],"propositions":[],"lastnames":["Sano"],"suffixes":[]}],"booktitle":"Proceedings of the Sixteenth Workshop on Logic, Language, Information, 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-642-02261-6_29","title":"Sound and Complete Tree-Sequent Calculus for Inquisitive Logic","url":"https://link.springer.com/chapter/10.1007%2F978-3-642-02261-6_29","year":"2009","bdsk-url-1":"https://link.springer.com/chapter/10.1007%2F978-3-642-02261-6_29","bdsk-url-2":"https://doi.org/10.1007/978-3-642-02261-6_29","bibtex":"@inproceedings{Sano:09,\n\tabstract = {We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish that (i) our tree-sequent calculus is sound and complete with respect to Groenendijk's inquisitive semantics and that (ii) our tree-sequent calculus is decidable and enjoys cut-elimination theorem. (ii) is semantically revealed by our argument for (i). The key idea which allows us to obtain these results is as follows: In Groenendijk's inquisitive semantics, a formula of propositional logic is evaluated against a pair of worlds on a model. Given the appropriate pre-order on the set of such pairs, any inquisitive model can be regarded as a Kripke model for intuitionistic logic. This representation enables us to connect inquisitive semantics with the tree-sequent technique for non-classical logics (Kashima 1999).},\n\tauthor = {Katsuhiko Sano},\n\tbooktitle = {Proceedings of the Sixteenth Workshop on Logic, Language, Information, 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-642-02261-6_29},\n\ttitle = {Sound and Complete Tree-Sequent Calculus for Inquisitive Logic},\n\turl = {https://link.springer.com/chapter/10.1007%2F978-3-642-02261-6_29},\n\tyear = {2009},\n\tBdsk-Url-1 = {https://link.springer.com/chapter/10.1007%2F978-3-642-02261-6_29},\n\tBdsk-Url-2 = {https://doi.org/10.1007/978-3-642-02261-6_29}}\n\n","author_short":["Sano, K."],"key":"Sano:09","id":"Sano:09","bibbaseid":"sano-soundandcompletetreesequentcalculusforinquisitivelogic-2009","role":"author","urls":{"Paper":"https://link.springer.com/chapter/10.1007%2F978-3-642-02261-6_29"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://projects.illc.uva.nl/inquisitivesemantics/assets/files/papers.bib","dataSources":["x2Aox4ZP7RsyuDjWX","LaLDs2mrYhQpgH6Lk"],"keywords":[],"search_terms":["sound","complete","tree","sequent","calculus","inquisitive","logic","sano"],"title":"Sound and Complete Tree-Sequent Calculus for Inquisitive Logic","year":2009,"downloads":1}