A theorem on order extensions: Embeddability of a system of weak orders to meet solvability constraints
From MaRDI portal
Publication:1320105
DOI10.1006/JMPS.1994.1008zbMATH Open0799.06010OpenAlexW1988816782MaRDI QIDQ1320105FDOQ1320105
Authors: 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
Recommendations
- Ribenboim's order extension theorem from a constructive point of view
- On the semilattice of weak orders of a set
- A general extension theorem for directed-complete partial orders
- On \(k\)-weak orders: Recognition and a tolerance result
- A separation theorem for the weak \(s\)-convex orders
- On the deductive system of the order of an equationally orderable quasivariety
- An order theoretic approach in fixed point theory
- On the quasi-ordering of Borel linear orders under embeddability
- An extension of Fishburn's theorem on extending orders
- scientific article; zbMATH DE number 1107722
embeddabilityweak orderssolvability of equationsconjoint structuresconjoint measurement of independent componentssets with several orders
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
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)