Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic, Rationality and Interaction

LORI 2017: Logic, Rationality, and Interaction pp 526–540Cite as

Labelled Sequent Calculus for Inquisitive Logic

  • Conference paper
  • First Online:

  • 1147 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10455))

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).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ciardelli, I., Roelofsen, F.: Inquisitive logic. J. Philosoph. Logic 40, 55–94 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dyckhoff, R., Negri, S.: Proof analysis in intermediate logics. Arch. Math. Logic 51, 71–92 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. 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

    Chapter  Google Scholar 

  4. Mascarenhas, S.: Inquisitive Semantics and Logic. Master Thesis, University of Amsterdam (2009)

    Google Scholar 

  5. Negri, S.: Proof analysis in modal logic. J. Philosoph. Logic 34, 507–544 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Negri, S.: Contraction-free sequent calculi for geometric theories with an application to Barr’s theorem. Arch. Math. Logic 42, 389–401 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Negri, S., von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  8. 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

    Chapter  Google Scholar 

  9. Stalnaker, R.: Assertion. Syntax Semant. 9, 315–332 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Logic and Cognition, Sun Yat-Sen University, Guangzhou, China

    Jinsheng Chen & Minghui Ma

Authors
  1. Jinsheng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minghui Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinsheng Chen .

Editor information

Editors and Affiliations

  1. Institute for Logic, Language and Computation, University of Amsterdam , Amsterdam, Noord-Holland, The Netherlands

    Alexandru Baltag

  2. Department of Philosophy, The University of Auckland, Auckland, Auckland, New Zealand

    Jeremy Seligman

  3. Graduate School of Letters, Hokkaido University , Sapporo, Japan

    Tomoyuki Yamada

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation