Help


[permalink] [id link]
+
Page "Greatest element" ¶ 1
from Wikipedia
Edit
Promote Demote Fragment Fix

Some Related Sentences

Formally and given
Formally given to bishop Philip of Senj, the permission to use the Glagolitic liturgy ( the Roman Rite conducted in Slavic language instead of Latin, not the Byzantine rite ), actually extended to all Croatian lands, mostly along the Adriatic coast.
Formally, we are given a set of hypotheses and a set of manifestations ; they are related by the domain knowledge, represented by a function that takes as an argument a set of hypotheses and gives as a result the corresponding set of manifestations.
Formally, the two parts are given by the following expression, where is the number being encoded:
Formally the self-inductance of a wire loop would be given by the above equation with i
Formally, the statement that " value decreases over time " is given by defining the linear differential operator as:
Formally, it is a norm defined on the space of bounded linear operators between two given normed vector spaces.
Formally, the problem can be stated as follows: given a desired property, expressed as a temporal logic formula p, and a structure M with initial state s, decide if.
Formally, the Secretary-General is given the same rank as a High Commissioner or ambassador.
Formally, given such that, the corresponding characteristic number is:
Formally, given two categories C and D, an equivalence of categories consists of a functor F: C → D, a functor G: D → C, and two natural isomorphisms ε: FG → I < sub > D </ sub > and η: I < sub > C </ sub >→ GF.
Formally, given a vector field v, a vector potential is a vector field A such that
Formally, an absolute coequalizer of a pair in a category C is a coequalizer as defined above but with the added property that given any functor F ( Q ) together with F ( q ) is the coequalizer of F ( f ) and F ( g ) in the category D. Split coequalizers are examples of absolute coequalizers.
Formally, given complex-valued functions f and g of a natural number variable n, one writes
Formally, a deterministic algorithm computes a mathematical function ; a function has a unique value for any given input, and the algorithm is a process that produces this particular value as output.
Formally, given two partially ordered sets ( S, ≤) and ( T, ≤), a function f: S → T is an order-embedding if f is both order-preserving and order-reflecting, i. e. for all x and y in S, one has
Formally, given a finite set X, a collection C of subsets of X, all of size n, has Property B if we can partition X into two disjoint subsets Y and Z such that every set in C meets both Y and Z.
Formally, given a G-bundle B and a map H → G ( which need not be an inclusion ),
Formally, given a graph G, a vertex labeling is a function mapping vertices of G to a set of labels.
Formally, if and only if, for any given, there exists an such that
Formally, given two mappings
Formally this mission was declared to be only in pursuit of the Russian vessels and ammunition taken to Anzali by the White Russian counter-revolutionary General Denikin, who had been given asylum by British forces in Anzali.
Formally, a married or widowed woman can be called by the given name of her husband ( Madame ( given name of husband ) family name or Madame veuve ( given name of husband ) family name ); this is now slightly out of fashion.

Formally and partially
Formally, a partially ordered set ( P, ≤) is bounded complete if the following holds for any subset S of P:
Formally, a non-empty partially ordered set ( D, ≤) is called a Scott domain if the following hold:
Formally, P ( with <) will be a ( strict ) partially ordered set, or poset.
Formally, let P be a poset ( partially ordered set ), and let F be a filter on P ; that is, F is a subset of P such that:

Formally and ordered
Formally, this is captured by the Duality Principle for ordered sets:
Formally, a multigraph G is an ordered pair G :=( V, E ) with

Formally and set
Formally, a binary operation on a set S is called associative if it satisfies the associative law:
Formally, the set of all context-free languages is identical to the set of languages accepted by pushdown automata ( PDA ).
Formally speaking, a collation method typically defines a total order on a set of possible identifiers, called sort keys, which consequently produces a total preorder on the set of items of information ( items with the same identifier are not placed in any defined order ).
Formally, one has an implication, not an equivalence, so the solution set may get larger.
Formally, a set S is called finite if there exists a bijection
Formally, if M is a set, the identity function f on M is defined to be that function with domain and codomain M which satisfies
Formally, according to the Constitution, citizens of Turkmenistan have the right to set up political parties and other public associations, acting within the framework of the Constitution and laws, and public associations and groups of citizens have the right to nominate their candidates in accordance with the election law.
Formally, the weighted mean of a non-empty set of data
Formally, the convex hull may be defined as the intersection of all convex sets containing X or as the set of all convex combinations of points in X.
Formally, Gaussian integers are the set
Formally, the discrete cosine transform is a linear, invertible function ( where denotes the set of real numbers ), or equivalently an invertible N × N square matrix.
Formally, a function ƒ is real analytic on an open set D in the real line if for any x < sub > 0 </ sub > in D one can write
Formally, start with a set Ω and consider the sigma algebra Σ on Ω consisting of all subsets of Ω.
Formally, the movement is a rondo that acts as the theme for a set of eight variations, capped off by a dramatic coda.
Formally, the discrete sine transform is a linear, invertible function F: R < sup > N </ sup > < tt >-></ tt > R < sup > N </ sup > ( where R denotes the set of real numbers ), or equivalently an N × N square matrix.
Formally, starting with a linearly independent set of vectors
Formally, the discrete Hartley transform is a linear, invertible function H: R < sup > n </ sup > < tt >-></ tt > R < sup > n </ sup > ( where R denotes the set of real numbers ).
Formally, a constraint satisfaction problem is defined as a triple, where is a set of variables, is a domain of values, and is a set of constraints.

0.161 seconds.