EUVIMEDSkopri EUVIMED
Crossref

Composition-nominative logics of free-quantifier levels

S.S. Shkilniak, D.B. Volkovytskyi

PROBLEMS IN PROGRAMMING · 2016

DOI: 10.15407/pp2016.02-03.038 ↗

At a glance

Journal article in PROBLEMS IN PROGRAMMING, 2016. Written by S.S. Shkilniak and 1 co-authors. 6 references.

AstrattDettalji biblijografiċiCiteRelated studies

Abstract (original language)

Free-quantifier composition nominative logics of partial quasiary predicates are considered. We specify the following levels of these logics: renominative, renominative with predicates of weak equality, renominative with predicates of strong equality, free-quantifier, free-quantifier with composition of weak equality, free-quantifier with composition of strong equality. The paper is mainly dedicated to investigation ofNlogics of free-quantifier levels with equality. Languages and semantic models of such logics are described, their semantic properties are studied, in particular the properties of relations of logical consequence.

Cite

APA

Shkilniak, S., & Volkovytskyi, D. (2016). Composition-nominative logics of free-quantifier levels. PROBLEMS IN PROGRAMMING. https://doi.org/10.15407/pp2016.02-03.038

Vancouver

Shkilniak S, Volkovytskyi D. Composition-nominative logics of free-quantifier levels. PROBLEMS IN PROGRAMMING. 2016. doi:10.15407/pp2016.02-03.038

BibTeX
@article{Shkilniak2016,
  author = {Shkilniak, S.S. and Volkovytskyi, D.B.},
  title = {Composition-nominative logics of free-quantifier levels},
  journal = {PROBLEMS IN PROGRAMMING},
  year = {2016},
  doi = {10.15407/pp2016.02-03.038}
}
Start for free →