Composition-Nominative Logics as Institutions
Composition-nominative logics (CNL) are program-oriented logics. They are based on algebras of partial predicates which do not have fixed arity. The aim of this work is to present CNL as institutions. Homomorphisms of first-order CNL are introduced, satisfaction condition is proved. Relations with institutions for classical first-order logic are considered. Directions for further investigation are outlined.
KeywordsInstitution first-order logic partial predicate quasiary predicate composition-nominative logic
Mathematics Subject ClassificationPrimary 03B70 Secondary 03B10 03C95 03G25
Unable to display preview. Download preview PDF.
- 1.Nikitchenko, M., Shkilniak, S.: Mathematical logic and theory of algorithms. Publishing house of Taras Shevchenko National University of Kyiv, Kyiv. In Ukrainian (2008)Google Scholar
- 2.Nikitchenko, M., Chentsov, A.: Basics of intensionalized data: presets, sets, and nominats. Comput. Sci. J. Moldova, vol. 20, no. 3(60), pp. 334–365 (2012)Google Scholar
- 5.Nikitchenko, M., Ivanov, I., Kornilowicz, A., Kryvolap, A.: Extended Floyd–Hoare logic over relational nominative data. CCIS, vol. 826, pp. 41–64, Springer, Cham. (2018)Google Scholar
- 7.Béziau, J.-Y. (ed.): Universal Logic: an Anthology. Studies in Universal Logic, Springer Basel (2012)Google Scholar
- 12.Chentsov, A.: Many-sorted first-order composition-nominative logic as institution, Comput. Sci. J. Mold., vol. 24, no. 1(70), pp. 27–54 (2016) [Online]. http://www.math.md/publications/csjm/issues/v24-n1/12089/
- 14.Fernandes, D.: Translations: generalizing relative expressiveness between logics. arXiv:1706.08481 (2017)
- 15.Goguen, J., Rosu, G.: Institution morphisms, Formal Asp. Comput., vol. 13, no. 3–5, pp. 274–306 (2002) [Online]. https://doi.org/10.1007/s001650200013
- 16.Sannella, D., Tarlecki, A.: Foundations of algebraic specification and formal software development, ser. monographs in theoretical computer science. An EATCS Series. Springer-Verlag, Berlin Heidelberg (2012)Google Scholar
- 17.Nikitchenko, M., Shkilniak, S.: Towards representation of classical logic as quasiary logic. In: Proceedings of Conference on Mathematical Foundations of Informatics (MFOI-2017), pp. 133–138 (2017) [Online]. http://mfoi2017.math.md/MFOI2017_Proceedings.pdf
- 18.Charguéraud, A.: The locally nameless representation. J. Autom. Reason., vol. 49, no. 3, pp. 363–408 (2012) [Online]. https://doi.org/10.1007/s10817-011-9225-2
- 19.Kryvolap, A., Nikitchenko, M., Schreiner, W.: Extending Floyd–Hoare logic for partial pre- and postconditions. CCIS 412, 355–378 (2013)Google Scholar