Composition-nominative logics of free-quantifier levels
PROBLEMS IN PROGRAMMING · 2016
DOI: 10.15407/pp2016.02-03.038 ↗Kurz gefasst
Fachartikel in der Zeitschrift PROBLEMS IN PROGRAMMING, 2016. Verfasst von S.S. Shkilniak und 1 weiteren Autor:innen. Die Arbeit nennt 6 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
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}
}
EUVIMED