Definable
51Von Neumann–Bernays–Gödel set theory — In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of the canonical axiomatic set theory ZFC. A statement in the language of ZFC is provable in NBG if and only …
52Saturated model — There is an unrelated notion of saturated model in the context of structural equation modeling. In mathematical logic, and particularly in its subfield model theory, a saturated model M is one which realizes as many complete types as may be… …
53Tarski'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… …
54Post's theorem — In computability theory Post s theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. Background The statement of Post s theorem requires several concepts relating to definability and… …
55Morley 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… …
56List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… …
57Core model — In set theory, the core model is a definable inner model of the universe of all sets. Even though set theorists refer to the core model , it is not a uniquely identified mathematical object. Rather, it is a class of inner models that under the… …
58Silver machine — This article is about the device. For the Hawkwind song, see Silver Machine. Not to be confused with Silver Machines. In set theory, Silver machines are devices used for bypassing the use of fine structure in proofs of statements holding in L.… …
59List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …
60Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… …
