Examples of using Partially ordered in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
This lead us to investigate partially ordered sets(posets) that satisfies the ideal extension property,
The idea behind the proof is that the subsets of any set form a Boolean algebra partially ordered by inclusion, and any Boolean algebra is representable as an algebra of sets by Stone's representation theorem.
Game-theoretical semantics has made a resurgence lately mainly due to Jaakko Hintikka for logics of(finite) partially ordered quantification which were originally investigated by Leon Henkin,
is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction.
is to find an increasing subsequence of maximum length of a given finite sequence of elements drawn from a partially ordered set.
An intuitionistic Kripke frame F is a partially ordered set, and a Kripke model M is a Kripke frame with valuation such that{ x∣ M,
The disadvantages are that the semantics is not 2-valued, and that the combinatorics of B are often more complicated than those of the underlying poset P. One interpretation of forcing starts with a countable transitive model M of ZF set theory, a partially ordered set P, and a"generic" subset G of P, and constructs a new model of ZF set theory from these objects.
Furthermore, the Turing degrees are partially ordered so that if the Turing degree of a set"X" is less than the Turing degree of a set"Y" then any(noncomputable)
For a partially ordered set(S,≤) one represents each element of S as a vertex in the plane
on the hasse diagram of the partially ordered sets of faces in a regular polygon containing n edges and the power set of{1,…, n.
This material enters in a partially ordered magnetic state at a temperature t1n~ 1 k,
If the considered partially ordered set(poset) has binary suprema(a.k.a. joins),
let A be a partially ordered set and T a totally ordered subset of A. Then{ S∣ T⊆ S⊆ A and S totally ordered}{\displaystyle\{S\mid T\subseteq S\subseteq A{\mbox{ and S totally ordered}}\}} is partially ordered by set inclusion⊆{\displaystyle\subseteq},
Furthermore, the Turing degrees are partially ordered so that if the Turing degree of a set X is less than the Turing degree of a set Y then any(noncomputable)
imply that containment partially orders the spheres.
Every countable partially ordered set can be embedded in the Turing degrees.
An equivalent form of the principle is that in every partially ordered set there exists a maximal totally ordered subset.
a set is well partially ordered if all its non-empty subsets have a finite number of minimal elements.
vertices have rank 0, edges rank 1, etc. with the partially ordered ranking corresponding to the dimensionality of the geometric elements.
Although casualties were not numerous, the Germanic defeat was sufficiently great to have a deterrent effect on other tribal groups in the area, and to partially restore order.