Find link

language:

Find link is a tool written by Edward Betts.

searching for Binary relation 93 found (409 total)

Intransitive game (169 words) [view diff] exact match in snippet view article find links to article

If strategy A beats strategy B, B beats C, and C beats A, then the binary relation "to beat" is intransitive, since transitivity would require that A

Partial equivalence relation (1,164 words) [view diff] exact match in snippet view article find links to article

literature also called restricted equivalence relation) is a homogeneous binary relation that is symmetric and transitive. If the relation is also reflexive

List of first-order theories (5,269 words) [view diff] exact match in snippet view article find links to article

theory in some language, we define a new theory 2T by adding a new binary relation to the language, and adding axioms stating that it is an equivalence

Non-logical symbol (783 words) [view diff] exact match in snippet view article find links to article

consist of a binary function symbol +, a constant symbol 0, and a binary relation symbol <. Structures over a signature, also known as models, provide

Axiom of dependent choice (950 words) [view diff] exact match in snippet view article find links to article

{\displaystyle (\,\Longleftarrow \,)} Let R {\displaystyle R} be an entire binary relation on X {\displaystyle X} . The strategy is to define a tree T {\displaystyle

Residuated Boolean algebra (1,155 words) [view diff] exact match in snippet view article find links to article

relation algebras as a finitely axiomatized generalization of the binary relation example, but there exist interesting examples of residuated Boolean

Critical pair (order theory) (235 words) [view diff] exact match in snippet view article

in S, if y < z then x < z. If (x, y) is a critical pair, then the binary relation obtained from P by adding the single relationship x ≤ y is also a partial

Berkeley cardinal (271 words) [view diff] exact match in snippet view article find links to article

choice. A weakening of being a Berkeley cardinal is that for every binary relation R on Vκ, there is a nontrivial elementary embedding of (Vκ, R) into

Structure (mathematical logic) (5,097 words) [view diff] exact match in snippet view article

_{f}} -structure. A signature for ordered fields needs an additional binary relation such as < {\displaystyle \,<\,} or ≤ , {\displaystyle \,\leq ,\,} and

Π-calculus (4,856 words) [view diff] exact match in snippet view article find links to article

Milner, Parrow and Walker in their original paper on the π-calculus. A binary relation R {\displaystyle R} over processes is an early bisimulation if for

Trakhtenbrot's theorem (1,929 words) [view diff] exact match in snippet view article find links to article

Th. 7.2.1 in ) Let σ be a relational vocabulary with at least one binary relation symbol. The set of σ-sentences valid in all finite structures is not

Stochastic transitivity (1,839 words) [view diff] exact match in snippet view article find links to article

where transitivity is expected, however, empirical observations of the binary relation is probabilistic. For example, players' skills in a sport might be

Double turnstile (460 words) [view diff] exact match in snippet view article find links to article

syntactic consequence (in contrast to semantic). The double turnstile is a binary relation. It has several different meanings in different contexts: To show semantic

Truth value (863 words) [view diff] exact match in snippet view article find links to article

the form of truth tables. Logical biconditional becomes the equality binary relation, and negation becomes a bijection which permutes true and false. Conjunction

Interpretation (logic) (4,478 words) [view diff] exact match in snippet view article

constant symbols 0 and 1, two binary function symbols + and ·, and no binary relation symbols. (Here the equality relation is taken as a logical constant

Schröder–Bernstein property (1,039 words) [view diff] exact match in snippet view article find links to article

binary relation "be a part of", A binary relation "be similar to" (similarity). Instead of the relation "be a part of" one may use a binary relation "be

Subobject (907 words) [view diff] exact match in snippet view article find links to article

:S\to T} such that u = v ∘ ϕ {\displaystyle u=v\circ \phi } . The binary relation ≡ {\displaystyle \equiv } defined by u ≡ v ⟺ u ≤ v and v ≤ u {\displaystyle

Monadic predicate calculus (698 words) [view diff] exact match in snippet view article find links to article

is logically valid (true for all nonempty domains). Adding a single binary relation symbol to monadic logic, however, results in an undecidable logic.

Elementary function arithmetic (875 words) [view diff] exact match in snippet view article find links to article

{\textrm {exp}}(x,y)} usually written as x y {\displaystyle x^{y}} , a binary relation symbol < {\displaystyle <} (This is not really necessary as it can

Identity (philosophy) (1,143 words) [view diff] exact match in snippet view article

relation between objects, and Kai Wehmeier has argued that appealing to a binary relation that every object bears to itself, and to no others, is both logically

Order (mathematics) (499 words) [view diff] exact match in snippet view article

Order in mathematics may refer to: Total order and partial order, a binary relation generalizing the usual ordering of numbers and of words in a dictionary

Leibniz operator (1,167 words) [view diff] exact match in snippet view article find links to article

{\displaystyle {\mathcal {S}}} , if ≡ T {\displaystyle \equiv _{T}} denotes the binary relation on the set of formulas of S {\displaystyle {\mathcal {S}}} , defined

Elementary equivalence (956 words) [view diff] exact match in snippet view article find links to article

elementarily equivalent. For example, consider the language with one binary relation symbol '<'. The model R of real numbers with its usual order and the

Modal logic (8,650 words) [view diff] exact match in snippet view article find links to article

{\displaystyle W} is a set of possible worlds R {\displaystyle R} is a binary relation on W {\displaystyle W} V {\displaystyle V} is a valuation function

Reification (computer science) (2,270 words) [view diff] exact match in snippet view article

Framework (RDF) and Web Ontology Language (OWL), a statement is a binary relation. It is used to link two individuals or an individual and a value. Applications

Herbrand structure (775 words) [view diff] exact match in snippet view article find links to article

whose argument terms are elements of the Herbrand universe. For a binary relation symbol R {\displaystyle R} , we get with the terms from above: B H

Equivalent definitions of mathematical structures (3,272 words) [view diff] exact match in snippet view article find links to article

another signature (+, ·, ≤) consisting of two binary functions and one binary relation. The notion of isomorphism does not apply to structures of different

Postcolonialism (10,862 words) [view diff] exact match in snippet view article find links to article

is that the cultural representations generated with the us-and-them binary relation are social constructs, which are mutually constitutive and cannot exist

Extension by definition (1,504 words) [view diff] exact match in snippet view article find links to article

everyday mathematics, however, many other symbols are used such as the binary relation symbol ⊆ {\displaystyle \subseteq } , the constant ∅ {\displaystyle

Other (philosophy) (5,561 words) [view diff] exact match in snippet view article

and fashion, which conflated different cultures and peoples into the binary relation of the Orient and the Occident. Orientalism created the artificial

Subsequence (829 words) [view diff] exact match in snippet view article find links to article

Mathematical binary relation

Minimum relevant variables in linear system (1,053 words) [view diff] exact match in snippet view article find links to article

and even hard to approximate. A Min-RVLS problem is defined by: A binary relation R, which is one of {=, ≥, >, ≠}; An m-by-n matrix A (where m is the

Flag (geometry) (495 words) [view diff] exact match in snippet view article

triple D = (V, B, I) where V and B are any two disjoint sets and I is a binary relation between V and B, that is, I ⊆ V × B. The elements of V will be called

Type (model theory) (2,253 words) [view diff] exact match in snippet view article

way of producing saturated models. Consider the language L with one binary relation symbol, which we denote as ∈ {\displaystyle \in } . Let M {\displaystyle

Asymptotic analysis (2,803 words) [view diff] exact match in snippet view article find links to article

O notation. Formally, given functions f (x) and g(x), we define a binary relation f ( x ) ∼ g ( x ) ( as x → ∞ ) {\displaystyle f(x)\sim g(x)\quad ({\text{as

Encompassment ordering (277 words) [view diff] exact match in snippet view article find links to article

constant symbols a, b i.e. irreflexive, transitive, and well-founded binary relation R such that sRt implies u[sσ]p R u[tσ]p for all terms s, t, u, each

PPAD (complexity) (1,003 words) [view diff] exact match in snippet view article

guaranteed to be total. The TFNP formal definition is given as follows: A binary relation P(x,y) is in TFNP if and only if there is a deterministic polynomial

Ontology chart (681 words) [view diff] exact match in snippet view article find links to article

transitivity. Ontological dependency is a special poset because it is a binary relation, every thing is ontologically dependent on itself for its existence

Kripke structure (model checking) (700 words) [view diff] exact match in snippet view article

for the states as well (L as defined above.) In this approach, the binary relation obtained by abstracting away the action labels is called a state graph

Formal grammar (3,450 words) [view diff] exact match in snippet view article find links to article

grammar G = ( N , Σ , P , S ) {\displaystyle G=(N,\Sigma ,P,S)} , the binary relation ⇒ G {\displaystyle {\underset {G}{\Rightarrow }}} (pronounced as "G

Viral phenomenon (5,257 words) [view diff] exact match in snippet view article find links to article

reality from fiction or social media Transitive relation – Type of binary relation Tony D. Sampson – British critical theorist (born 1964) (thesis and

Church–Rosser theorem (1,039 words) [view diff] exact match in snippet view article find links to article

method originates from William W. Tait and Per Martin-Löf. Say that a binary relation → {\displaystyle \rightarrow } satisfies the diamond property if: ∀

Archimedean property (2,393 words) [view diff] exact match in snippet view article find links to article

Alternative decimal expansion of 1 Archimedean ordered vector space – A binary relation on a vector space Construction of the real numbers "Math 2050C Lecture"

Heyting arithmetic (6,285 words) [view diff] exact match in snippet view article find links to article

is equivalent to (provably) being inhabited by some least member. A binary relation " < {\displaystyle <} " that validates the strong induction schema

Phonetic Symbol Guide (1,260 words) [view diff] case mismatch in snippet view article find links to article

editions. It might be adequately rendered with U+2AFB ⫻ TRIPLE SOLIDUS BINARY RELATION. This is an allograph of a triple pipe, for which Unicode recommends

O-minimal theory (1,294 words) [view diff] exact match in snippet view article find links to article

language of model theory. Specifically if L is a language including a binary relation <, and (M,<,...) is an L-structure where < is interpreted to satisfy

Cauchy sequence (3,225 words) [view diff] exact match in snippet view article find links to article

of the completion of a metric space, one can furthermore define the binary relation on Cauchy sequences in G {\displaystyle G} that ( x k ) {\displaystyle

Kripke–Platek set theory with urelements (664 words) [view diff] exact match in snippet view article find links to article

sorted first order language L ∗ {\displaystyle L^{*}} with a single binary relation symbol ∈ {\displaystyle \in } . Letters of the sort p , q , r , .

DatalogZ (500 words) [view diff] exact match in snippet view article find links to article

limit-closed. Given a constant w, a binary relation edge that represents the edges of a graph, and a binary relation sp with the last position of sp minimal

Digital library (6,156 words) [view diff] exact match in snippet view article find links to article

objects through the inclusion property between sets, in contrast to the binary relation between nodes exploited by the tree. NESTOR has been used to formally

Cave of La Pasiega (7,336 words) [view diff] exact match in snippet view article find links to article

together with more deer, the other five horses which apparently stand in binary relation to the cattle painted before the bend, which have been mentioned in

Tilde (8,331 words) [view diff] exact match in snippet view article find links to article

tilde \widetilde can be used. The \sim command produce a tilde-like binary relation symbol that is often used in mathematical expressions, and the double-tilde

Linear subspace (4,640 words) [view diff] exact match in snippet view article find links to article

0), (2, 1, 0, 0), and (0, 0, 5, 1). The set-theoretical inclusion binary relation specifies a partial order on the set of all subspaces (of any dimension)

Enriched category (2,027 words) [view diff] exact match in snippet view article find links to article

identity. The hom-objects 2(a, b) then simply deny or affirm a particular binary relation on the given pair of objects (a, b); for the sake of having more familiar

Homomorphism (4,195 words) [view diff] exact match in snippet view article find links to article

each n-ary relation symbol R in L. In the special case with just one binary relation, we obtain the notion of a graph homomorphism. Homomorphisms are also

Ahnentafel (3,849 words) [view diff] exact match in snippet view article find links to article

Demonstration decimal binary relation 1 1 proband 2 10 father 3 11 mother 4 100 paternal grandfather 5 101 paternal grandmother 6 110 maternal grandfather

Abstract cell complex (1,271 words) [view diff] exact match in snippet view article find links to article

is an abstract set, B is an asymmetric, irreflexive and transitive binary relation called the bounding relation among the elements of E and dim is a function

Descriptive complexity theory (2,543 words) [view diff] exact match in snippet view article find links to article

augmented with an operator that computes the transitive closure of a binary relation. The resulting transitive closure logic is known to characterise non-deterministic

Binding (linguistics) (3,824 words) [view diff] exact match in snippet view article

Expression that gives its meaning to a pro-form in grammar C-command – binary relation between nodes in a parse tree, in which a node c-commands its sister

Axiom of regularity (2,938 words) [view diff] exact match in snippet view article find links to article

every element of S has a non-empty intersection with S. We define a binary relation R on S by a R b :⇔ b ∈ S ∩ a {\textstyle aRb:\Leftrightarrow b\in S\cap

Proper name (philosophy) (1,965 words) [view diff] exact match in snippet view article

proper names stand outside of the social construct of language as a binary relation between referent and sign. Rather, he argues the proper name as all

P versus NP problem (7,784 words) [view diff] exact match in snippet view article find links to article

over a finite alphabet, Σ. L ∈ NP if, and only if, there exists a binary relation R ⊂ Σ ∗ × Σ ∗ {\displaystyle R\subset \Sigma ^{*}\times \Sigma ^{*}}

Modal μ-calculus (1,816 words) [view diff] exact match in snippet view article find links to article

states; R {\displaystyle R} maps to each label a {\displaystyle a} a binary relation on S {\displaystyle S} ; V : P → 2 S {\displaystyle V:P\to 2^{S}}

Dehornoy order (1,551 words) [view diff] exact match in snippet view article find links to article

B_{n}^{*+}} is also ω ω n − 2 {\displaystyle \omega ^{\omega ^{n-2}}} . As a binary relation, the Dehornoy order is decidable. The best decision algorithm is based

Boolean algebra (9,572 words) [view diff] exact match in snippet view article find links to article

operation that returns a value in a Boolean algebra, the former is a binary relation which either holds or does not hold. In this sense, entailment is an

Pairing function (2,491 words) [view diff] exact match in snippet view article find links to article

in ZFC. Define on κ × κ {\displaystyle \kappa \times \kappa } the binary relation ( α , β ) ≼ ( γ , δ ) if either { ( α , β ) = ( γ , δ ) , max ( α

Matrix grammar (1,225 words) [view diff] exact match in snippet view article find links to article

the following property. For a matrix grammar G {\displaystyle G} , a binary relation ⇒ G {\displaystyle \Rightarrow _{G}} is defined; also represented as

Cardinality (8,246 words) [view diff] exact match in snippet view article find links to article

result often used for cadinality is that of an equivalence relation. A binary relation is an equvalence relation if it satisfies the three basic properties

Kenneth D. Mackenzie (1,103 words) [view diff] exact match in snippet view article find links to article

of an interaction from xi to xj. The value of rij can range from a binary relation such as a boss-subordinate to how many thousands of board feet of douglas

Paraconsistent logic (6,358 words) [view diff] exact match in snippet view article find links to article

replace the usual functional valuation with a relational one. The binary relation V {\displaystyle V\,} relates a formula to a truth value: V ( A , 1

Plural quantification (2,283 words) [view diff] exact match in snippet view article find links to article

D {\displaystyle D} ). The new component R {\displaystyle R} is a binary relation relating values in the domain to plural variable symbols. Satisfaction

OntoClean (1,824 words) [view diff] exact match in snippet view article find links to article

property of "being a person." In the semantic web, a property is a binary relation. The distinction between property and class is subtle, and probably

Relevance logic (3,947 words) [view diff] exact match in snippet view article find links to article

second way is to keep the semilattice conditions on frames and add a binary relation, J {\displaystyle J} , of disjointness to the frame. For these models

Reduction (computability theory) (1,982 words) [view diff] exact match in snippet view article

proving that many sets are noncomputable. A reducibility relation is a binary relation on sets of natural numbers that is Reflexive: Every set is reducible

Model theory (9,065 words) [view diff] exact match in snippet view article find links to article

is a unary (= 1-ary) function symbol, and < {\displaystyle <} is a binary relation symbol. Then, when these symbols are interpreted to correspond with

Formal concept analysis (5,372 words) [view diff] exact match in snippet view article find links to article

is a set of objects, M is a set of attributes, and I ⊆ G × M is a binary relation called incidence that expresses which objects have which attributes

First-order logic (12,931 words) [view diff] exact match in snippet view article find links to article

one unary function symbol −, one binary function symbol +, and one binary relation symbol ≤. Then: The expressions +(x, y) and +(x, +(y, −(z))) are terms

Graph homomorphism (4,860 words) [view diff] exact match in snippet view article find links to article

of relations on it). Directed graphs are structures with a single binary relation (adjacency) on the domain (the vertex set). Under this view, homomorphisms

Rasdaman (1,870 words) [view diff] exact match in snippet view article find links to article

Anticipating a full integration with SQL, rasdaman collections represent a binary relation with the first attribute being an object identifier and the second

Forcing (mathematics) (9,294 words) [view diff] exact match in snippet view article

is built up like ordinary first-order logic, with membership as the binary relation and all the P {\displaystyle \mathbb {P} } -names as constants. Define

List of algorithms (7,945 words) [view diff] exact match in snippet view article find links to article

Transitive closure problem: find the transitive closure of a given binary relation Traveling salesman problem Christofides algorithm Nearest neighbour

Complexity of constraint satisfaction (4,485 words) [view diff] exact match in snippet view article find links to article

allowing only domains of size 2 and only constraints whose relation is a binary relation. While the second fact implies that the scopes of the constraints are

Net (mathematics) (7,342 words) [view diff] exact match in snippet view article

topological notions and results. Preorder – Reflexive and transitive binary relation Sequential space – Topological space characterized by sequences Ultrafilter

Pocket set theory (1,959 words) [view diff] exact match in snippet view article find links to article

reals. PST uses standard first-order language with identity and the binary relation symbol ∈ {\displaystyle \scriptstyle {\in }} . Ordinary variables are

Logicism (11,833 words) [view diff] exact match in snippet view article find links to article

classes into 'bundles' : These above collections can be put into a "binary relation" (comparing for) similarity by "equinumerosity", symbolized here by

Consideration set (1,912 words) [view diff] exact match in snippet view article find links to article

undominated options according to an asymmetric, incomplete, or cyclic binary relation. Alternatives outside of this shortlist are moved to the inept or inert

Surreal number (11,658 words) [view diff] exact match in snippet view article find links to article

and x(α) = y(α) for all α < dom(x). For surreal numbers define the binary relation < to be lexicographic order (with the convention that "undefined values"

C-command (5,235 words) [view diff] exact match in snippet view article find links to article

that the current alternatives to c-command point to precedence, the binary relation between nodes in a tree structure, to be of great importance. Keek

Epsilon-induction (4,195 words) [view diff] exact match in snippet view article find links to article

induction.) The sets are ∈ {\displaystyle \in } -well-founded. For a binary relation R D {\displaystyle R_{D}} on a set D {\displaystyle D} , well-foundedness

Near sets (9,539 words) [view diff] exact match in snippet view article find links to article

Φ B {\displaystyle A\ {\underline {\delta }}_{\Phi }\ B} ). The binary relation δ Φ {\displaystyle \delta _{\Phi }} is a descriptive EF-proximity,

Glossary of set theory (11,628 words) [view diff] exact match in snippet view article find links to article

limit for comparison. LST The language of set theory (with a single binary relation ∈) m 1. A measure 2. A natural number 𝔪 The smallest cardinal at

Mobile membranes (7,128 words) [view diff] exact match in snippet view article find links to article

\Rightarrow _{amb}^{*}} denotes a reflexive and transitive closure of the binary relation ⇒ a m b {\displaystyle \Rightarrow _{amb}} . A translation from the

Metaphysical grounding (3,746 words) [view diff] exact match in snippet view article find links to article

through the framework of grounding. Grounding is widely treated as a binary relation (or a relation between pluralities and singulars) that satisfies a