2025-02-22T10:48:22-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22pp_isofts_kiev_ua-article-182%22&qt=morelikethis&rows=5
2025-02-22T10:48:22-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22pp_isofts_kiev_ua-article-182%22&qt=morelikethis&rows=5
2025-02-22T10:48:22-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T10:48:22-05:00 DEBUG: Deserialized SOLR response

Pure first-order logics of quasiary predicates

Pure first-order logics of partial and total, single-valued and multi-valued quasiary predicates are investigated. For these logics we describe semantic models and languages, giving special attention in our research to composition algebras of predicates and interpretation classes (sematics), and log...

Full description

Saved in:
Bibliographic Details
Main Authors: Nikitchenko, M.S., Shkilniak, О.S., Shkilniak, S.S.
Format: Article
Language:Ukrainian
Published: Інститут програмних систем НАН України 2018
Subjects:
Online Access:https://pp.isofts.kiev.ua/index.php/ojs1/article/view/182
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Pure first-order logics of partial and total, single-valued and multi-valued quasiary predicates are investigated. For these logics we describe semantic models and languages, giving special attention in our research to composition algebras of predicates and interpretation classes (sematics), and logical consequence relations for sets of formulas. For the defined relations a number of sequent type calculi is constructed; their characteristic features are extended conditions for sequent closure and original forms for quantifier elimination.Problems in programming 2016; 2-3: 73-86