「If...」の共起表現一覧(2語右が「only」)
該当件数 : 134件
| if and only if , and | |
| That is, | if and only if |
| a | if and only if b |
| If they only knew." | |
| Another is "a | if and only if b". |
| A topological space is first countable | if and only if . |
| are collinear | if and only if the determinant |
| Equality occurs | if and only if the triangle is equilateral. |
| {Iα, Iβ} ∈ E | if and only if Iα ∩ Iβ ≠ ∅. |
| x ≤ cl(y) | if and only if cl(x) ≤ cl(y) |
| rojection operator k is called a kernel operator | if and only if k ≤ idA. |
| Thus a pronic number is squarefree | if and only if n and n + 1 are. |
| So we have a ≤ b | if and only if -a+b ∈ G+. |
| This inequality is an equality | if and only if X and Y are statistically independen |
| A hypergraph is a hypertree | if and only if its dual hypergraph is conformal and |
| The Cheeger constant is strictly positive | if and only if G is a connected graph. |
| x ≤ y | if and only if y is contained in all open sets that |
| with equality | if and only if all the numbers ai are equal. |
| Thus, it is ineffable | if and only if it is 2-ineffable. |
| with equality | if and only if the two triangles are similar. |
| is planar (can be drawn with no crossings) | if and only if n ≤ 3. |
| A polyabolo has order 1 | if and only if it is itself a rectangle. |
| Then S is called a singleton | if and only if, for all x ∈ X, |
| In topology, a space is a T1 space | if and only if every singleton is closed. |
| Two filter bases are equivalent | if and only if the filters they generate are equal. |
| A graph is triangle-free | if and only if it is locally independent. |
| a < b | if and only if f(a) < f(b) |
| Chords are equidistant from the center | if and only if their lengths are equal. |
| A connected graph G is planar | if and only if it has an algebraic dual. |
| If and only if they were enrolled, it was compulsor | |
| A subset I of a lattice (P,≤) is a prime ideal, | if and only if |
| A bipartite double cover is connected | if and only if G is connected and non-bipartite. |
| Such a formula is indeed satisfiable | if and only if at least one of its terms is satisfi |
| They will not stay healthy | if fed only on lettuce. |
| For example, from the statements " | if I'm breathing, then I'm alive" and "if I'm alive |
| A planar graph is outerplanar | if and only if its weak dual is a forest, and a pla |
| Why are they pentads | if there's only three of them? |
| G1 and G2 are isomorphic | if and only if there exists a permutation matrix P |
| signed complete graphs yield the same two-graph | if and only if they are equivalent under switching. |
| This strengthened conjecture would be true | if and only if both Guy's conjecture and the Albert |
| A poset D is a dcpo | if and only if each chain in D has a supremum. |
| tract rewriting a reduction is called convergent | if and only if it is both confluent and terminating |
| ally compact Hausdorff space is zero-dimensional | if and only if it is totally disconnected. |
| An outcome is in equilibrium | if and only if it is the product of mutually utilit |
| cpo with the Scott topology is a Hausdorff space | if and only if the order is trivial. |
| Likewise, a cardinal is strongly unfoldable | if and only if it is strongly λ-unfoldable for all |
| A cardinal is unfoldable | if and only if it is an λ-unfoldable for all ordina |
| One can prove that P is a normal polytope | if and only if this monoid is normal. |
| The book thickness of a graph is at most 1 | if and only if it is outerplanar. |
| A linear ordering is an Aronszajn line | if and only if it is the lexicographical ordering o |
| axiomatisation of deontic logic implies that !x | if and only if x is true, OR !x is unsatisfiable. |
| A minimum path cover consists of one path | if and only if there is a Hamiltonian path in G. |
| there is a morphism between any two objects | if and only if there is a (directed) path between t |
| Moreover, equality holds | if and only if X and Y are multivariate normal rand |
| In this sense, a relation is asymmetric | if and only if it is both antisymmetric and irrefle |
| κ is almost n-huge | if and only if there is j : V → M with critical poi |
| Connecting two vertices, u, v | if and only if the distance between them is at most |
| with equality | if and only if (M, g) is isometric to the m-sphere |
| A directed graph is a pseudoforest | if and only if every vertex has outdegree at most 1 |
| two lines form a right angle | if and only if the dot product of their directional |
| A partially ordered set is series-parallel | if and only if it does not have four elements formi |
| An ordered ring R has no zero divisors | if and only if the positive ring elements are close |
| singular (meaning that it has an inverse matrix) | if and only if the identity matrix can be obtained |
| heorem, is that a four-connected graph is planar | if and only if it has no K5 minor. |
| lection group comes from a real reflection group | if and only if it has an invariant of degree 2. |
| l its touch-screen voting machines to the county | if, and only if, the county removed Supervisor Sanc |
| are forbidden minors for F: a graph belongs to F | if and only if it does not contain as a minor any g |
| t theory, a set is called hereditarily countable | if and only if it is a countable set of hereditaril |
| A set is hereditarily countable | if and only if it is countable, and every element o |
| speaking, a positive number m is a perfect cube | if and only if one can arrange m solid unit cubes i |
| This means that a graph is a forest | if and only if none of its minors is the loop (or, |
| A cardinal is weakly compact | if and only if it is κ-compact; this was the origin |
| paper, Rosa proved that the cycle Cn is graceful | if and only if n ≡ 0 (mod 4) or n ≡ 3 (mod 4). |
| For an ellipse, two diameters are conjugate | if and only if the tangent line to the ellipse at t |
| So this Welch bound is met with equality | if and only if the set of vectors {xi} is an equian |
| {1, 2, 3, ...}, with the order defined by a < b | if and only if a divides b and a ≠ b. |
| Equivalently, κ is a measurable cardinal | if and only if it is an uncountable cardinal with a |
| alent (with respect to the equivalence relation) | if and only if they are elements of the same cell. |
| iscernibles states that two things are identical | if and only if they share the same and only the sam |
| or function or constant) is implicitly definable | if and only if it is explicitly definable. |
| In ZF, a set is infinite | if and only if the powerset of its powerset is a De |
| at a finitely presented group is word-hyperbolic | if and only if it satisfies a linear isoperimetric |
| That is the case | if and only if C is pointed and its spherical secti |
| A subset I of a lattice (P, ≤) is a Frink ideal | if and only if it is a lower set that is closed und |
| proximal or δ-neighborhood of A, written A « B, | if and only if A δ X−B is false. |
| A regular language is star-free | if and only if it is accepted by an automaton with |
| states that a topological space X is metrizable | if and only if it is regular and T0 and has a σ-dis |
| a finite set J ⊆ I belongs to N | if and only if the intersection of the Ui whose sub |
| gth language L, an ω-word w is in the limit of L | if and only if Pref(w) ∩ L is an infinite set. |
| Thus, a graph is a pseudoforest | if and only if it does not have the butterfly or th |
| tween partially ordered sets is Scott-continuous | if and only if it is continuous with respect to the |
| ned in terms of a logical disjunction: x ∈ A ∪ B | if and only if (x ∈ A) ∨ (x ∈ B). |
| do is to prime the Turing machine to signal to p | if and only if the Turing machine halts. |
| that a cellular automaton has a Garden of Eden, | if and only if it has twins. |
| For S is a pure state | if and only if its diagonal form has exactly one no |
| r of some (d −1 )-dimensional simplicial complex | if and only if |
| number of voters meets conditions 1, 2, 3, and 4 | if and only if it is the simple majority method. |
| e contrapositive: G has a matching larger than M | if and only if G has an augmenting path. |
| A graph is a line graph | if and only if it does not contain one of these nin |
| the bipartite case, a quantum state is separable | if and only if it lies in the image of the Segre em |
| eserves validity: the resulting formula is valid | if and only if the original one is. |
| It can be shown that a state i is recurrent | if and only if the expected number of visits to thi |
| that the inequality fails for all larger numbers | if and only if the Riemann hypothesis is true. |
| ts the edges and vertices of a convex polyhedron | if and only if it is polyhedral. |
| And, a planar graph is bipartite | if and only if, in a planar embedding of the graph, |
| A regular graph is a Ramanujan graph | if and only if its Ihara zeta function satisfies an |
| κ is super n-huge | if and only if for every ordinal γ there is j : V → |
| κ is super almost n-huge | if and only if for every ordinal γ there is j : V → |
| A graph is bipartite | if and only if it is 2-colorable, (i.e. its chromat |
| A poset is a bounded lattice | if and only if every finite set of elements (includ |
| and equality is achieved | if and only if the vectors are orthogonal or at lea |
| e closure indicates path connection in R: x R+ y | if and only if there is an R-path from x to y. |
| isation of limit points: x is a limit point of S | if and only if it is in the closure of S \\ {x}. |
| A non-zero vector y is in C * | if and only if − y is the normal of a hyperplane th |
| o the classical result that a cardinal is Woodin | if and only if for every set S, the set |
| undirected, connected graph has an Eulerian path | if and only if it has either 0 or 2 vertices of odd |
| showed that a connected graph is a partial cube | if and only if it is bipartite and the relation Θ i |
| ver Keisler (1965) proved that a formula is Horn | if and only if it is preserved under nonempty reduc |
| A quasiordering is a wqo | if and only if the corresponding partial order (obt |
| if ashes only will be left, and want Chaos and temp | |
| Yep, | if I'd only find the time.... Qwrk (talk) 14:59, 19 |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
