Abstract
A contraction-free and cut-free labelled sequent calculus \(\mathsf {GInqL}\) for inquisitive logic is established. Labels are defined by a set-theoretic syntax. The completeness of \(\mathsf {GInqL}\) is shown by the equivalence between the Hilbert-style axiomatic system and sequent system.
M. Ma—The work is supported by Chinese national foundation of social sciences (grant no. 16CZX049).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ciardelli, I., Roelofsen, F.: Inquisitive logic. J. Philosoph. Logic 40, 55–94 (2011)
Dyckhoff, R., Negri, S.: Proof analysis in intermediate logics. Arch. Math. Logic 51, 71–92 (2012)
Groenendijk, J.: Inquisitive semantics: two possibilities for disjunction. In: Bosch, P., Gabelaia, D., Lang, J. (eds.) TbiLLC 2007. LNCS, vol. 5422, pp. 80–94. Springer, Heidelberg (2009). doi:10.1007/978-3-642-00665-4_8
Mascarenhas, S.: Inquisitive Semantics and Logic. Master Thesis, University of Amsterdam (2009)
Negri, S.: Proof analysis in modal logic. J. Philosoph. Logic 34, 507–544 (2005)
Negri, S.: Contraction-free sequent calculi for geometric theories with an application to Barr’s theorem. Arch. Math. Logic 42, 389–401 (2003)
Negri, S., von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)
Sano, K.: Sound and complete tree-sequent calculus for inquisitive logic. In: Ono, H., Kanazawa, M., Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol. 5514, pp. 365–378. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02261-6_29
Stalnaker, R.: Assertion. Syntax Semant. 9, 315–332 (1978)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this paper
Cite this paper
Chen, J., Ma, M. (2017). Labelled Sequent Calculus for Inquisitive Logic. In: Baltag, A., Seligman, J., Yamada, T. (eds) Logic, Rationality, and Interaction. LORI 2017. Lecture Notes in Computer Science(), vol 10455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55665-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-662-55665-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-55664-1
Online ISBN: 978-3-662-55665-8
eBook Packages: Computer ScienceComputer Science (R0)