Proof theoryProof theory is a major branch of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of a given logical system. Consequently, proof theory is syntactic in nature, in contrast to model theory, which is semantic in nature.
Singular point of an algebraic varietyIn the mathematical field of algebraic geometry, a singular point of an algebraic variety V is a point P that is 'special' (so, singular), in the geometric sense that at this point the tangent space at the variety may not be regularly defined. In case of varieties defined over the reals, this notion generalizes the notion of local non-flatness. A point of an algebraic variety which is not singular is said to be regular. An algebraic variety which has no singular point is said to be non-singular or smooth.
Singularity theoryIn mathematics, singularity theory studies spaces that are almost manifolds, but not quite. A string can serve as an example of a one-dimensional manifold, if one neglects its thickness. A singularity can be made by balling it up, dropping it on the floor, and flattening it. In some places the flat string will cross itself in an approximate "X" shape. The points on the floor where it does this are one kind of singularity, the double point: one bit of the floor corresponds to more than one bit of string.
Regular 4-polytopeIn mathematics, a regular 4-polytope is a regular four-dimensional polytope. They are the four-dimensional analogues of the regular polyhedra in three dimensions and the regular polygons in two dimensions. There are six convex and ten star regular 4-polytopes, giving a total of sixteen. The convex regular 4-polytopes were first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. He discovered that there are precisely six such figures.
Reductio ad absurdumIn logic, reductio ad absurdum (Latin for "reduction to absurdity"), also known as argumentum ad absurdum (Latin for "argument to absurdity") or apagogical arguments, is the form of argument that attempts to establish a claim by showing that the opposite scenario would lead to absurdity or contradiction. This argument form traces back to Ancient Greek philosophy and has been used throughout history in both formal mathematical and philosophical reasoning, as well as in debate. The equivalent formal rule is known as negation introduction.
Regular languageIn theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to many modern regular expression engines, which are augmented with features that allow the recognition of non-regular languages). Alternatively, a regular language can be defined as a language recognized by a finite automaton.
Logarithmic scaleA logarithmic scale (or log scale) is a way of displaying numerical data over a very wide range of values in a compact way. As opposed to a linear number line in which every unit of distance corresponds to adding by the same amount, on a logarithmic scale, every unit of length corresponds to multiplying the previous value by the same amount. Hence, such a scale is nonlinear: the numbers 1, 2, 3, 4, 5, and so on, are not equally spaced. Rather, the numbers 10, 100, 1000, 10000, and 100000 would be equally spaced.
Enneper surfaceIn differential geometry and algebraic geometry, the Enneper surface is a self-intersecting surface that can be described parametrically by: It was introduced by Alfred Enneper in 1864 in connection with minimal surface theory. The Weierstrass–Enneper parameterization is very simple, , and the real parametric form can easily be calculated from it. The surface is conjugate to itself.
Schwarz minimal surfaceIn differential geometry, the Schwarz minimal surfaces are periodic minimal surfaces originally described by Hermann Schwarz. In the 1880s Schwarz and his student E. R. Neovius described periodic minimal surfaces. They were later named by Alan Schoen in his seminal report that described the gyroid and other triply periodic minimal surfaces. The surfaces were generated using symmetry arguments: given a solution to Plateau's problem for a polygon, reflections of the surface across the boundary lines also produce valid minimal surfaces that can be continuously joined to the original solution.
Induction of regular languagesIn computational learning theory, induction of regular languages refers to the task of learning a formal description (e.g. grammar) of a regular language from a given set of example strings. Although E. Mark Gold has shown that not every regular language can be learned this way (see language identification in the limit), approaches have been investigated for a variety of subclasses. They are sketched in this article. For learning of more general grammars, see Grammar induction.
