Skip to main content
SpringerLink
Log in

Disjunctive Propositional Logic and Scott Domains

  • Conference paper
  • First Online:
Theory and Applications of Models of Computation (TAMC 2020)

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

  • 525 Accesses

Abstract

Based on the investigation of the proof system of a disjunctive propositional logic, this paper establishes a purely, syntactic representation of Scott-domains. More precisely, a category of certain proof systems with consequence relations is shown to be equivalent to that of Scott-domains with Scott-continuous functions.

This Research Supported by the National Natural Science Foundation of China (11771134).

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

Access this chapter

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

Institutional subscriptions

References

  1. Abramsky, S.: Domain theory and the logic of observable properties. Ph.D. thesis, University of London (1987)

    Google Scholar 

  2. Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Logic 51, 1–77 (1991)

    Article  MathSciNet  Google Scholar 

  3. Chen, Y., Jung, A.: A logical approach to stable domains. Theoret. Comput. Sci. 368, 124–148 (2006)

    Article  MathSciNet  Google Scholar 

  4. Edalat, A., Smthy, M.B.: Information categories. Appl. Categor. Struct. 1, 197–323 (1993)

    Article  MathSciNet  Google Scholar 

  5. Ern\(\acute{\text{e}}\), M.: Categories of locally hypercompact spaces and quasicontinuous posets. Appl. Categor. Struct. 26(5), 823–854 (2018). https://doi.org/10.1007/s10485-018-9536-0

  6. \(\acute{\text{ E }}\)sik, Z.: Residuated park theories. J. Logic Comput. 25(2), 453–471, 2015

    Google Scholar 

  7. Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Courier Dover Publications, New York (2015)

    MATH  Google Scholar 

  8. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices and Domains. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  9. Goubault-Larrecq, J.: Non-Hausdorff Topology and Domain Theory, Volume 22 of New Mathematical Monographs. Cambridge University Press, Cambridge (2013)

    Google Scholar 

  10. Ho, W., Goubault-Larrecq, J., Jung, A., Xi, X.: The Ho-Zhao problem. Logical Methods Comput. Sci. 14(1:7), 1–19 (2018)

    MathSciNet  MATH  Google Scholar 

  11. Hoofman, R.: Continuous information systems. Inf. Comput. 105, 42–71 (1993)

    Article  MathSciNet  Google Scholar 

  12. Huang, M., Zhou, X., Li, Q.: Re-visiting axioms of information systems. Inf. Comput. 247, 130–140 (2015)

    Article  MathSciNet  Google Scholar 

  13. Jung, A., Kegelmann, M., Moshier, M.A.: Multi lingual sequent calculus and coherent spaces. Fundamenta Informaticae 37, 369–412 (1999)

    Article  MathSciNet  Google Scholar 

  14. Jung, A.: Continuous domain theory in logical form. In: Coecke, B., Ong, L., Panangaden, P. (eds.) Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. LNCS, vol. 7860, pp. 166–177. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38164-5_12

    Chapter  Google Scholar 

  15. Larsen, K.G., Winskel, G.: Using information systems to solve reoursive domain equations effectively. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds.) SDT 1984. LNCS, vol. 173, pp. 109–129. Springer, Heidelberg (1984). https://doi.org/10.1007/3-540-13346-1_5

    Chapter  Google Scholar 

  16. Scott, D.S.: Domains for denotational semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577–610. Springer, Heidelberg (1982). https://doi.org/10.1007/BFb0012801

    Chapter  Google Scholar 

  17. Spreen, D., Xu, L., Mao, X.: Information systems revisited: the general continuous case. Theoret. Comput. Sci. 405, 176–187 (2008)

    Article  MathSciNet  Google Scholar 

  18. Vickers, S.: Entailment systems for stably locally compact locales. Theoret. Comput. Sci. 316, 259–296 (2004)

    Article  MathSciNet  Google Scholar 

  19. Wang, L., Li., Q.: A representation of proper BC domains based on conjunctive sequent calculi. Math. Struct. Comput. Sci. 1–13 (2020). https://doi.org/10.1017/S096012951900015X

  20. Wu, M., Guo, L., Li, Q.: A representation of L-domains by information system. Theoret. Comput. Sci. 612, 126–136 (2016)

    Article  MathSciNet  Google Scholar 

  21. Yao, W.: A categorical isomorphism between injective stratified fuzzy \(T_0\) spaces and fuzzy continuous lattices. IEEE Trans. Fuzzy Syst. 24(1), 131–139 (2016)

    Article  Google Scholar 

  22. Zhang, G.-Q.: Disjunctive systems and L-domains. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 284–295. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55719-9_81

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Hunan University, Changsha, China

    Longchun Wang & Qingguo Li

  2. School of Mathematical Sciences, Qufu Normal University, Qufu, China

    Longchun Wang

Authors
  1. Longchun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qingguo Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qingguo Li .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, USA

    Jianer Chen

  2. School of Computer Science and Engineering, Central South University, Changsha, China

    Qilong Feng

  3. Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, USA

    Jinhui Xu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, L., Li, Q. (2020). Disjunctive Propositional Logic and Scott Domains. In: Chen, J., Feng, Q., Xu, J. (eds) Theory and Applications of Models of Computation. TAMC 2020. Lecture Notes in Computer Science(), vol 12337. Springer, Cham. https://doi.org/10.1007/978-3-030-59267-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-59267-7_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-59266-0

  • Online ISBN: 978-3-030-59267-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation