INFORMAZIONI SU QUESTO ARTICOLO

Cita

[1] Raymond Balbes and Philip Dwinger. Distributive Lattices. University of Missouri Press, 1975.Search in Google Scholar

[2] T.S. Blyth and J. Varlet. Ockham Algebras. Oxford science publications. Oxford University Press, 1994.Search in Google Scholar

[3] Diana Brignole and Antonio Monteiro. Caractérisation des algèbres de Nelson par des egalités. Instituto de Matemática, Universidad Nacional del Sur, Argentina, 1964.Search in Google Scholar

[4] Roberto Cignoli. Injective de Morgan and Kleene algebras. Proceedings of the American Mathematical Society, 47(2):269–278, 1975.10.1090/S0002-9939-1975-0357259-4Search in Google Scholar

[5] J.P. Cleave. A Study of Logics. Oxford logic guides. Clarendon Press, 1991. ISBN 9780198532118.Search in Google Scholar

[6] J.H. Conway. Regular algebra and finite machines. Chapman and Hall mathematics series. Chapman and Hall, 1971.Search in Google Scholar

[7] R.W. Floyd. Assigning meanings to programs. Mathematical aspects of computer science, 19(19–32), 1967.10.1090/psapm/019/0235771Search in Google Scholar

[8] Adam Grabowski. Robbins algebras vs. Boolean algebras. Formalized Mathematics, 9(4): 681–690, 2001.Search in Google Scholar

[9] C.A.R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576–580, 1969.10.1145/363235.363259Search in Google Scholar

[10] Ievgen Ivanov. On the underapproximation of reach sets of abstract continuous-time systems. In Erika Ábrahám and Sergiy Bogomolov, editors, Proceedings 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis, SNR@ETAPS 2017, Uppsala, Sweden, 22nd April 2017, volume 247 of EPTCS, pages 46–51, 2017. doi:10.4204/EPTCS.247.4.10.4204/EPTCS.247.4Search in Google Scholar

[11] Ievgen Ivanov. On representations of abstract systems with partial inputs and outputs. In T. V. Gopal, Manindra Agrawal, Angsheng Li, and S. Barry Cooper, editors, Theory and Applications of Models of Computation – 11th Annual Conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings, volume 8402 of Lecture Notes in Computer Science, pages 104–123. Springer, 2014. ISBN 978-3-319-06088-0. doi:10.1007/978-3-319-06089-7_8.10.1007/978-3-319-06089-7_8Search in Google Scholar

[12] Ievgen Ivanov. On local characterization of global timed bisimulation for abstract continuous-time systems. In Ichiro Hasuo, editor, Coalgebraic Methods in Computer Science – 13th IFIP WG 1.3 International Workshop, CMCS 2016, Colocated with ETAPS 2016, Eindhoven, The Netherlands, April 2–3, 2016, Revised Selected Papers, volume 9608 of Lecture Notes in Computer Science, pages 216–234. Springer, 2016. ISBN 978-3-319-40369-4. doi:10.1007/978-3-319-40370-0_13.10.1007/978-3-319-40370-0_13Open DOISearch in Google Scholar

[13] Ievgen Ivanov, Mykola Nikitchenko, and Uri Abraham. On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems, pages 78–99. Springer International Publishing, 2014. ISBN 978-3-319-13206-8. doi:10.1007/978-3-319-13206-8_4.10.1007/978-3-319-13206-8_4Search in Google Scholar

[14] Ievgen Ivanov, Mykola Nikitchenko, and Uri Abraham. Event-based proof of the mutual exclusion property of Peterson’s algorithm. Formalized Mathematics, 23(4):325–331, 2015. doi:10.1515/forma-2015-0026.10.1515/forma-2015-0026Open DOISearch in Google Scholar

[15] Ievgen Ivanov, Mykola Nikitchenko, and Volodymyr G. Skobelev. Proving properties of programs on hierarchical nominative data. The Computer Science Journal of Moldova, 24(3):371–398, 2016.Search in Google Scholar

[16] J. A. Kalman. Lattices with involution. Transactions of the American Mathematical Society, 87(2):485–485, February 1958. doi:10.1090/s0002-9947-1958-0095135-x.10.1090/s0002-9947-1958-0095135-xOpen DOISearch in Google Scholar

[17] S.C. Kleene. Introduction to Metamathematics. North-Holland Publishing Co., Amsterdam, and P. Noordhoff, Groningen, 1952.Search in Google Scholar

[18] S. Körner. Experience and Theory: An Essay in the Philosophy of Science. International library of philosophy and scientific method. Routledge & Kegan Paul, 1966.Search in Google Scholar

[19] Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the algebra of nominative data in Mizar. In Maria Ganzha, Leszek A. Maciaszek, and Marcin Paprzycki, editors, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3–6, 2017., pages 237–244, 2017. ISBN 978-83-946253-7-5. doi:10.15439/2017F301.10.15439/2017F301Search in Google Scholar

[20] Artur Korniłowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. An approach to formalization of an extension of Floyd-Hoare logic. In Vadim Ermolayev, Nick Bassiliades, Hans-Georg Fill, Vitaliy Yakovyna, Heinrich C. Mayr, Vyacheslav Kharchenko, Vladimir Peschanenko, Mariya Shyshkina, Mykola Nikitchenko, and Aleksander Spivakovsky, editors, Proceedings of the 13th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, Kyiv, Ukraine, May 15–18, 2017, volume 1844 of CEUR Workshop Proceedings, pages 504–523. CEUR-WS.org, 2017.Search in Google Scholar

[21] Artur Korniłowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the Nominative Algorithmic Algebra in Mizar, pages 176–186. Springer International Publishing, 2018. ISBN 978-3-319-67229-8. doi:10.1007/978-3-319-67229-8_16.10.1007/978-3-319-67229-8_16Search in Google Scholar

[22] Dexter Kozen. On Kleene algebras and closed semirings, pages 26–47. Springer Berlin Heidelberg, 1990. doi:10.1007/BFb0029594.10.1007/BFb0029594Open DOISearch in Google Scholar

[23] Andrii Kryvolap, Mykola Nikitchenko, and Wolfgang Schreiner. Extending Floyd-Hoare Logic for Partial Pre- and Postconditions, pages 355–378. Springer International Publishing, 2013. ISBN 978-3-319-03998-5. doi:10.1007/978-3-319-03998-5_18.10.1007/978-3-319-03998-5_18Open DOISearch in Google Scholar

[24] Antonio Monteiro and Luiz Monteiro. Axiomes indépendants pour les algèbres de Nelson, de Łukasiewicz trivalentes, de de Morgan et de Kleene. Notas de lógica matemática, (40): 1–11, 1996.10.1305/ndjfl/1093894076Search in Google Scholar

[25] Maurizio Negri. Three valued semantics and DMF-algebras. Boll. Un. Mat. Ital. B (7), 10(3):733–760, 1996.Search in Google Scholar

[26] Maurizio Negri. DMF-algebras: representation and topological characterization. Boll. Unione Mat. Ital. Sez. B Artic. Ric. Mat. (8), 1(2):369–390, 1998.Search in Google Scholar

[27] Maurizio Negri. Partial probability and Kleene logic, 2013.Search in Google Scholar

[28] M.S. Nikitchenko and S.S. Shkilniak. Mathematical logic and theory of algorithms. Publishing house of Taras Shevchenko National University of Kyiv, Ukraine (in Ukrainian), 2008.Search in Google Scholar

[29] M.S. Nikitchenko and S.S. Shkilniak. Applied logic. Publishing house of Taras Shevchenko National University of Kyiv, Ukraine (in Ukrainian), 2013.Search in Google Scholar

[30] Mykola Nikitchenko and Stepan Shkilniak. Algebras and logics of partial quasiary predicates. Algebra and Discrete Mathematics, 23(2):263–278, 2017.Search in Google Scholar

[31] Nikolaj S. Nikitchenko. A composition nominative approach to program semantics. Technical Report IT-TR 1998-020, Department of Information Technology, Technical University of Denmark, 1998.Search in Google Scholar

[32] Helena Rasiowa. An Algebraic Approach to Non-Classical Logics. North Holland, 1974.Search in Google Scholar

[33] Volodymyr G. Skobelev, Mykola Nikitchenko, and Ievgen Ivanov. On algebraic properties of nominative data and functions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications – 10th International Conference, ICTERI 2014, Kherson, Ukraine, June 9–12, 2014, Revised Selected Papers, volume 469 of Communications in Computer and Information Science, pages 117–138. Springer, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8_6.10.1007/978-3-319-13206-8_6Search in Google Scholar

eISSN:
1898-9934
ISSN:
1426-2630
Lingua:
Inglese
Frequenza di pubblicazione:
Volume Open
Argomenti della rivista:
Computer Sciences, other, Mathematics, General Mathematics