Mykola S. Nikitchenko

SN Comput. Sci., 2022

2021

Revisiting Data-Information-Knowledge-Wisdom Hierarchy from a Logic Perspective.

[BibT_eX]

[DOI]

Proceedings of the 2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, 2021

2020

Sequent Calculi of First-order Logics of Partial Predicates with Extended Renominations and Composition of Predicate Complement.

[BibT_eX]

[DOI]

Proceedings of the 12th International Scientific and Practical Conference of Programming (UkrPROG 2020), 2020

Sequent Calculus for a Program-oriented Predicate Logic over Complex-Named Data.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Advanced Computer Information Technologies, 2020

2019

Completeness of the First-Order Logic of Partial Quasiary Predicates with the Complement Composition.

[BibT_eX]

[DOI]

Tohrul Mamedov

Comput. Sci. J. Moldova, 2019

Program-Oriented Logics of Renominative Level with Extended Renomination and Equality.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2019

Program Logics of Renominative Level with the Composition of Predicate Complement.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on ICT in Education, 2019

Expressibility in the Kleene Algebra of Partial Predicates with the Complement Composition.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2019

On the Kleene Algebra of Partial Predicates with Predicate Complement.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on ICT in Education, 2019

Program Logics Based on Algebras with the Composition of Predicate Complement.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Advanced Computer Information Technologies, 2019

2018

Composition-Nominative Logics as Institutions.

[BibT_eX]

[DOI]

Alexey Chentsov

Logica Universalis, 2018

Kleene Algebra of Partial Predicates.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

Partial Correctness of GCD Algorithm.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

An Inference System of an Extension of Floyd-Hoare Logic for Partial Predicates.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

On an Algorithmic Algebra over Simple-Named Complex-Valued Nominative Data.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

On Algebras of Algorithms and Specifications over Uninterpreted Data.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

Implementation of the Composition-nominative Approach to Program Formalization in Mizar.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2018

Логіки загальних недетермінованих предикатів: cемантичні аспекти Logics of general non-deterministic predicates: semantic aspects.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference of Programming UkrPROG 2018, Kyiv, 2018

Inference Rules for the Partial Floyd-Hoare Logic Based on Composition of Predicate Complement.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2018

On the Sequence Rule for the Floyd-Hoare Logic with Partial Pre- and Post-Conditions.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on ICT in Education, 2018

Satisfiability Problems in Quasiary Program Logics.

[BibT_eX]

[DOI]

Valentyn G. Tymofieiev

Proceedings of the International Conference Advanced Computer Information Technologies, 2018

2017

Simple-Named Complex-Valued Nominative Data - Definition and Basic Operations.

[BibT_eX]

[DOI]

Formaliz. Math., 2017

Nominative data with ordered set of names.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2017

Formalization of the Nominative Algorithmic Algebra in Mizar.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology - ISAT 2017, 2017

Extended Floyd-Hoare Logic over Relational Nominative Data.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2017

An Approach To Formalization of an Extension of Floyd-Hoare Logic.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on ICT in Education, 2017

Formalization of the Algebra of Nominative Data in Mizar.

[BibT_eX]

[DOI]

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016

Proving Properties of Programs on Hierarchical Nominative Data.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2016

Pure first-order logics of quasiary predicates.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference of Programming UkrPROG'2016, Kyiv, 2016

2015

Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm.

[BibT_eX]

[DOI]

Uri Abraham

Formaliz. Math., 2015

Set-theoretic Analysis of Nominative Data.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2015

Semantic Properties of T-consequence Relation in Logics of Quasiary Predicates.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2015

2014

Першопорядкові композиційно-номінативні логіки із узагальненими реномінаціями (First-order composition-nominative logics with generalized renominations).

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference of Programming, Kyiv, 2014

On Algebraic Properties of Nominative Data and Functions.

[BibT_eX]

[DOI]