A theorem on order extensions: Embeddability of a system of weak orders to meet solvability constraints

DOI10.1006/jmps.1994.1008zbMath0799.06010OpenAlexW1988816782MaRDI QIDQ1320105

Reinhard Suck

Publication date: 19 April 1994

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmps.1994.1008

zbMATH Keywords

embeddabilityweak orderssolvability of equationsconjoint structuresconjoint measurement of independent componentssets with several orders

Mathematics Subject Classification ID

Measurement theory in the social and behavioral sciences (91C05) Ordered sets (06A99)

Related Items (4)

On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller ⋮ An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis ⋮ Ordering orders ⋮ On the continuous analogue of the Szpilrajn theorem. I

This page was built for publication: A theorem on order extensions: Embeddability of a system of weak orders to meet solvability constraints