A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Computer Science Journal of Moldova
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 T-consequence relation for such logics.fatcat:vnyvdoyvgrggfpikxv27danpte