One often has the choice of specifying a set intensionally or extensionally.

Class may be defined either extensionally or intensionally.

Even though there is a sense in which we see merely extensionally, therefore, seeing is substantially intentional.

For instance, the set of the first thousand positive integers may be specified extensionally as:

In extensionally deforming regimes, the veins occur roughly normal to the axis of extension.

These functions are extensionally equal; given the same input, both functions always produce the same value.

There are one-point bases from which every combinator can be composed extensionally equal to any lambda term.

The simplest way to describe a set is to list its elements between curly braces (known as defining a set extensionally).

The set is defined extensionally using power domain semantics rather than intensionally using causal axioms.

Intensional sentences are extensionally opaque.

Similarly, in natural language there are many predicates (relations) that are intensionally different but are extensionally identical.

Operational rules are those rules which are defined "extensionally", or as a list of tuples for which a predicate is true.

A great many art theorists today consider aesthetic definitions of art to be extensionally inadequate, primarily because of artworks in the style of Duchamp.

Then, the two argument predicates "has one person named", "is the oldest person in" are intensionally distinct, but extensionally equal for "Joe" in that "town" now.

Contemporary cognitive scientists use a wide notion of analogy, extensionally close to that of Plato and Aristotle, but framed by Gentner's (1983) structure mapping theory.

Extensionally faulted volcanic rocks, ranging in age from about 13.3 million years to about 7.6 million years, overlie the region's Paleozoic sedimentary rocks.

(E x) is the function which takes an argument, x, and applies the function E to it; this is extensionally equal to the function E itself.

In the philosophy of language and modal logic, a non-rigid designator (or flaccid designator) is a term that does not extensionally refer to the same object in all possible worlds.

An algorithm, called ', has been proposed to enforce a weak version of the property Generalized Arc Consistency (GAC) on soft constraints defined extensionally by listing tuples and their costs.

It is perhaps astonishing that S and K can be composed to produce combinators that are extensionally equal to any lambda term, and therefore, by Church's thesis, to any computable function whatsoever.

Gödel 1944:126 describes it this way: "This change is connected with the new axiom that functions can occur in propositions only "through their values", i.e., extensionally . . . [this is] quite unobjectionable even from the constructive standpoint . . . provided that quantifiers are always restricted to definite orders".