Composition-nominative logics of free-quantifier levels | Zendy

S.S. Shkilniak | Zendy; D.B. Volkovytskyi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Composition-nominative logics of free-quantifier levels

Author(s) -

S.S. Shkilniak,

D.B. Volkovytskyi

Publication year - 2016

Publication title -

problems in programming

Language(s) - English

Resource type - Journals

ISSN - 1727-4907

DOI - 10.15407/pp2016.02-03.038

Subject(s) - quantifier (linguistics) , nominative case , mathematics , composition (language) , quantifier elimination , discrete mathematics , pure mathematics , linguistics , computer science , artificial intelligence , verb , philosophy

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research