<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Nikitcenko, M.</creatorName>
<affiliation>Universitatea Naţională „Taras Shevchenko“, Kiev, Ucraina</affiliation>
</creator>
<creator>
<creatorName>Shkilniak, S.</creatorName>
<affiliation>Universitatea Naţională „Taras Shevchenko“, Kiev, Ucraina</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Towards Representation of Classical Logic as Logic of Partial Quasiary Predicates</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2017</publicationYear>
<relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978‐9975‐4237‐6‐2</relatedIdentifier>
<subjects>
<subject>classical predicate logic</subject>
<subject>First-order logic</subject>
<subject>partial
predicate</subject>
<subject>quasiary predicate</subject>
<subject>quasiary logic</subject>
</subjects>
<dates>
<date dateType='Issued'>2017</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>Quasiary predicates are partial predicates over partial states (partial assignments) of variables. Such predicates do not have a fixed arity. They are used to represent program conditions and requirements, therefore logics of quasiary predicates are programoriented logics. Classical predicate logic is based on total n-ary predicates. We demonstrate how classical logic can be represented as logic of quasiary predicates. Properties of such representation are investigated. Obtained results can be used for program verification.</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>