injective function
21List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… …
22Finitary relation — This article sets out the set theoretic notion of relation. For a more elementary point of view, see Binary relation. For a combinatorial viewpoint, see Theory of relations. For other uses, see Relation (disambiguation). In set theory and logic,… …
23Bijection — A bijective function, f:X→Y, where set X is {1, 2, 3, 4} and set Y is {A, B, C, D}. For example, f(1) = D. A bijection (or bijective function or one to one correspondence) is a function giving an exact pairing of the elements of two… …
24Cantor–Bernstein–Schroeder theorem — In set theory, the Cantor–Bernstein–Schroeder theorem, named after Georg Cantor, Felix Bernstein, and Ernst Schröder, states that, if there exist injective functions f : A → B and g : B → A between the sets A and B , then there exists a bijective …
25List of types of functions — Functions can be classified according to the properties they have. These properties describe the functions behaviour under certain conditions.Relative to set theoryThese properties concern the domain, the codomain and the range of functions. *… …
26Cardinality — In mathematics, the cardinality of a set is a measure of the number of elements of the set . For example, the set A = {1, 2, 3} contains 3 elements, and therefore A has a cardinality of 3. There are two approaches to cardinality ndash; one which… …
27Monomorphism — This page is about the mathematical term. For other uses, see Monomorphic (disambiguation) or Polymorphism (disambiguation). In the context of abstract algebra or universal algebra, a monomorphism is an injective homomorphism. A monomorphism from …
28Dedekind-infinite set — In mathematics, a set A is Dedekind infinite if some proper subset B of A is equinumerous to A. Explicitly, this means that there is a bijective function from A onto some proper subset B of A. A set is Dedekind finite if it is not Dedekind… …
29Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… …
30Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown …
