Definitions
from Wiktionary, Creative Commons Attribution/ShareAlike License
 n. US spelling of diagonalisation.
from WordNet 3.0 Copyright 2006 by Princeton University. All rights reserved.
 n. changing a square matrix to diagonal form (with all nonzero elements on the principal diagonal)
Etymologies
Sorry, no etymologies found.
Examples

Continuing down the list, this mathematical method called "diagonalization" generates a real number p between zero and one that, by its construction, differs from every real number on the list in at least one decimal place.
Strange but True: Infinity Comes in Different Sizes  Impact Lab

These include: providing preventive and primary care services; developing a health workforce; devising equitable financing arrangements; regulating the private sector; and leveraging vertical programs (such as malaria control) to strengthen, rather than distort, the overall health system ( "diagonalization"

By diagonalization, selfreference or the like we can get a sentence C such that

Just as there can be no set of all sets, there can for diagonalization reasons also not be a proper class of all proper classes.

The problem of identifying the bearer of narrow content is obviously closely related to the problem of what to hold constant when employing the diagonalization strategy.

Unlike the diagonalization strategy, the epistemic strategy does not depend on a prior determination of the broad content of the expression or state.

On the diagonalization strategy, we make use of our preexisting grasp of ordinary content to determine what ordinary content the thought would express if it were located at the center of a particular centered world, and then determine whether that ordinary content is true at that centered world.

GÃ¶del's construction was soon given a general form, as a general diagonalization lemma, which refers to arbitrary definable properties.

It is also important to stress that a few years later (1938) an analog of the diagonalization lemma (the socalled second recursion theorem) was discovered by Kleene and was soon to become a basic tool in the foundations of recursion theory and computability theory.

U onto F and a contradiction could be derived by diagonalization.
Comments
Log in or sign up to get involved in the conversation. It's quick and easy.