strongly definable
Смотреть что такое "strongly definable" в других словарях:
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… … Wikipedia
o-minimal theory — 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… … Wikipedia
Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… … Wikipedia
Simply typed lambda calculus — The simply typed lambda calculus (lambda^ o) is a typed interpretation of the lambda calculus with only one type combinator: o (function type). It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus… … Wikipedia
Morley rank — In mathematical logic, Morley rank, introduced by Michael D. Morley (1965), is a means of measuring the size of a subset of a model of a theory, generalizing the notion of dimension in algebraic geometry. Contents 1 Definition 2 Examples 3… … Wikipedia
O-minimal theory — In mathematical logic, and more specifically in model theory, a totally ordered structure ( M , lt;,...) is o minimal if and only if every definable set X sub; M (with parameters) can be realized as a finite union of intervals and points.A theory … Wikipedia
KABBALAH — This entry is arranged according to the following outline: introduction general notes terms used for kabbalah the historical development of the kabbalah the early beginnings of mysticism and esotericism apocalyptic esotericism and merkabah… … Encyclopedia of Judaism
List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic … Wikipedia
Tarski's undefinability theorem — Tarski s undefinability theorem, stated and proved by Alfred Tarski in 1936, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that arithmetical truth… … Wikipedia
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
painting, Western — ▪ art Introduction history of Western painting from its beginnings in prehistoric times to the present. Painting, the execution of forms and shapes on a surface by means of pigment (but see also drawing for discussion of depictions in … Universalium
