Search references for PARTIALLY ORDERED-SPACE. Phrases containing PARTIALLY ORDERED-SPACE
See searches and references containing PARTIALLY ORDERED-SPACE!PARTIALLY ORDERED-SPACE
Group with a compatible partial order
space Ordered vector space – Vector space with a partial order Partially ordered ring – Ring with a compatible partial order Partially ordered space –
Partially_ordered_group
Mathematical set with an ordering
graph ordered by reachability. The set of subspaces of a vector space ordered by inclusion. For a partially ordered set P, the sequence space containing
Partially_ordered_set
Vector space with a partial order
ordered vector space or partially ordered vector space is a real vector space equipped with a partial order that is compatible with the vector space operations
Ordered_vector_space
Partially ordered topological space
In mathematics, a partially ordered space (or pospace) is a topological space X {\displaystyle X} equipped with a closed partial order ≤ {\displaystyle
Partially_ordered_space
Ring with a compatible partial order
targets Ordered topological vector space Ordered vector space – Vector space with a partial order Partially ordered space – Partially ordered topological
Partially_ordered_ring
targets Ordered ring Ordered vector space – Vector space with a partial order Partially ordered space – Partially ordered topological space Riesz space – Partially
Ordered topological vector space
Ordered_topological_vector_space
Algebraic object with an ordered structure
space Ordered vector space – Vector space with a partial order Partially ordered ring – Ring with a compatible partial order Partially ordered space –
Ordered_field
compatible partial order Partially ordered space – Partially ordered topological space Riesz space – Partially ordered vector space, ordered as a lattice, also
Ordered_ring
Certain topology in mathematics
continuum Order topology (functional analysis) Partially ordered space Lynn, I. L. (1962). "Linearly orderable spaces". Proceedings of the American Mathematical
Order_topology
Partially ordered vector space, ordered as a lattice
Riesz space, lattice-ordered vector space or vector lattice is a partially ordered vector space where the order structure is a lattice. Riesz spaces are
Riesz_space
Order whose elements are all comparable
defined as a synonym of totally ordered set, but generally refers to a totally ordered subset of a given partially ordered set. An extension of a given partial
Total_order
Type of random variable ordering
probability distributions (Pα)α∈F on partially ordered space (E,⪯) indexed with α∈F (where (F,⪯) is another partially ordered space, the concept of complete or
Stochastic_ordering
Generalized alphabetical order
Cartesian product of partially ordered sets; this order is a total order if and only if all factors of the Cartesian product are totally ordered. The words in
Lexicographic_order
Mathematical proposition equivalent to the axiom of choice
set theory. It states that a partially ordered set containing upper bounds for every chain (that is, every totally ordered subset) necessarily contains
Zorn's_lemma
Alternative mathematical ordering
generalization to a locally partially ordered space is studied in Roll (1993); see also Directed topology. A cyclically ordered group is a set with both
Cyclic_order
Set whose pairs have minima and maxima
subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called
Lattice_(order)
Order-preserving mathematical function
graph is a maximal monotone set. Order theory deals with arbitrary partially ordered sets and preordered sets as a generalization of real numbers. The
Monotonic_function
On chains and antichains in partial orders
and combinatorics, Dilworth's theorem states that, in any finite partially ordered set, the maximum size of an antichain of incomparable elements equals
Dilworth's_theorem
Subset of incomparable elements
a partially ordered set such that any two distinct elements in the subset are incomparable. The size of the largest antichain in a finite partially ordered
Antichain
Special subset of a partially ordered set
In mathematics, a filter or order filter is a special subset of a partially ordered set (poset), describing "large" or "eventual" elements. Filters appear
Filter_(mathematics)
Class of mathematical orderings
that is also maximum of the whole set. A well-ordered set as topological space is a first-countable space if and only if it has order type less than or
Well-order
Visual depiction of a partially ordered set
represent a finite partially ordered set, in the form of a drawing of its transitive reduction. Concretely, for a partially ordered set (S,≤) one represents
Hasse_diagram
Branch of mathematics
partially ordered set is attributed to Garrett Birkhoff in the second edition of his influential book Lattice Theory. This section introduces ordered
Order_theory
Banach space with a compatible structure of a lattice
abstract (L)-spaces. Banach space – Normed vector space that is complete Normed vector lattice Riesz space – Partially ordered vector space, ordered as a lattice
Banach_lattice
Definition of continuity for functions between posets
In mathematics, given two partially ordered sets P and Q, a function f: P → Q between them is Scott-continuous (named after the mathematician Dana Scott)
Scott_continuity
Well-quasi-ordering of finite trees
states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding. A finitary application
Kruskal's_tree_theorem
Set of vectors used to define coordinates
§ Ordered bases and coordinates below. The set ℝ2 of the ordered pairs of real numbers is a vector space under the operations of component-wise addition (a
Basis_(linear_algebra)
Type of topology in mathematics
observed an equivalence between partially ordered sets and spaces that were precisely the T0 versions of the spaces that Alexandrov had introduced. P
Alexandrov_topology
German mathematician
Tammer is the author of books including: Variational Methods in Partially Ordered Spaces (with Alfred Göpfert, Hassan Riahi, and Constantin Zălinescu, Springer
Christiane_Tammer
Nonempty, upward-directed, downward-closed subset of a partially ordered set
In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion
Ideal_(order_theory)
Concept in order theory
mathematics, specifically order theory, the join of a subset S of a partially ordered set P is the supremum (least upper bound) of S, denoted ⋁S, and similarly
Join_and_meet
In mathematics, a locally finite poset is a partially ordered set P such that for all x, y ∈ P, the interval [x, y] consists of finitely many elements
Locally_finite_poset
Mathematical phrase
used to refer to at least three similar, but distinct, classes of partially ordered sets, characterized by particular completeness properties. Complete
Complete_partial_order
Property of elements related by inequalities
x{\cancel {\overset {<}{\underset {>}{=}}}}y} is true. A totally ordered set is a partially ordered set in which any two elements are comparable. The Szpilrajn
Comparability
Mathematical ranking of a set
generalization of totally ordered sets (rankings without ties) and are in turn generalized by (strictly) partially ordered sets and preorders. There are
Weak_ordering
Topics referred to by the same term
refer to: Positive cone of an ordered field Positive cone of an ordered vector space Positive cone of a partially ordered group This disambiguation page
Positive_cone
Mathematical ordering with upper bounds
specifically x0; however, it still wouldn't be partially ordered. This example can be generalized to a metric space (X,d) by defining on X or X∖{x0} the preorder
Directed_set
Visualisation method for hierchical data
advantage of treemaps is that, by construction, they make efficient use of space. As a result, they can legibly display thousands of items on the screen
Treemapping
Size of subsets in order theory
mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of
Cofinality
Theorem in economics
contour sets of A and B are identical). He proved that, for every partially-ordered space ( X , ≻ ) {\displaystyle (X,\succ )} that is perfectly-separable
Utility representation theorem
Utility_representation_theorem
Mathematical property of subsets in order theory
partially ordered set A {\displaystyle A} admits a totally ordered cofinal subset, then we can find a subset B {\displaystyle B} that is well-ordered
Cofinal_(mathematics)
Construction in order theory
with the product order is the categorical product in the category of partially ordered sets with monotone functions. The product order generalizes to arbitrary
Product_order
Equivalence of partially ordered sets
monotone function that constitutes a suitable notion of isomorphism for partially ordered sets (posets). Whenever two posets are order isomorphic, they can
Order_isomorphism
Mathematical operator
operators on partially ordered sets.) The topological closure of a subset X of a topological space consists of all points y of the space, such that every
Closure_operator
Reflexive and transitive binary relation
bound of them, since p is a consequence of p∧q, and so is q. The partially ordered set (X/⇔,⇐) is hence also a directed set. See Lindenbaum–Tarski algebra
Preorder
Characterizes the height of any finite partially ordered set
combinatorics, Mirsky's theorem characterizes the height of any finite partially ordered set in terms of a partition of the order into a minimum number of
Mirsky's_theorem
Subset of a preorder that contains all larger elements
In mathematics, an upper set S {\displaystyle S} of a partially ordered set X {\displaystyle X} is a subset such that if s is in S and if x in X is larger
Upper_and_lower_sets
1968 film by Stanley Kubrick
featuring extraterrestrials List of films featuring space stations List of incomplete or partially lost films Voyage to the End of the Universe Jason Sperb's
2001:_A_Space_Odyssey
Simplicial set constructed from the objects and morphisms of a small category
simplices in K is partially ordered, by the relation x ≤ y if and only if x is a face of y. We may consider this partially ordered set as a category with
Nerve_(category_theory)
Partially reusable launch system and space plane
The Space Shuttle is a retired, partially reusable low Earth orbital spacecraft system that went to the International Space Station (ISS) and performed
Space_Shuttle
Algebraic structure used in logic
terminal object 1 ordered by inclusion, equivalently the morphisms from 1 to the subobject classifier Ω. The open sets of any topological space form a complete
Heyting_algebra
Type of ordering of a set
covering relation is empty. The rational numbers as a linearly ordered set are a densely ordered set in this sense, as are the algebraic numbers, the real
Dense_order
Partially ordered set in which all subsets have both a supremum and infimum
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A conditionally
Complete_lattice
Mathematical result or axiom on order relations
1914. It states that in any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset, where "maximal" is with
Hausdorff_maximal_principle
Relationship between elements of two sets
the codomain. Precisely, a binary relation over sets X and Y is a set of ordered pairs (x,y), where x is an element of X and y is an element of Y. It encodes
Binary_relation
Greatest lower bound and least upper bound
mathematics, the infimum (abbreviated inf; pl.: infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each
Infimum_and_supremum
Lattice formed by all integer partitions
Young's lattice is a lattice (and hence also a partially ordered set) Y formed by all integer partitions ordered by inclusion of their Young diagrams (or Ferrers
Young's_lattice
Isomorphism type of ordered sets
In mathematics, especially in set theory and order theory, two ordered sets X and Y are said to have the same order type if they are order isomorphic
Order_type
Property of a partially ordered set
is a fundamental property of the real numbers. More generally, a partially ordered set X has the least-upper-bound property if every non-empty subset
Least-upper-bound_property
Mathematical ordering of a partial order
linear extension may be viewed as an order-preserving bijection from a partially ordered set P to a chain C on the same ground set. A preorder is a reflexive
Linear_extension
Swedish American mathematician
Bochner with a dissertation entitled "Measure and Integral in Partially Ordered Spaces". During this time, Lagerstrom was also a mathematics instructor
Paco_Lagerstrom
Extreme element of a preorder
minimum of S is again defined dually. In the particular case of a partially ordered set, while there can be at most one maximum and at most one minimum
Maximal_and_minimal_elements
Term in the mathematical area of order theory
mathematical area of order theory, every partially ordered set P gives rise to a dual (or opposite) partially ordered set which is often denoted by Pop or
Duality_(order_theory)
order-theoretic mathematics, a series-parallel partial order is a partially ordered set built up from smaller series-parallel partial orders by two simple
Series-parallel_partial_order
Partial order with well-ordered predecessors
In set theory, a tree is a partially ordered set (T,<) such that for each t∈T, the set {s∈T:s<t} is well-ordered by the relation <. Frequently trees are
Tree_(set_theory)
Collection of mathematical objects of finite size
any partially ordered set. Note that this more general concept of boundedness does not correspond to a notion of "size". A subset S of a partially ordered
Bounded_set
model: its 'geometric semantics'. Any such model admits a natural partially ordered space (or pospace) structure i.e. a topology and a partial order. The
Directed_algebraic_topology
Method of construction of the real numbers
mathematician Norberto Cuesta Dutari [es]. More generally, if S is a partially ordered set, a completion of S means a complete lattice L with an order-embedding
Dedekind_cut
British mathematician
June 2014. Stralka, Albert (December 1980). "A partially ordered space which is not a Priestley space". Semigroup Forum. 20 (1). Springer: 293–297. doi:10
Hilary_Priestley
Particular correspondence between two partially ordered sets
connection is a particular correspondence (typically) between two partially ordered sets (posets). Galois connections find applications in various mathematical
Galois_connection
Mathematical definition
locally convex topological vector lattice. Vector lattice – Partially ordered vector space, ordered as a latticePages displaying short descriptions of redirect
Regularly_ordered
Video game series
The ending of Ignition directly sets up the opening of Dead Space 2, where Delille is ordered to find and free Isaac Clarke from an EarthGov asylum, only
Dead_Space
Theorems generalizing the Brouwer fixed-point theorem
(2019) presented some interesting results on the stability of partially ordered metric spaces for coupled fixed point iteration procedures for mixed monotone
Fixed-point theorems in infinite-dimensional spaces
Fixed-point_theorems_in_infinite-dimensional_spaces
Special type of lattice
and z in L: x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z). Viewing lattices as partially ordered sets, this says that the meet operation preserves non-empty finite
Distributive_lattice
Existence of certain infima or suprema of a given poset
properties assert the existence of certain infima or suprema of a given partially ordered set (poset). The most familiar example is the completeness of the
Completeness_(order_theory)
vector optimization problem: The objective space is the finite dimensional Euclidean space partially ordered by the component-wise "less than or equal
Vector_optimization
2020s class of partially reusable spacecraft
of partially reusable spacecraft developed, manufactured, and operated by the American space company SpaceX for flights to the International Space Station
SpaceX_Dragon_2
Condition in order theory and topology
In order theory, a partially ordered set X is said to satisfy the countable chain condition, or to be ccc, if every strong antichain in X is countable
Countable_chain_condition
Partially ordered set
In order theory, a continuous poset is a partially ordered set in which every element is the directed supremum of elements approximating it. Let a , b
Continuous_poset
where T0 spaces occur in denotational semantics. The specialization order is also important for identifying suitable topologies on partially ordered sets
Specialization_preorder
Void between celestial bodies
The cost of access to space has declined since 2013. Partially reusable rockets such as the Falcon 9 have lowered access to space below $3,500 per kg.
Outer_space
Set theory concept
Descriptive set theory – Subfield of mathematical logic Graded poset – Partially ordered set equipped with a rank function – a graded poset is analogous to
Prewellordering
Smallest transitive relation containing a given binary relation
relation on any set, the "less than or equal" relation on any linearly ordered set, and the relation "x was born before y" on the set of all people. Symbolically
Transitive_closure
1986 American crewed rocket launch accident
the second disaster. The Space Shuttle was a partially reusable spacecraft operated by the US National Aeronautics and Space Administration (NASA). It
Space Shuttle Challenger disaster
Space_Shuttle_Challenger_disaster
inequality, extreme value and mathematical optimization. Partially ordered set Preorder Totally ordered set Total preorder Chain Trichotomy Extended real number
List_of_order_theory_topics
Bourbaki also defines an inductive set to be a partially ordered set that satisfies the hypothesis of Zorn's lemma when nonempty. In descriptive set theory
Inductive_set
Polygon with an infinite number of sides
as an analogue of the regular apeirogon. An abstract polytope is a partially ordered set P (whose elements are called faces) with properties modeling those
Apeirogon
Dedicated aerial fire fighting airplane
Aerial Firefighter. In 2019, six CL-415EAF Superscooper aircraft were ordered by launch customer, Bridger Aerospace, due for delivery in April 2020.
Canadair_CL-415
Reversal of the order of elements of a binary relation
self-adjoint. Furthermore, the semigroup of endorelations on a set is also a partially ordered structure (with inclusion of relations as sets), and actually an involutive
Converse_relation
Property of a relation on a set
Ordered field Positive cone of an ordered field Ordered vector space Partially ordered Positive cone of an ordered vector space Riesz space Partially
Connected_relation
Topics referred to by the same term
number theory Ordinate in mathematics, the y element of an ordered pair (x, y) Partially ordered set Complete partial order Permutation, the act of arranging
Order
Mathematical relation inside orderings
mathematics, especially order theory, the covering relation of a partially ordered set is the binary relation which holds between comparable elements
Covering_relation
Type of logical relation
Ordered field Positive cone of an ordered field Ordered vector space Partially ordered Positive cone of an ordered vector space Riesz space Partially
Total_relation
Partially ordered set equipped with a rank function
mathematics, in the branch of combinatorics, a graded poset is a partially-ordered set (poset) P equipped with a rank function ρ from P to the set N
Graded_poset
Topics referred to by the same term
(mathematics), a range of numbers Partially ordered set#Intervals, its generalization from numbers to arbitrary partially ordered sets A statistical level of
Interval
dynamical systems as a set of functions from time (a totally-ordered set) to some phase space. In this case, the elements of the set are usually referred
Prefix_order
British science fiction TV series (1975–1977)
1975. Due to the production delays, CBS cancelled its order for Space: 1999 and ordered Planet of the Apes for the 1974–1975 season instead, and neither
Space:_1999
Bound lattice in which every element has a complement
bounded and relatively complemented. The lattice of subspaces of a vector space provide an example of a complemented lattice that is not, in general, distributive
Complemented_lattice
Mathematical concept for comparing objects
<) is well-founded and has no infinite antichains. Let X be well partially ordered. A (necessarily finite) sequence (x1,x2,…,xn) of elements of X that
Well-quasi-ordering
Natural number
number. Mertens function (219) = 4, a record high. There are 219 partially ordered sets on four labeled elements. 219 is the smallest number that can
219_(number)
travel, tourism, insurance
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
PARTIALLY ORDERED-SPACE
travel, tourism, insurance