Composition-nominative logics of free-quantifier levels

• Published in: PROBLEMS IN PROGRAMMING
• Date: 2018
• Issue: 2-3
• Pages: 38-47
• ISSN: 1727-4907
• Author Affiliations: S.S. Shkilniak — Kiev Taras Shevchenko National University; D.B. Volkovytskyi — Kiev Taras Shevchenko National University
• Keywords: суперпозиція, рівність, логічний наслідок, рівноправність, логіка, предикація, недетермінований предикат, квазіарний предикат, предикативність, то- чка рівноваги
• Main Authors: Shkilniak, S.S., Volkovytskyi, D.B.
• Format: Article
• Language: Ukrainian
• Published: PROBLEMS IN PROGRAMMING 2018
• Subjects: free-quantifier logic; predicate; renomination; superposition; equality; logical consequence; UDC 004.42:510.69
• Online Access: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/180
• Journal Title: Problems in programming

Free-quantifier composition nominative logics of partial quasiary predicates are considered. We specify the following levels of these logics: renominative, renominative with predicates of weak equality, renominative with predicates of strong equality, free-quantifier, free-quantifier with composition of weak equality, free-quantifier with composition of strong equality. The paper is mainly dedicated to investigation ofNlogics of free-quantifier levels with equality. Languages and semantic models of such logics are described, their semantic properties are studied, in particular the properties of relations of logical consequence.Problems in programming 2016; 2-3: 38-47