|
O-minimal Structure
In mathematical logic, and more specifically in model theory, an infinite structure (''M'',<,...) which is totally ordered by < is called an o-minimal structure if and only if every definable subset ''X'' ⊂ ''M'' (with parameters taken from ''M'') is a finite union of intervals and points. O-minimality can be regarded as a weak form of quantifier elimination. A structure ''M'' is o-minimal if and only if every formula with one free variable and parameters in ''M'' is equivalent to a quantifier-free formula involving only the ordering, also with parameters in ''M''. This ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Logic
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and analysis. In the early 20th century it was shaped by David Hilbert's program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in proving consistency. Work in set theory sho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exponential Function
The exponential function is a mathematical function denoted by f(x)=\exp(x) or e^x (where the argument is written as an exponent). Unless otherwise specified, the term generally refers to the positive-valued function of a real variable, although it can be extended to the complex numbers or generalized to other mathematical objects like matrices or Lie algebras. The exponential function originated from the notion of exponentiation (repeated multiplication), but modern definitions (there are several equivalent characterizations) allow it to be rigorously extended to all real arguments, including irrational numbers. Its ubiquitous occurrence in pure and applied mathematics led mathematician Walter Rudin to opine that the exponential function is "the most important function in mathematics". The exponential function satisfies the exponentiation identity e^ = e^x e^y \text x,y\in\mathbb, which, along with the definition e = \exp(1), shows that e^n=\underbrace_ for positi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
C-minimal Theory
In model theory, a branch of mathematical logic, a C-minimal theory is a theory that is "minimal" with respect to a ternary relation ''C'' with certain properties. Algebraically closed fields with a (Krull) valuation are perhaps the most important example. This notion was defined in analogy to the o-minimal theories, which are "minimal" (in the same sense) with respect to a linear order. Definition A ''C''-relation is a ternary relation ''C''(''x'';''y,z'') that satisfies the following axioms. # \forall xyz\, C(x;y,z)\rightarrow C(x;z,y) # \forall xyz\, C(x;y,z)\rightarrow\neg C(y;x,z) # \forall xyzw\, C(x;y,z)\rightarrow (C(w;y,z)\vee C(x;w,z)) # \forall xy\, x\neq y \rightarrow \exists z\neq y\, C(x;y,z) A C-minimal structure is a structure ''M'', in a signature containing the symbol ''C'', such that ''C'' satisfies the above axioms and every set of elements of ''M'' that is definable with parameters in ''M'' is a Boolean combination of instances of ''C'', i.e. of formu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weakly O-minimal Structure
In model theory, a weakly o-minimal structure is a model-theoretic structure whose definable sets in the domain are just finite unions of convex sets. Definition A linearly ordered structure, ''M'', with language ''L'' including an ordering relation <, is called weakly o-minimal if every parametrically definable subset of ''M'' is a finite union of convex (definable) subsets. A is weakly o-minimal if all its models are weakly o-minimal. Note that, in contrast to , it is possible for a theory to have models that are weakly o-minimal and to have other models that are not weakly o-minimal. Difference from o-minimality In an o-minimal structure the definable sets in |
Strongly Minimal Theory
In model theory—a branch of mathematical logic—a minimal structure is an infinite one-sorted structure such that every subset of its domain that is definable with parameters is either finite or cofinite. A strongly minimal theory is a complete theory all models of which are minimal. A strongly minimal structure is a structure whose theory is strongly minimal. Thus a structure is minimal only if the parametrically definable subsets of its domain cannot be avoided, because they are already parametrically definable in the pure language of equality. Strong minimality was one of the early notions in the new field of classification theory and stability theory that was opened up by Morley's theorem on totally categorical structures. The nontrivial standard examples of strongly minimal theories are the one-sorted theories of infinite-dimensional vector spaces, and the theories ACF''p'' of algebraically closed fields of characteristic ''p''. As the example ACF''p'' sho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Algebraic Geometry
In mathematics, real algebraic geometry is the sub-branch of algebraic geometry studying real algebraic sets, i.e. real-number solutions to algebraic equations with real-number coefficients, and mappings between them (in particular real polynomial mappings). Semialgebraic geometry is the study of semialgebraic sets, i.e. real-number solutions to algebraic inequalities with-real number coefficients, and mappings between them. The most natural mappings between semialgebraic sets are semialgebraic mappings, i.e., mappings whose graphs are semialgebraic sets. Terminology Nowadays the words 'semialgebraic geometry' and 'real algebraic geometry' are used as synonyms, because real algebraic sets cannot be studied seriously without the use of semialgebraic sets. For example, a projection of a real algebraic set along a coordinate axis need not be a real algebraic set, but it is always a semialgebraic set: this is the Tarski–Seidenberg theorem. Related fields are o-minimal theory and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semialgebraic Set
In mathematics, a semialgebraic set is a subset ''S'' of ''Rn'' for some real closed field ''R'' (for example ''R'' could be the field of real numbers) defined by a finite sequence of polynomial equations (of the form P(x_1,...,x_n) = 0) and inequalities (of the form Q(x_1,...,x_n) > 0), or any finite union of such sets. A semialgebraic function is a function with a semialgebraic graph. Such sets and functions are mainly studied in real algebraic geometry which is the appropriate framework for algebraic geometry over the real numbers. Properties Similarly to algebraic subvarieties, finite unions and intersections of semialgebraic sets are still semialgebraic sets. Furthermore, unlike subvarieties, the complement of a semialgebraic set is again semialgebraic. Finally, and most importantly, the Tarski–Seidenberg theorem says that they are also closed under the projection operation: in other words a semialgebraic set projected onto a linear subspace yields another such (as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Łojasiewicz Inequality
In real algebraic geometry, the Łojasiewicz inequality, named after Stanisław Łojasiewicz, gives an upper bound for the distance of a point to the nearest zero of a given real analytic function. Specifically, let ƒ : ''U'' → R be a real analytic function on an open set ''U'' in R''n'', and let ''Z'' be the zero locus of ƒ. Assume that ''Z'' is not empty. Then for any compact set ''K'' in ''U'', there exist positive constants α and ''C'' such that, for all ''x'' in ''K'' :\operatorname(x,Z)^\alpha \le C, f(x), . Here α can be large. The following form of this inequality is often seen in more analytic contexts: with the same assumptions on ƒ, for every ''p'' ∈ ''U'' there is a possibly smaller open neighborhood ''W'' of ''p'' and constants θ ∈ (0,1) and ''c'' > 0 such that :, f(x)-f(p), ^\theta\le c, \nabla f(x), . A special case of the Łojasiewicz inequality, due to , is commonly used to prove linear conv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stratification (mathematics)
Stratification has several usages in mathematics. In mathematical logic In mathematical logic, stratification is any consistent assignment of numbers to predicate symbols guaranteeing that a unique formal interpretation of a logical theory exists. Specifically, we say that a set of clauses of the form Q_1 \wedge \dots \wedge Q_n \wedge \neg Q_ \wedge \dots \wedge \neg Q_ \rightarrow P is stratified if and only if there is a stratification assignment S that fulfills the following conditions: # If a predicate P is positively derived from a predicate Q (i.e., P is the head of a rule, and Q occurs positively in the body of the same rule), then the stratification number of P must be greater than or equal to the stratification number of Q, in short S(P) \geq S(Q). # If a predicate P is derived from a negated predicate Q (i.e., P is the head of a rule, and Q occurs negatively in the body of the same rule), then the stratification number of P must be greater than the stratification number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jean-Louis Verdier
Jean-Louis Verdier (; 2 February 1935 – 25 August 1989) was a French mathematician who worked, under the guidance of his doctoral advisor Alexander Grothendieck, on derived categories and Verdier duality. He was a close collaborator of Grothendieck, notably contributing to SGA 4 his theory of hypercovers and anticipating the later development of étale homotopy by Michael Artin and Barry Mazur, following a suggestion he attributed to Pierre Cartier. Saul Lubkin's related theory of rigid hypercovers was later taken up by Eric Friedlander in his definition of the étale topological type. Verdier was a student at the elite École Normale Supérieure in Paris, and later became director of studies there, as well as a Professor at the University of Paris VII. For many years he directed a joint seminar at the École Normale Supérieure with Adrien Douady. Verdier was a member of Bourbaki. In 1984 he was the president of the Société Mathématique de France. In 1976 Verd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hassler Whitney
Hassler Whitney (March 23, 1907 – May 10, 1989) was an American mathematician. He was one of the founders of singularity theory, and did foundational work in manifolds, embeddings, immersions, characteristic classes, and geometric integration theory. Biography Life Hassler Whitney was born on March 23, 1907, in New York City, where his father Edward Baldwin Whitney was the First District New York Supreme Court judge. His mother, A. Josepha Newcomb Whitney, was an artist and active in politics. He was the paternal nephew of Connecticut Governor and Chief Justice Simeon Eben Baldwin, his paternal grandfather was William Dwight Whitney, professor of Ancient Languages at Yale University, linguist and Sanskrit scholar. Whitney was the great-grandson of Connecticut Governor and US Senator Roger Sherman Baldwin, and the great-great-grandson of American founding father Roger Sherman. His maternal grandparents were astronomer and mathematician Simon Newcomb (1835-1909), a Steeves ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Algebraic Geometry
In mathematics, real algebraic geometry is the sub-branch of algebraic geometry studying real algebraic sets, i.e. real-number solutions to algebraic equations with real-number coefficients, and mappings between them (in particular real polynomial mappings). Semialgebraic geometry is the study of semialgebraic sets, i.e. real-number solutions to algebraic inequalities with-real number coefficients, and mappings between them. The most natural mappings between semialgebraic sets are semialgebraic mappings, i.e., mappings whose graphs are semialgebraic sets. Terminology Nowadays the words 'semialgebraic geometry' and 'real algebraic geometry' are used as synonyms, because real algebraic sets cannot be studied seriously without the use of semialgebraic sets. For example, a projection of a real algebraic set along a coordinate axis need not be a real algebraic set, but it is always a semialgebraic set: this is the Tarski–Seidenberg theorem. Related fields are o-minimal theory and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
