Home The predicate completion of a partial information system
Article
Licensed
Unlicensed Requires Authentication

The predicate completion of a partial information system

  • Zack French and James B. Hart EMAIL logo
Published/Copyright: March 31, 2018
Become an author with De Gruyter Brill

Abstract

Originally, partial information systems were introduced as a means of providing a representation of the Smyth powerdomain in terms of order convex substructures of an information-based structure. For every partial information system 𝕊, there is a new partial information system that is natrually induced by the principal lowersets of the consistency predicate for 𝕊. In this paper, we show that this new system serves as a completion of the parent system 𝕊 in two ways. First, we demonstrate that the induced system relates to the parent system 𝕊 in much the same way as the ideal completion of the consistency predicate for 𝕊 relates to the consistency predicate itself. Second, we explore the relationship between this induced system and the notion of D-completions for posets. In particular, we show that this induced system has a “semi-universal” property in the category of partial information systems coupled with the preorder analog of Scott-continuous maps that is induced by the universal property of the D-completion of the principal lowersets of the consistency predicate for the parent system 𝕊.


(Communicated by Constantin Tsinakis)


References

[1] Abramsky, S.: Domain theory in logical form, Ann. Pure Appl. Logic 51 (1991), 1–77.10.1016/0168-0072(91)90065-TSearch in Google Scholar

[2] ABramsky, S.—Jung, A.: Domain theory. In: Handbook of Logic in Computer Science (Abramsky, Gabbay, Maibaum, eds.), Oxford University Press, 1994, pp. 1–168.Search in Google Scholar

[3] Bukatin, M. Logic of fixed points and Scott topology, Topology Proc. 26 (2001/2002), 433–468.Search in Google Scholar

[4] Callejas Bedregal, B. R.: Representing some categories of domains as information system structures. In: Abstracts Collection, International Symposium on Domain Theory, Chengdu, P. R. China, 2001, pp. 51–62.Search in Google Scholar

[5] Davey, B. A.—Priestley, H. A.: Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.Search in Google Scholar

[6] Droste, M.—Göbel, R.: Effectively given information systems and domains. In: Lecture Notes in Comput. Sci. 440, Springer-Berlin/ Heidelberg, 1990, pp. 116–142.10.1007/3-540-52753-2_36Search in Google Scholar

[7] Droste, M.—Göbel, R.: Non-deterministic information systems and their domains, Theoret. Comp. Sci. 75 (1990), 289–309.10.1016/0304-3975(90)90097-2Search in Google Scholar

[8] Edelat, A.—Smyth, M: Information categories. In: Appl. Categ. Structures 1, Kluwer Academic Publ., 1993, pp. 197–232.10.1007/BF00880044Search in Google Scholar

[9] Gierz, G. et al.: Continuous Lattices and Domains. Encyclopedia Math. Appl. 93, Cambridge University Press, 2003.10.1017/CBO9780511542725Search in Google Scholar

[10] Hart, J.: Partial information systems and the Smyth powerdomain, Math. Slovaca 62 (2012), 1–12.10.2478/s12175-012-0035-8Search in Google Scholar

[11] HArt, J.—Tsinakis, C.: A concrete realization of the hoare powerdomain, Soft Comput. 11 (2007), 1059–1063.10.1007/s00500-007-0153-3Search in Google Scholar

[12] Hart, J.—Tsinakis, C.: The duality between algebraic posets and bialgebraic frames: A lattice theoretic perspective, Rev. Un. Mat. Argentina 49 (2008), 83–98.Search in Google Scholar

[13] Keimel, K.—Lawson, J. D.: D-completions and the d-topology, Ann. Pure Appl. Logic 159 2009, 3:292–306.10.1016/j.apal.2008.06.019Search in Google Scholar

[14] Mislove, M. W.: Local dcpos, Local CPOs, and Local Completions, Electron. Notes Theor. Comput. Sci. 20, 1999.10.1016/S1571-0661(04)80085-9Search in Google Scholar

[15] Scott, D. S.: “Continuous lattices”. In: Lecture Notes in Math. 274, 1972, pp. 97–136.10.1007/BFb0073967Search in Google Scholar

[16] Scott, D. S.: Domains for denotational semantics. In: Lecture Notes in Comput. Sci. 140, 1982, pp. 577–613.10.1007/BFb0012801Search in Google Scholar

[17] Spreen, D.—Xu, L.—Mao, X.: Information systems revisited – the general continuous case, Theoret. Comp. Sci. 405 (2008), 176–187.10.1016/j.tcs.2008.06.032Search in Google Scholar

[18] Vickers, S.: Topology via Logic, Cambridge University Press, Cambridge, 1989.Search in Google Scholar

[19] Wyler, O.: Dedekind complete posets and Scott-topologies. In: Continuous Lattices Proceedings (B. Baneschewski, R. Hoffmann, eds.), Lecture Notes in Math. 871, Springer-Verlag, 1981, pp. 384–389.10.1007/BFb0089920Search in Google Scholar

[20] Xu, L.—Mao, X.: Various constructions of continuous information systems. In: Electron. Notes Theor. Comput. Sci. 212, 2008, pp. 299–311.10.1016/j.entcs.2008.04.069Search in Google Scholar

[21] Zhao, D.—Fan, T.: DCPO-completion of posets. Theoret. Comput. Sci. 411 (2010), 2167–2173.10.1016/j.tcs.2010.02.020Search in Google Scholar

Received: 2015-9-14
Accepted: 2017-1-13
Published Online: 2018-3-31
Published in Print: 2018-4-25

© 2018 Mathematical Institute Slovak Academy of Sciences

Downloaded on 12.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ms-2017-0098/html
Scroll to top button