Sign Up to like & get
recommendations!
0
Published in 2019 at "Order"
DOI: 10.1007/s11083-018-9454-7
Abstract: We call a linear order L strongly surjective if whenever K is a suborder of L then there is a surjective f : L → K so that x ≤ y implies f(x) ≤ f(y).…
read more here.
Keywords:
order;
strongly surjective;
linear orders;
surjective linear ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Order"
DOI: 10.1007/s11083-018-9458-3
Abstract: Two structures A and B are n-equivalent if player II has a winning strategy in the n-move Ehrenfeucht-Fraïssé game on A and B. We extend earlier results about n-equivalence classes for finite coloured linear orders,…
read more here.
Keywords:
coloured linear;
representatives finite;
optimal representatives;
finite coloured ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Order"
DOI: 10.1007/s11083-018-9460-9
Abstract: Two linear orderings of a same set are perpendicular if every self-mapping of this set that preserves them both is constant or the identity. Two isomorphy types of linear orderings are orthogonal if there exist…
read more here.
Keywords:
linear orderings;
type orthogonal;
linear orders;
countable linear ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "IEEE Transactions on Fuzzy Systems"
DOI: 10.1109/tfuzz.2022.3205435
Abstract: All intuitionistic fuzzy TOPSIS methods contain two key elements: (1) the order structure, which can affect the choices of positive and negative ideal-points, and construction of admissible distance/similarity measures; (2) the distance/similarity measure, which is…
read more here.
Keywords:
intuitionistic fuzzy;
linear orders;
distance;
fuzzy topsis ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2018 at "Russian Mathematics"
DOI: 10.3103/s1066369x18010085
Abstract: We give the collection of relations on computable linear orders. For any natural number n, the degree spectrum of such relations of some computable linear orders contains exactly all n-computable enumerable degrees. We also study…
read more here.
Keywords:
computable linear;
orders ershov;
linear orders;
ershov hierarchy ... See more keywords