5 research outputs found
Semantic Properties of T-consequence Relation in Logics of Quasiary Predicates
In the paper we investigate semantic properties of program-oriented algebras and logics defined for classes of quasiary predicates. Informally speaking, such predicates are partial predicates defined over partial states (partial assignments) of variables. Conventional n-ary predicates can be considered as a special case of quasiary predicates. We define first-order logics of quasiary non-deterministic predicates and investigate semantic properties of -consequence relation for such logics. Specific properties of -consequence relation for the class of deterministic predicates are also considered. Obtained results can be used to prove logic validity and completeness
Algebras and logics of partial quasiary predicates
In the paper we investigate algebras and logics defined for classes of partial quasiary predicates. Informally speaking, such predicates are partial predicates defined over partial states (partial assignments) of variables. Conventional n-ary predicates can be considered as a special case of quasiary predicates. The notion of quasiary predicate, as well as the notion of quasiary function, is used in computer science to represent semantics of computer programs and their components. We define extended first-order algebras of partial quasiary predicates and investigate their properties. Based on such algebras we define a logic with irrefutability consequence relation. A sequent calculus is constructed for this logic, its soundness and completeness are proved
Π‘Π΅ΠΌΠ°Π½ΡΠΈΡΠ½Ρ Π²Π»Π°ΡΡΠΈΠ²ΠΎΡΡΡ Π»ΠΎΠ³ΡΠΊ Π·Π°Π³Π°Π»ΡΠ½ΠΈΡ Π½Π΅Π΄Π΅ΡΠ΅ΡΠΌΡΠ½ΠΎΠ²Π°Π½ΠΈΡ ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ²
ΠΠ°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎ ΡΠ° Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ Π½ΠΎΠ²ΠΈΠΉ ΠΊΠ»Π°Ρ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠ½ΠΎ-ΠΎΡΡΡΠ½ΡΠΎΠ²Π°Π½ΠΈΡ
Π»ΠΎΠ³ΡΡΠ½ΠΈΡ
ΡΠΎΡΠΌΠ°Π»ΡΠ·ΠΌΡΠ² β Π»ΠΎΠ³ΡΠΊΠΈ Π·Π°Π³Π°Π»ΡΠ½ΠΈΡ
Π½Π΅Π΄Π΅ΡΠ΅ΡΠΌΡΠ½ΠΎΠ²Π°Π½ΠΈΡ
ΠΊΠ²Π°Π·ΡΠ°ΡΠ½ΠΈΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ² (GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ²). Π’Π°ΠΊΡ ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠΈ Ρ ΡΠ·Π°Π³Π°Π»ΡΠ½Π΅Π½Π½ΡΠΌ ΡΠ°ΡΡΠΊΠΎΠ²ΠΈΡ
Π½Π΅ΠΎΠ΄Π½ΠΎΠ·Π½Π°ΡΠ½ΠΈΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ² ΡΠ΅Π»ΡΡΡΠΉΠ½ΠΎΠ³ΠΎ ΡΠΈΠΏΡ. ΠΠΎΠΊΠ°Π·Π°Π½ΠΎ Π·Π²'ΡΠ·ΠΎΠΊ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ² ΡΠ· 7-Π·Π½Π°ΡΠ½ΠΈΠΌΠΈ ΡΠΎΡΠ°Π»ΡΠ½ΠΈΠΌΠΈ Π΄Π΅ΡΠ΅ΡΠΌΡΠ½ΠΎΠ²Π°Π½ΠΈΠΌΠΈ ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠ°ΠΌΠΈ. Π ΠΎΠ·Π³Π»ΡΠ½ΡΡΠΎ ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΡΡ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ², Π½Π°Π²Π΅Π΄Π΅Π½ΠΎ ΡΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠ½Ρ Π²Π»Π°ΡΡΠΈΠ²ΠΎΡΡΡ. ΠΠΏΠΈΡΠ°Π½ΠΎ ΠΌΠΎΠ²ΠΈ ΡΠΈΡΡΠΈΡ
ΠΏΠ΅ΡΡΠΎΠΏΠΎΡΡΠ΄ΠΊΠΎΠ²ΠΈΡ
Π»ΠΎΠ³ΡΠΊ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ² ΡΠ° ΡΡ
ΡΠ½ΡΠ΅ΡΠΏΡΠ΅ΡΠ°ΡΡΡ. ΠΠΈΠ·Π½Π°ΡΠ΅Π½ΠΎ Π²ΡΠ΄Π½ΠΎΡΠ΅Π½Π½Ρ Π»ΠΎΠ³ΡΡΠ½ΠΎΠ³ΠΎ G-Π½Π°ΡΠ»ΡΠ΄ΠΊΡ, Π΄ΠΎΠ²Π΅Π΄Π΅Π½ΠΎ ΠΉΠΎΠ³ΠΎ ΠΌΠΎΠ½ΠΎΡΠΎΠ½Π½ΡΡΡΡ ΡΠ° Π²Π»Π°ΡΡΠΈΠ²ΠΎΡΡΡ Π΄Π΅ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΡΡ ΡΠΎΡΠΌΡΠ».A new class of program-oriented logical formalisms - the logics of general non-deterministic quasiary predicates (GND-predicates) β is proposed and investigated. Such predicates are a generalization of partial non-deterministic predicates of relational type. The relationship between GND-predicates and 7-valued total deterministic predicates is shown. Compositions of GND-predicates are considered; their characteristic properties are presented. The languages of pure first-order logics of GND-predicates and their interpretations are described. The G-consequence relation is defined, its monotonicity is investigated, and the properties of the formulas decompositions are proved
ΠΠΎΠ³ΡΡΠ½ΠΈΠΉ Π½Π°ΡΠ»ΡΠ΄ΠΎΠΊ ΡΠ° ΠΉΠΎΠ³ΠΎ ΡΠΎΡΠΌΠ°Π»ΡΠ·Π°ΡΡΡ Π² ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΡΠΉΠ½ΠΎ-Π½ΠΎΠΌΡΠ½Π°ΡΠΈΠ²Π½ΠΈΡ Π»ΠΎΠ³ΡΠΊΠ°Ρ
ΠΠ»Ρ ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΡΠΉΠ½ΠΎ-Π½ΠΎΠΌΡΠ½Π°ΡΠΈΠ²Π½ΠΈΡ
Π»ΠΎΠ³ΡΠΊ ΡΠ°ΡΡΠΊΠΎΠ²ΠΈΡ
ΠΎΠ΄Π½ΠΎΠ·Π½Π°ΡΠ½ΠΈΡ
, ΡΠΎΡΠ°Π»ΡΠ½ΠΈΡ
ΡΠ° ΡΠ°ΡΡΠΊΠΎΠ²ΠΈΡ
Π½Π΅ΠΎΠ΄Π½ΠΎΠ·Π½Π°ΡΠ½ΠΈΡ
ΠΊΠ²Π°Π·ΡΠ°ΡΠ½ΠΈΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ² Π·Π°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎ ΡΡΠ·Π½Ρ ΡΠ΅ΠΌΠ°Π½ΡΠΈΠΊΠΈ ΡΠ° ΡΡΠ·Π½Ρ ΡΠΎΡΠΌΠ°Π»ΡΠ·Π°ΡΡΡ Π²ΡΠ΄Π½ΠΎΡΠ΅Π½Π½Ρ Π»ΠΎΠ³ΡΡΠ½ΠΎΠ³ΠΎ Π½Π°ΡΠ»ΡΠ΄ΠΊΡ. ΠΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ Π²Π»Π°ΡΡΠΈΠ²ΠΎΡΡΡ ΡΠ°ΠΊΠΈΡ
ΡΠΎΡΠΌΠ°Π»ΡΠ·Π°ΡΡΠΉ, Π²ΠΈΠ·Π½Π°ΡΠ΅Π½ΠΎ ΡΠΏΡΠ²Π²ΡΠ΄Π½ΠΎΡΠ΅Π½Π½Ρ ΠΌΡΠΆ ΡΡΠ·Π½ΠΈΠΌΠΈ Π²ΡΠ΄Π½ΠΎΡΠ΅Π½Π½ΡΠΌΠΈ Π»ΠΎΠ³ΡΡΠ½ΠΎΠ³ΠΎ Π½Π°ΡΠ»ΡΠ΄ΠΊΡ Π² ΡΡΠ·Π½ΠΈΡ
ΡΠ΅ΠΌΠ°Π½ΡΠΈΠΊΠ°Ρ
.ΠΠ»Ρ ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΠΈΠΎΠ½Π½ΠΎ-Π½ΠΎΠΌΠΈΠ½Π°ΡΠΈΠ²Π½ΡΡ
Π»ΠΎΠ³ΠΈΠΊ ΡΠ°ΡΡΠΈΡΠ½ΡΡ
ΠΎΠ΄Π½ΠΎΠ·Π½Π°ΡΠ½ΡΡ
, ΡΠΎΡΠ°Π»ΡΠ½ΡΡ
ΠΈ ΡΠ°ΡΡΠΈΡΠ½ΡΡ
Π½Π΅ΠΎΠ΄Π½ΠΎ- Π·Π½Π°ΡΠ½ΡΡ
ΠΊΠ²Π°Π·ΠΈΠ°ΡΠ½ΡΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠΎΠ² ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Ρ ΡΠ°Π·Π½ΡΠ΅ ΡΠ΅ΠΌΠ°Π½ΡΠΈΠΊΠΈ ΠΈ ΡΠ°Π·Π½ΡΠ΅ ΡΠΎΡΠΌΠ°Π»ΠΈΠ·Π°ΡΠΈΠΈ ΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΡ Π»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΡΠ»Π΅Π΄ΡΡΠ²ΠΈΡ. ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½Ρ ΡΠ²ΠΎΠΉΡΡΠ²Π° ΡΠ°ΠΊΠΈΡ
ΡΠΎΡΠΌΠ°Π»ΠΈΠ·Π°ΡΠΈΠΉ, ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Ρ ΡΠΎΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΡ ΠΌΠ΅ΠΆΠ΄Ρ ΡΠ°Π·Π½ΡΠΌΠΈ ΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΡΠΌΠΈ Π»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΡΠ»Π΅Π΄ΡΡΠ²ΠΈΡ Π² ΡΠ°Π·Π½ΡΡ
ΡΠ΅ΠΌΠ°Π½ΡΠΈΠΊΠ°Ρ
.Various semantics and various formalizations of relation of logical consequence for composition nominative logics of partial single-valued, total, and partial multiple-valued quasiary predicates are introduced. The authors study properties of the defined formalizations and specify correlations of different relations of logical consequence in different semantics
ΠΠΎΠ³ΡΠΊΠΈ Π·Π°Π³Π°Π»ΡΠ½ΠΈΡ Π½Π΅Π΄Π΅ΡΠ΅ΡΠΌΡΠ½ΠΎΠ²Π°Π½ΠΈΡ ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ²: cΠ΅ΠΌΠ°Π½ΡΠΈΡΠ½Ρ Π°ΡΠΏΠ΅ΠΊΡΠΈ
ΠΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ ΡΠ΅ΠΌΠ°Π½ΡΠΈΡΠ½Ρ Π°ΡΠΏΠ΅ΠΊΡΠΈ Π½ΠΎΠ²ΠΎΠ³ΠΎ ΠΊΠ»Π°ΡΡ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠ½ΠΎ-ΠΎΡΡΡΠ½ΡΠΎΠ²Π°Π½ΠΈΡ
Π»ΠΎΠ³ΡΡΠ½ΠΈΡ
ΡΠΎΡΠΌΠ°Π»ΡΠ·ΠΌΡΠ² β Π»ΠΎΠ³ΡΠΊ Π·Π°Π³Π°Π»ΡΠ½ΠΈΡ
Π½Π΅Π΄Π΅ΡΠ΅ΡΠΌΡΠ½ΠΎΠ²Π°Π½ΠΈΡ
ΠΊΠ²Π°Π·ΡΠ°ΡΠ½ΠΈΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ², Π°Π±ΠΎ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ². ΠΠΈΠ΄ΡΠ»Π΅Π½ΠΎ ΡΡΠ·Π½ΠΎΠ²ΠΈΠ΄ΠΈ ΡΠ°ΠΊΠΈΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ², Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ Π²Π»Π°ΡΡΠΈΠ²ΠΎΡΡΡ ΡΡ
ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΡΠΉ, ΡΠΎΠ·Π³Π»ΡΠ½ΡΡΠΎ ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΡΠΉΠ½Ρ Π°Π»Π³Π΅Π±ΡΠΈ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ². ΠΠΏΠΈΡΠ°Π½ΠΎ ΠΌΠΎΠ²ΠΈ ΡΠΈΡΡΠΈΡ
ΠΏΠ΅ΡΡΠΎΠΏΠΎΡΡΠ΄ΠΊΠΎΠ²ΠΈΡ
Π»ΠΎΠ³ΡΠΊ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΡΠ². ΠΠ°ΠΏΡΠΎΠΏΠΎΠ½ΠΎΠ²Π°Π½ΠΎ ΡΠ° Π΄ΠΎΡΠ»ΡΠ΄ΠΆΠ΅Π½ΠΎ Π²ΡΠ΄Π½ΠΎΡΠ΅Π½Π½Ρ Π»ΠΎΠ³ΡΡΠ½ΠΎΠ³ΠΎ Π½Π°ΡΠ»ΡΠ΄ΠΊΡ Π΄Π»Ρ ΠΌΠ½ΠΎΠΆΠΈΠ½ ΡΠΎΡΠΌΡΠ». ΠΠΏΠΈΡΠ°Π½ΠΎ Π²Π»Π°ΡΡΠΈΠ²ΠΎΡΡΡ Π΄Π΅ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΡΡ ΡΠΎΡΠΌΡΠ» ΡΠ° Π΅Π»ΡΠΌΡΠ½Π°ΡΡΡ ΠΊΠ²Π°Π½ΡΠΎΡΡΠ².ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½Ρ ΡΠ΅ΠΌΠ°Π½ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ Π°ΡΠΏΠ΅ΠΊΡΡ Π½ΠΎΠ²ΠΎΠ³ΠΎ ΠΊΠ»Π°ΡΡΠ° ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎ-ΠΎΡΠΈΠ΅Π½ΡΠΈΡΠΎΠ²Π°Π½Π½ΡΡ
Π»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΡ
ΡΠΎΡΠΌΠ°Π»ΠΈΠ·ΠΌΠΎΠ² β Π»ΠΎΠ³ΠΈΠΊ ΠΎΠ±ΡΠΈΡ
Π½Π΅Π΄Π΅ΡΠ΅ΡΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½Π½ΡΡ
ΠΊΠ²Π°Π·ΠΈΠ°ΡΠ½ΡΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠΎΠ², ΠΈΠ»ΠΈ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠΎΠ². ΠΡΠ΄Π΅Π»Π΅Π½Ρ ΡΠ°Π·Π½ΠΎΠ²ΠΈΠ΄Π½ΠΎΡΡΠΈ ΡΠ°ΠΊΠΈΡ
ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠΎΠ², ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½Ρ ΡΠ²ΠΎΠΉΡΡΠ²Π° ΠΈΡ
ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΠΈΠΉ, ΡΠ°ΡΡΠΌΠΎΡΡΠ΅Π½Ρ ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΠΈΠΎΠ½Π½ΡΠ΅ Π°Π»Π³Π΅Π±ΡΡ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠΎΠ². ΠΠΏΠΈΡΠ°Π½Ρ ΡΠ·ΡΠΊΠΈ ΡΠΈΡΡΡΡ
ΠΏΠ΅ΡΠ²ΠΎΠΏΠΎΡΡΠ΄ΠΊΠΎΠ²ΡΡ
Π»ΠΎΠ³ΠΈΠΊ GND-ΠΏΡΠ΅Π΄ΠΈΠΊΠ°ΡΠΎΠ². ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Ρ ΠΈ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½Ρ ΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΡ Π»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΡΠ»Π΅Π΄ΡΡΠ²ΠΈΡ Π΄Π»Ρ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ² ΡΠΎΡΠΌΡΠ». ΠΠΏΠΈΡΠ°Π½Ρ ΡΠ²ΠΎΠΉΡΡΠ²Π° Π΄Π΅ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΠΈΠΈ ΡΠΎΡΠΌΡΠ» ΠΈ ΡΠ»ΠΈΠΌΠΈΠ½Π°ΡΠΈΠΈ ΠΊΠ²Π°Π½ΡΠΎΡΠΎΠ².Semantic aspects of a new class of program-oriented logical formalisms β logics of general non-deterministic quasiary predicates (GND-predicates) β are considered. Π‘lasses of GND-predicates are singled out, their compositions and algebras are investigated. The language of pure first-order logics of GND-predicates is described. The relation of the logical consequence for the sets of formulas is proposed and investigated. The properties of the decomposition of formulas and of quantifier elimination are described