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

DOI10.1006/JMPS.1994.1008zbMATH Open0799.06010OpenAlexW1988816782MaRDI QIDQ1320105FDOQ1320105

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)

Cited In (5)

• On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller
• On the continuous analogue of the Szpilrajn theorem. I
• Ribenboim's order extension theorem from a constructive point of view
• An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis
• Ordering orders

Recommendations

• On the deductive system of the order of an equationally orderable quasivariety 👍 👎
• On the quasi-ordering of Borel linear orders under embeddability 👍 👎
• On \(k\)-weak orders: Recognition and a tolerance result 👍 👎
• An order theoretic approach in fixed point theory 👍 👎
• An extension of Fishburn's theorem on extending orders 👍 👎
• On the semilattice of weak orders of a set 👍 👎
• Ribenboim's order extension theorem from a constructive point of view 👍 👎
• A separation theorem for the weak \(s\)-convex orders 👍 👎
• A General Extension Theorem for Directed-Complete Partial Orders 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1320105)