- expressible relation
- мат. выразимое отношение
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Logic and the philosophy of mathematics in the nineteenth century — John Stillwell INTRODUCTION In its history of over two thousand years, mathematics has seldom been disturbed by philosophical disputes. Ever since Plato, who is said to have put the slogan ‘Let no one who is not a geometer enter here’ over the… … History of philosophy
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
Molality — In chemistry, the molality, b (or m), of a solvent/solute combination is defined as the amount of solute, nsolute, divided by the mass of the solvent, msolvent (not the mass of the solution)[1]: If a mixture contains more than one solute or… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium
Hermeneutics — Gadamer and Ricoeur G.B.Madison THE HISTORICAL BACKGROUND: ROMANTIC HERMENEUTICS Although the term ‘hermeneutics’ (hermeneutica) is, in its current usage, of early modern origin,1 the practice it refers to is as old as western civilization itself … History of philosophy
Binomial coefficient — The binomial coefficients can be arranged to form Pascal s triangle. In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the… … Wikipedia
analytic philosophy — n. a 20th cent. philosophic movement characterized by its method of analyzing concepts and statements in the light of common experience and ordinary language so as to eliminate confusions of thought and resolve many traditional philosophical… … Universalium
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Dependence logic — is a logical formalism, created by Jouko Väänänen[1], which adds dependence atoms to the language of first order logic. A dependence atom is an expression of the form , where are terms, and corresponds to the statement that the value of is… … Wikipedia