<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'>
<dc:creator>Nikitcenko, M.</dc:creator>
<dc:creator>Shkilniak, S.</dc:creator>
<dc:date>2017</dc:date>
<dc:description xml:lang='en'><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></dc:description>
<dc:source>Conference on Mathematical Foundations of Informatics () 133-138</dc:source>
<dc:subject>classical predicate logic</dc:subject>
<dc:subject>First-order logic</dc:subject>
<dc:subject>partial
predicate</dc:subject>
<dc:subject>quasiary predicate</dc:subject>
<dc:subject>quasiary logic</dc:subject>
<dc:title>Towards Representation of Classical Logic as Logic of Partial Quasiary Predicates</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>