Search references for CONSTRUCTIVE FUNCTION-THEORY. Phrases containing CONSTRUCTIVE FUNCTION-THEORY
See searches and references containing CONSTRUCTIVE FUNCTION-THEORY!CONSTRUCTIVE FUNCTION-THEORY
mathematical analysis, constructive function theory is a field which studies the connection between the smoothness of a function and its degree of approximation
Constructive_function_theory
Axiomatic set theories based on the principles of mathematical constructivism
Axiomatic constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. The same first-order language
Constructive_set_theory
Topics referred to by the same term
investigates functions of complex numbers Constructive function theory, the study of the connection between the smoothness of a function and its degree
Function_theory
Philosphical view that existence proofs must be constructive
Constructivism also includes the study of constructive set theories such as CZF and the study of topos theory. Constructivism is often identified with
Constructivism (philosophy of mathematics)
Constructivism_(philosophy_of_mathematics)
Alternative foundation of mathematics
Intuitionistic type theory (also known as constructive type theory, or Martin-Löf type theory (MLTT)) is a type theory and an alternative foundation of
Intuitionistic_type_theory
Mathematical theory of data types
Intuitionistic Type Theory. The logical framework of a type theory bears a resemblance to intuitionistic, or constructive, logic. Formally, type theory is often
Type_theory
2.71828...; base of natural logarithms
M. (1983). "The Computation of Logarithms by Huygens" (PDF). Constructive Function Theory: 254–257. The reference is to a problem which Jacob Bernoulli
E_(mathematical_constant)
Soviet mathematician
The Constructive Theory of Functions (1905–1930), translated: Atomic Energy Commission, Springfield, Va, 1958 vol. 2, The Constructive Theory of Functions
Sergei_Bernstein
Type theory in logic and mathematics
theoretic aspects of constructive type theory" in 2008. At about the same time, Vladimir Voevodsky was independently investigating type theory in the context
Homotopy_type_theory
Soviet mathematician
was a Soviet mathematician. He is known for his work in the constructive function theory, in particular, for the Remez algorithm and the Remez inequality
Evgeny_Yakovlevich_Remez
Branch of mathematical logic
relative to constructive theories, (2) combinatorial independence results, and (3) classifications of provably total recursive functions and provably
Proof_theory
Analytic function in mathematics
elsewhere. The Riemann zeta function plays a pivotal role in analytic number theory and has applications in physics, probability theory, and applied statistics
Riemann_zeta_function
Type of polynomial used in Numerical Analysis
Encyclopedia of Mathematics, EMS Press Natanson, I.P. (1964). Constructive function theory. Volume I: Uniform approximation. Translated by Alexis N. Obolensky
Bernstein_polynomial
from classical analysis. Constructive function theory a branch of analysis that is closely related to approximation theory, studying the connection between
Glossary of areas of mathematics
Glossary_of_areas_of_mathematics
foundations (also known as homotopy type theory). In cubical type theory, function extensionality and univalence are not postulated as axioms, but rather
Cubical_type_theory
Function that preserves distinctness
In mathematics, an injective function (also known as injection, or one-to-one function) is a function f that maps distinct elements of its domain to distinct
Injective_function
Standard system of axiomatic set theory
set theories: Morse–Kelley set theory Von Neumann–Bernays–Gödel set theory Tarski–Grothendieck set theory Constructive set theory Internal set theory At
Zermelo–Fraenkel_set_theory
Soviet mathematician
Soviet mathematician known for contributions to real analysis and constructive function theory, in particular, for his textbooks on these subjects. His son
Isidor_Natanson
Branch of mathematics that studies sets
that it does reflect an iterative conception of set. Systems of constructive set theory, such as CST, CZF, and IZF, embed their set axioms in intuitionistic
Set_theory
Set of all things that may be the input of a mathematical function
domain of the unknown function(s) sought. For example, it is sometimes convenient in set theory to permit the domain of a function to be a proper class
Domain_of_a_function
In approximation theory, a converse to Jackson's theorem
where the function φ(x) has a bounded r th derivative which is α-Hölder continuous. Bernstein's lethargy theorem Constructive function theory Achieser
Bernstein's theorem (approximation theory)
Bernstein's_theorem_(approximation_theory)
3-volume treatise on mathematics, 1910–1913
that a satisfactory solution is yet obtainable. Dr Leon Chwistek [Theory of Constructive Types] took the heroic course of dispensing with the axiom without
Principia_Mathematica
Natanson (1906–1964), real analysis and constructive function theory Melvyn Nathanson (born 1944), number theory Caryn Navy (born 1953), set-theoretic topology
List_of_Jewish_mathematicians
Mathematical inequality
No. 7. ISSN 1443-5756. Zbl 1060.30003. Natanson, I.P. (1964). Constructive function theory. Volume I: Uniform approximation. Translated by Alexis N. Obolensky
Bernstein's theorem (polynomials)
Bernstein's_theorem_(polynomials)
Function computable with bounded loops
In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all
Primitive_recursive_function
Axiom of set theory
varieties of constructive mathematics avoid the axiom of choice, others embrace it. A choice function (also called selector or selection) is a function f {\displaystyle
Axiom_of_choice
First article on transfinite set theory
numbers. Both constructive and non-constructive proofs have been presented as "Cantor's proof." The popularity of presenting a non-constructive proof has
Cantor's first set theory article
Cantor's_first_set_theory_article
Mathematical function such that every output has at least one input
surjective function (also known as surjection, or onto function /ˈɒn.tuː/) is a function f such that, for every element y of the function's codomain, there
Surjective_function
Study of computable functions and Turing degrees
computable function. The c.e. sets, although not decidable in general, have been studied in detail in computability theory. Beginning with the theory of computable
Computability_theory
Theory of evolution by changes at the molecular level
groundworks for the theory of constructive neutral evolution (CNE) was laid by two papers in the 1990s. Constructive neutral evolution is a theory which suggests
Neutral theory of molecular evolution
Neutral_theory_of_molecular_evolution
Quickly growing function
theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function
Ackermann_function
Mathematical analysis
{\mathbb {N} }^{\mathbb {N} }} , constructive second-order arithmetic, or strong enough topos-, type- or constructive set theories such as C Z F {\displaystyle
Constructive_analysis
Proof in set theory
S\leq S} , also in constructive set theory. It is however harder or impossible to order ordinals and also cardinals, constructively. For example, the Schröder–Bernstein
Cantor's_diagonal_argument
Academic journal
function theory, functional analysis, interpolation spaces and interpolation of operators, numerical analysis, space of functions, special functions,
Constructive_Approximation
Branch of mathematical logic
previous work in constructive analysis and proof theory. The use of second-order arithmetic also allows many techniques from recursion theory to be employed;
Reverse_mathematics
Symbol representing a mathematical concept
systems particularly mathematical logic, a function symbol is a non-logical symbol which represents a function or mapping on the domain of discourse, though
Function_symbol
expressions, shapes, functions, and sets. Mathematical objects can be very complex; for example, theorems, proofs, and even formal theories are considered as
Mathematical_object
The vast majority of positive results about computational problems are constructive proofs, i.e., a computational problem is proved to be solvable by showing
Non-constructive algorithm existence proofs
Non-constructive_algorithm_existence_proofs
Mathematical models of strategic interactions
game theory, which has developed novel representations, e.g. surreal numbers, as well as combinatorial and algebraic (and sometimes non-constructive) proof
Game_theory
Area of mathematical logic
In mathematical logic, model theory is the study of the relationship between formal theories (a collection of sentences in a formal language expressing
Model_theory
Theories in mathematical logic
Pocket set theory General set theory, GST Constructive set theory, CZF Mac Lane set theory and Elementary topos theory Zermelo set theory; Z Zermelo–Fraenkel
List_of_first-order_theories
Interpretation of quantum mechanics
in de Broglie–Bohm theory is not a postulate. Rather, in this theory, the link between the probability density and the wave function has the status of
De_Broglie–Bohm_theory
Mathematical function that can be computed by a program
Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes
Computable_function
Mathematical construction of a set with an equivalence relation
or the equality on the quotient set). In proof theory, particularly the proof theory of constructive mathematics based on the Curry–Howard correspondence
Setoid
Branch of mathematics
also rejected in constructive mathematics, a branch of mathematics that insists that proofs of the existence of a number, function, or other mathematical
Calculus
Inequality on approximations of a function by algebraic or trigonometric polynomials
given by Bernstein's theorem. See also constructive function theory. Achiezer (Akhiezer), N.I. (2013) [1956]. Theory of approximation. Translated by Hyman
Jackson's_inequality
therefore this constant function is a realizer. If instead the realizability interpretation is used in a constructive meta-theory, then it is not justified
Markov's_principle
Thesis on the nature of computability
In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions. It states that a function on the natural numbers
Church–Turing_thesis
Logical connective AND
C {\displaystyle C} is a false proposition. Either of the above are constructively valid proofs by contradiction. commutativity: yes associativity: yes
Logical_conjunction
Theorem in set theory
In set theory, the Schröder–Bernstein theorem states that, if there exist injective functions f : A → B and g : B → A between the sets A and B, then there
Schröder–Bernstein_theorem
Collection of sets in mathematics that can be defined based on a property of its members
In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined
Class_(set_theory)
Target set of a mathematical function
not part of a function f if f is defined as just a graph. For example, in set theory it is desirable to permit the domain of a function to be a proper
Codomain
Theorem in mathematical logic
assumed. The proof below is therefore given using the means of a constructive set theory. It is evident from the proof how the theorem relies on the axiom
Diaconescu's_theorem
System of mathematical set theory
connections between KP, computability theory, and the theory of admissible ordinals. KP can be studied as a constructive set theory by dropping the law of excluded
Kripke–Platek_set_theory
Theoretical framework in physics
Axiomatic quantum field theory Common integrals in quantum field theory Conformal field theory Constructive quantum field theory Dirac's equation Feynman
Quantum_field_theory
Axioms for the natural numbers
multiplication are often added as axioms. The respective functions and relations are constructed in set theory or second-order logic, and can be shown to be unique
Peano_axioms
intuitionistic (i.e. constructive logic) theory, its content being clarified by the existence of a free topos. That is a set theory, in a broad sense, but
History_of_topos_theory
Generalization of the real numbers
they form an ordered field. If formulated in von Neumann–Bernays–Gödel set theory, the surreal numbers are a universal ordered field in the sense that all
Surreal_number
quantify over functions in the latter sense, all such uses are in principle eliminable. Outside of formal set theory, we usually specify a function in terms
Implementation of mathematics in set theory
Implementation_of_mathematics_in_set_theory
Function returning one of only two values
Boolean functions are the subject of Boolean algebra and switching theory. A Boolean function takes the form f : { 0 , 1 } k → { 0 , 1 } {\displaystyle f:\{0
Boolean_function
Problem in computer science
Number Theory", which proposes that the intuitive notion of an effectively calculable function can be formalized by the general recursive functions or equivalently
Halting_problem
Subfield of mathematics
mathematical logic into four areas: set theory model theory recursion theory, and proof theory and constructive mathematics (considered as parts of a single
Mathematical_logic
Millennium Prize Problem
physics, in particular constructive quantum field theory, and The mass of all particles of the force field predicted by the theory are strictly positive
Yang–Mills existence and mass gap
Yang–Mills_existence_and_mass_gap
Infinite cardinal number
In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets. They
Aleph_number
Logical principle
Consequentia mirabilis – Pattern of reasoning in propositional logic Constructive set theory Diaconescu's theorem – Theorem in mathematical logic Dichotomy –
Law_of_excluded_middle
Mathematical-logic system based on functions
languages Explicit substitution – The theory of substitution, as used in β-reduction Harrop formula – A kind of constructive logical formula such that proofs
Lambda_calculus
Study of mathematical analysis seen through computability theory
of constructive analysis is therefore in direct contradiction to schools of constructive analysis — such as Markov's — which claim that all functions are
Computable_analysis
Axiom
In constructive mathematics, Church's thesis C T {\displaystyle {\mathrm {CT} }} is the principle stating that all total functions are computable functions
Church's thesis (constructive mathematics)
Church's_thesis_(constructive_mathematics)
Mathematical set that can be enumerated
numbers. Equivalently, a set is countable if there exists an injective function from it into the natural numbers; this means that each element in the set
Countable_set
Measure of algorithmic complexity
Inductive reasoning Kolmogorov structure function Levenshtein distance Manifold hypothesis Solomonoff's theory of inductive inference Sample entropy Rayo's
Kolmogorov_complexity
Basic framework of mathematics
(link) Martin-Löf, Per (1998). An intuitionistic theory of types, Twenty-five years of constructive type theory (Venice,1995). Oxford Logic Guides. Vol. 36
Foundations_of_mathematics
Phenomenon resulting from the superposition of two waves
their phase difference. The resultant wave may have greater amplitude (constructive interference) or lower amplitude (destructive interference) if the two
Wave_interference
Paradox in set theory
the problem in terms of both logic and set theory, and in particular in terms of Frege's definition of function: There is just one point where I have encountered
Russell's_paradox
General theory of mathematical structures
applications of category theory have been worked out in fair detail as a basis for, and justification of, constructive mathematics. Topos theory is a form of abstract
Category_theory
System of mathematical set theory
John von Neumann introduced classes into set theory in 1925. The primitive notions of his theory were function and argument. Using these notions, he defined
Von Neumann–Bernays–Gödel set theory
Von_Neumann–Bernays–Gödel_set_theory
model — application: replacing a function that is hard to evaluate by a simpler function Constructive function theory — field that studies connection between
List of numerical analysis topics
List_of_numerical_analysis_topics
Number of arguments required by a function
science, arity (/ˈærɪti/ ) is the number of arguments or operands taken by a function, operation or relation. In mathematics, arity may also be called rank,
Arity
Concerned with the notion of stability in model theory
concrete results from this classification theory were theorems on the possible spectrum functions of a theory, counting the number of models of cardinality
Stable_theory
Basic notion of sameness in mathematics
groupoid interpretation of type theory". In Sambin, Giovanni; Smith, Jan M. (eds.). Twenty Five Years of Constructive Type Theory. Oxford Logic Guides. Vol
Equality_(mathematics)
Tarski's exponential function problem concerns the extension of this theory to another primitive operation, the exponential function. It is an open problem
Decidability of first-order theories of the real numbers
Decidability_of_first-order_theories_of_the_real_numbers
Obsolete theories in natural history and natural philosophy
of disease. Phrenology – a theory of highly localised brain function popular in 19th century medicine. Homeopathy – a theory according to which a disease
List of superseded scientific theories
List_of_superseded_scientific_theories
Concept in the philosophy of mathematics
in his comprehensive survey Constructivism in Mathematics (1988), the constructive logician A. S. Troelstra dismissed it by saying "no satisfactory development
Ultrafinitism
System of mathematical set theory
mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Morse–Tarski set theory (MT), Quine–Morse set theory (QM) or the system of Quine
Morse–Kelley_set_theory
Mathematical set formed from two given sets
In mathematics, specifically set theory, the Cartesian product of two sets A and B, denoted A × B, is the set of all ordered pairs (a, b) where a is an
Cartesian_product
Function in analytic number theory
In mathematics, in the area of analytic number theory, the Dirichlet eta function is defined by the following Dirichlet series, which converges for any
Dirichlet_eta_function
Mathematical use of "there exists"
existential statement about "some" object may be achieved either by a constructive proof, which exhibits an object satisfying the "some" statement, or by
Existential_quantification
One-to-one correspondence
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the
Bijection
Condition for a mathematical function to map some value to itself
function yields a fixed point. By contrast, the Brouwer fixed-point theorem (1911) is a non-constructive result: it says that any continuous function
Fixed-point_theorem
Mathematical result on infinite trees
especially in computability theory. This theorem also has important roles in constructive mathematics and proof theory. Let G {\displaystyle G} be a
Kőnig's_lemma
Theorem in topology
intuitionism, with some modifications. For further details see constructive set theory. Milnor 1965, pp. 1–19 Teschl, Gerald (2019). "10. The Brouwer
Brouwer_fixed-point_theorem
Size of a possibly infinite set
exponential function is non-decreasing. The notion of cardinality, as now understood, was formulated by Georg Cantor, the originator of set theory, in 1874–1884
Cardinal_number
Branch of mathematics
spaces, and function spaces. Its major areas include complex analysis, functional analysis, measure theory, harmonic analysis, and the theory of ordinary
Mathematical_analysis
Set of sentences in a formal language
In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. In most scenarios a deductive system is first
Theory_(mathematical_logic)
Input to a mathematical function
of a function is a value provided to obtain the function's result. It is also called an independent variable. For example, the binary function f ( x
Argument_of_a_function
of constructive theories such as Heyting arithmetic and constructive set theories (Rathjen 2005). The disjunction property is satisfied by a theory if
Disjunction and existence properties
Disjunction_and_existence_properties
Size of a set in mathematics
{\displaystyle \alpha } . This allows one to use a constructive definition of the cardinality function, by assigning each set to its equinumerous aleph
Cardinality
Value indicating the relation of a proposition to truth
form a Boolean algebra, in intuitionistic logic, and more generally, constructive mathematics, the truth values form a Heyting algebra. Such truth values
Truth_value
Informal set theories
mathematical objects (numbers, relations, functions, etc.) are defined in terms of sets. Naive set theory suffices for many purposes, while also serving
Naive_set_theory
Subset of a function's codomain
a function may refer either to the codomain of the function, or the image of the function. In some cases the codomain and the image of a function are
Range_of_a_function
Mathematical set containing no elements
zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced
Empty_set
CONSTRUCTIVE FUNCTION-THEORY
CONSTRUCTIVE FUNCTION-THEORY
Girl/Female
Hindu, Indian
Fraction of the Cosmos
Boy/Male
French Greek
Cyrano de Bergerac was a seventeenth-century soldier and science-fiction writer.
Boy/Male
Buddhist, Indian, Japanese
Mysterious Function
Girl/Female
Hindu
Creation, Construction, Arrangement
Boy/Male
Indian
Friction
Girl/Female
Afghan, Arabic, Australian, Indian, Muslim
Fiction; Romance; Story
Girl/Female
Assamese, Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Oriya, Sanskrit, Sindhi, Tamil, Telugu
Construction; Arrangement; Creative Art; All Creation
Girl/Female
Tamil
Creation, Construction, Arrangement
Boy/Male
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Tamil, Telugu
Creation; Evolution; Construction
Girl/Female
Tamil
Ankshika | அஂகà¯à®·à¯€à®•ா
It’s derived from the root word - anksh that means a fraction. Ankshika means the fraction of the cosmos
Ankshika | அஂகà¯à®·à¯€à®•ா
Girl/Female
Indian
It’s derived from the root word - anksh that means a fraction. Ankshika means the fraction of the cosmos
Biblical
Look for pages within Wikipedia that link to this title
If a page was recently created here it may not be visible yet because of a delay in updating the database; wait a few minutes or try the function.
Look for pages within Wikipedia that link to this title
Girl/Female
Tamil
Light, Beauty, Prosperity, Rank, Power, Steel construction company
Girl/Female
Indian
Built; Construction; Creative Art; All Creation
Girl/Female
Tamil
Creation, Construction, Arrangement
Boy/Male
Arabic, Muslim
A Persian Construction Probably from the Arabic Mawla (Master; Leader; Lord)
Girl/Female
Hindu, Indian, Marathi
Produce; New Construction
Girl/Female
Bengali, Indian
Fraction of Time
Girl/Female
Hindu
Creation, Construction, Arrangement
Girl/Female
Hindu
Light, Beauty, Prosperity, Rank, Power, Steel construction company
CONSTRUCTIVE FUNCTION-THEORY
CONSTRUCTIVE FUNCTION-THEORY
Boy/Male
Buddhist, Indian
Everlasting
Boy/Male
Indian
One who Perform Well in Battle
Female
Icelandic
Feminine form of Icelandic Páll, PÃLA means "small."
Girl/Female
Latin American
Noble. St. Patricia was a 7th century patron saint of Naples.
Male
Yiddish
Yiddish form of Hebrew Yitzchak, AIZIK means "he will laugh."Â
Girl/Female
Indian, Telugu
Phrase of Music
Boy/Male
Tamil
Ameyatma | அமேயதà¯à®®à®¾
Manifests in infinite varieties, Lord Vishnu
Boy/Male
Afghan, Arabic, Australian, Muslim
Firm
Girl/Female
Muslim/Islamic
Dawn
Boy/Male
Irish
From the ford of the oak tree.
CONSTRUCTIVE FUNCTION-THEORY
CONSTRUCTIVE FUNCTION-THEORY
CONSTRUCTIVE FUNCTION-THEORY
CONSTRUCTIVE FUNCTION-THEORY
CONSTRUCTIVE FUNCTION-THEORY
n.
The process or art of constructing; the act of building; erection; the act of devising and forming; fabrication; composition.
a.
Pertaining to the function of an organ or part, or to the functions in general.
adv.
In a constructive manner; by construction or inference.
a.
Conveying knowledge; serving to instruct or inform; as, experience furnishes very instructive lessons.
a.
Having ability to construct or form; employed in construction; as, to exhibit constructive power.
n.
The act of joining, or the state of being joined; union; combination; coalition; as, the junction of two armies or detachments; the junction of paths.
v. t.
To give sanction to; to ratify; to confirm; to approve.
n.
A quantity so connected with another quantity, that if any alteration be made in the latter there will be a consequent alteration in the former. Each quantity is said to be a function of the other. Thus, the circumference of a circle is a function of the diameter. If x be a symbol to which different numerical values can be assigned, such expressions as x2, 3x, Log. x, and Sin. x, are all functions of x.
n.
The act of constructing; construction.
n.
An obstructive person or thing.
n.
The act of anointing, smearing, or rubbing with an unguent, oil, or ointment, especially for medical purposes, or as a symbol of consecration; as, mercurial unction.
n.
The things sold by auction or put up to auction.
n.
The appropriate action of any special organ or part of an animal or vegetable organism; as, the function of the heart or the limbs; the function of leaves, sap, roots, etc.; life is the sum of the functions of the various organs and parts of the body.
a.
Pertaining to, or connected with, a function or duty; official.
a.
Derived from, or depending on, construction or interpretation; not directly expressed, but inferred.
a.
Reconstructing; tending to reconstruct; as, a reconstructive policy.
v. t.
The act of uniting, or the state of being united; junction.
n.
The act of constructing vaults; a vaulted construction.
v. t.
To sell by auction.
n.
The place or point of union, meeting, or junction; specifically, the place where two or more lines of railway meet or cross.