Maximum predicate descriptions of sets of mappings

R. S. Takhanov

doi:10.1134/S0965542507090175

Maximum predicate descriptions of sets of mappings

R. S. Takhanov

Department of Mathematics

Research output: Contribution to journal › Article

Abstract

The work is carried out in the framework of the algebraic approach and is devoted to the problem of describing sets of mappings by pairs of m-place predicates. Maximum descriptions are distinguished in the set of all predicate descriptions, and necessary and sufficient maximality conditions are obtained. Using a partial order and betweenness relations as examples, it is shown that, for a given predicate on the set of values, the necessary maximality conditions imply some properties of this predicate on its domain. Taking this fact into account, a set of axioms for the betweenness relation is proposed, and examples of such relations are considered.

Original language	English
Pages (from-to)	1570-1581
Number of pages	12
Journal	Computational Mathematics and Mathematical Physics
Volume	47
Issue number	9
DOIs	https://doi.org/10.1134/S0965542507090175
Publication status	Published - Sep 1 2007

Keywords

Algebraic approach
Pattern recognition
Precedent learning
Predicate description

ASJC Scopus subject areas

Computational Mathematics

Access to Document

10.1134/S0965542507090175

Fingerprint Dive into the research topics of 'Maximum predicate descriptions of sets of mappings'. Together they form a unique fingerprint.

Cite this

Takhanov, R. S. (2007). Maximum predicate descriptions of sets of mappings. Computational Mathematics and Mathematical Physics, 47(9), 1570-1581. https://doi.org/10.1134/S0965542507090175

@article{2da711ec2e7f451cb54a400bc9f0de46,

title = "Maximum predicate descriptions of sets of mappings",

abstract = "The work is carried out in the framework of the algebraic approach and is devoted to the problem of describing sets of mappings by pairs of m-place predicates. Maximum descriptions are distinguished in the set of all predicate descriptions, and necessary and sufficient maximality conditions are obtained. Using a partial order and betweenness relations as examples, it is shown that, for a given predicate on the set of values, the necessary maximality conditions imply some properties of this predicate on its domain. Taking this fact into account, a set of axioms for the betweenness relation is proposed, and examples of such relations are considered.",

keywords = "Algebraic approach, Pattern recognition, Precedent learning, Predicate description",

author = "Takhanov, {R. S.}",

year = "2007",

month = sep,

day = "1",

doi = "10.1134/S0965542507090175",

language = "English",

volume = "47",

pages = "1570--1581",

journal = "Computational Mathematics and Mathematical Physics",

issn = "0965-5425",

publisher = "Maik Nauka-Interperiodica Publishing",

number = "9",

}

TY - JOUR

T1 - Maximum predicate descriptions of sets of mappings

AU - Takhanov, R. S.

PY - 2007/9/1

Y1 - 2007/9/1

N2 - The work is carried out in the framework of the algebraic approach and is devoted to the problem of describing sets of mappings by pairs of m-place predicates. Maximum descriptions are distinguished in the set of all predicate descriptions, and necessary and sufficient maximality conditions are obtained. Using a partial order and betweenness relations as examples, it is shown that, for a given predicate on the set of values, the necessary maximality conditions imply some properties of this predicate on its domain. Taking this fact into account, a set of axioms for the betweenness relation is proposed, and examples of such relations are considered.

AB - The work is carried out in the framework of the algebraic approach and is devoted to the problem of describing sets of mappings by pairs of m-place predicates. Maximum descriptions are distinguished in the set of all predicate descriptions, and necessary and sufficient maximality conditions are obtained. Using a partial order and betweenness relations as examples, it is shown that, for a given predicate on the set of values, the necessary maximality conditions imply some properties of this predicate on its domain. Taking this fact into account, a set of axioms for the betweenness relation is proposed, and examples of such relations are considered.

KW - Algebraic approach

KW - Pattern recognition

KW - Precedent learning

KW - Predicate description

UR - http://www.scopus.com/inward/record.url?scp=34848911013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34848911013&partnerID=8YFLogxK

U2 - 10.1134/S0965542507090175

DO - 10.1134/S0965542507090175

M3 - Article

AN - SCOPUS:34848911013

VL - 47

SP - 1570

EP - 1581

JO - Computational Mathematics and Mathematical Physics

JF - Computational Mathematics and Mathematical Physics

SN - 0965-5425

IS - 9

ER -