- logical deducibility
- мат. логическая выводимость
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
logic — logicless, adj. /loj ik/, n. 1. the science that investigates the principles governing correct or reliable inference. 2. a particular method of reasoning or argumentation: We were unable to follow his logic. 3. the system or principles of… … Universalium
Entailment — For other uses, see Entail (disambiguation). In logic, entailment is a relation between a set of sentences (e.g.,[1] meaningfully declarative sentences or truthbearers) and a sentence. Let Γ be a set of one or more sentences; let S1 be the… … Wikipedia
History of logic — Philosophy ( … Wikipedia
applied logic — Introduction the study of the practical art of right reasoning. The formalism (formal logic) and theoretical results of pure logic can be clothed with meanings derived from a variety of sources within philosophy as well as from other… … Universalium
Bernard Bolzano — Bernard (Bernhard) Placidus Johann Nepomuk Bolzano (birth date|1781|10|5|mf=y ndash; December 18, 1848) was a Bohemian mathematician, theologian, philosopher, logician and antimilitarist of German mother tongue.FamilyBolzano was the son of two… … Wikipedia
Rule of inference — In logic, a rule of inference (also called a transformation rule) is a function from sets of formulae to formulae. The argument is called the premise set (or simply premises ) and the value the conclusion . They can also be viewed as relations… … Wikipedia
proof theory — The study of the relations of deducibility among sentences in a logical calculus . Deducibility is defined purely syntactically, that is, without reference to the intended interpretation of the calculus. See also model theory … Philosophy dictionary
Deductive closure — For other uses, see Closure (disambiguation). Peter D. Klein, in the second edition of The Cambridge Dictionary of Philosophy, defines closure as follows: A set of objects, O, is said to exhibit closure or to be closed under a given operation, R … Wikipedia
HOL Light — is a member of the HOL theorem prover family. Likethe other members, it is a proof assistant for classical higher order logic. Compared with other HOL systems, HOL Light isintended to have relatively simple foundations.Logical foundationsHOL… … Wikipedia
КЁРРИ — (Curry), Хаскелл Брукс (р. 12 сент. 1900) – амер. логик, математик и философ, проф. Пенсильванского ун та с 1941. Большинство соч. К. посвящено логике комбинаторной и связанным с ней вопросам общей теории формальных систем и исчислений. Осн.… … Философская энциклопедия