Search results
Results from the WOW.Com Content Network
This is a list of mathematical logic topics. For traditional syllogistic logic, see the list of topics in logic . See also the list of computability and complexity topics for more theory of algorithms .
Boolean satisfiability problem; Boolean differential calculus; Indicator function (also called the characteristic function, but that term is used in probability theory for a different concept) Espresso heuristic logic minimizer; Logical matrix; Logical value; Stone duality; Stone space; Topological Boolean algebra
Many mathematics journals ask authors of research papers and expository articles to list subject codes from the Mathematics Subject Classification in their papers. The subject codes so listed are used by the two major reviewing databases, Mathematical Reviews and Zentralblatt MATH .
Hilbert matrix — example of a matrix which is extremely ill-conditioned (and thus difficult to handle) Wilkinson matrix — example of a symmetric tridiagonal matrix with pairs of nearly, but not exactly, equal eigenvalues; Convergent matrix — square matrix whose successive powers approach the zero matrix; Algorithms for matrix multiplication:
A permutation matrix is a (0, 1)-matrix, all of whose columns and rows each have exactly one nonzero element.. A Costas array is a special case of a permutation matrix.; An incidence matrix in combinatorics and finite geometry has ones to indicate incidence between points (or vertices) and lines of a geometry, blocks of a block design, or edges of a graph.
Mathematical logic is the study of formal logic within mathematics. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. Mathematical logic is divided into four parts: Model theory; Proof theory; Recursion theory, also known as computability theory ...
Many, if not most, undecidable problems in mathematics can be posed as word problems: determining when two distinct strings of symbols (encoding some mathematical concept or object) represent the same object or not. For undecidability in axiomatic mathematics, see List of statements undecidable in ZFC.
An "almost" triangular matrix, for example, an upper Hessenberg matrix has zero entries below the first subdiagonal. Hollow matrix: A square matrix whose main diagonal comprises only zero elements. Integer matrix: A matrix whose entries are all integers. Logical matrix: A matrix with all entries either 0 or 1.