A THEOREM ON ORDER EXTENSIONS - EMBEDDABILITY OF A SYSTEM OF WEAK ORDERS TO MEET SOLVABILITY CONSTRAINTS

DC FieldValueLanguage
dc.contributor.authorSUCK, R
dc.date.accessioned2021-12-23T16:01:45Z-
dc.date.available2021-12-23T16:01:45Z-
dc.date.issued1994
dc.identifier.issn00222496
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/5139-
dc.description.abstractIn this note an embeddability theorem is proved. It is shown that a system (A, less-than-or-equal-to, L, M), in which A is a set and less-than-or-equal-to, L, M are weak orders on A fulfilling a few compatibility constraints, can be extended to a larger system satisfying certain solvability conditions. The original structure can be shown to be closely related to conjoint measurement of independent components. Since in the extended structure the solvability of equations which are needed to apply representation theorems of measurement theory is guaranteed, the main result of this paper adds to the applicability of conjoint structures. The proof uses a well known extension theorem of order theory by Szpilrajn. (C) 1994 Academic Press, Inc.
dc.language.isoen
dc.publisherACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS
dc.relation.ispartofJOURNAL OF MATHEMATICAL PSYCHOLOGY
dc.subjectMathematical Methods In Social Sciences
dc.subjectMathematics
dc.subjectMathematics, Interdisciplinary Applications
dc.subjectPsychology
dc.subjectPsychology, Mathematical
dc.subjectSocial Sciences, Mathematical Methods
dc.titleA THEOREM ON ORDER EXTENSIONS - EMBEDDABILITY OF A SYSTEM OF WEAK ORDERS TO MEET SOLVABILITY CONSTRAINTS
dc.typenote
dc.identifier.doi10.1006/jmps.1994.1008
dc.identifier.isiISI:A1994NF25800008
dc.description.volume38
dc.description.issue1
dc.description.startpage128
dc.description.endpage134
dc.publisher.place525 B ST, STE 1900, SAN DIEGO, CA 92101-4495
dcterms.isPartOf.abbreviationJ. Math. Psychol.
Show simple item record

Page view(s)

3
Last Week
0
Last month
0
checked on Apr 14, 2024

Google ScholarTM

Check

Altmetric