Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Many-Sorted First-Order Composition-Nominative Logic as Institution
Authors: Alexey Chentsov
Keywords: Institution theory, many-sorted nominative data, irrefutability.
– 0.20 Mb
Keywords: Institution theory, many-sorted nominative data, irrefutability.
Abstract
In the paper the institution for many-sorted first-order compo\-sition-nominative logic (CNL) is considered. The difference from the author's previous paper on this topic is richer logical system in question due to addition of operations and sorts, and also a slightly weakened constraint on signature morphisms regarding the set of names. The satisfaction condition is proven. Some directions for further research are outlined.Taras Shevchenko National University of Kyiv
01601, Kyiv, Volodymyrska st, 60
Phone: +38044 2590511
E-mail:
01601, Kyiv, Volodymyrska st, 60
Phone: +38044 2590511
E-mail:
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
Fulltext
– 0.20 Mb
Contents
- Universics: a Theory of Universes of Discourse for Metamathematics and Foundations
- Many-Sorted First-Order Composition-Nominative Logic as Institution
- Some applications of quasigroups in cryptology
- Stream Deniable-Encryption Algorithms
- Taxonomy of Strategic Games with Information Leaks and Corruption of Simultaneity
- Optical Character Recognition Applied to Romanian Printed Texts of the 18th20th Century
- Large-scale executable biology using rapid integration of computational models
- Advantages of application of unconventional computing to image processing and whence these advances come
