- structural inference
- мат. структурный вывод
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Structural equation modeling — (SEM) is a statistical technique for testing and estimating causal relations using a combination of statistical data and qualitative causal assumptions. This definition of SEM was articulated by the geneticist Sewall Wright (1921),[1] the… … Wikipedia
Structural proof theory — In mathematical logic, structural proof theory is the subdiscipline of proof theory that studies proof calculi that support a notion of analytic proof. Contents 1 Analytic proof 2 Structures and connectives 3 Cut elimination in the sequent… … Wikipedia
Inference engine — In computer science, and specifically the branches of knowledge engineering and artificial intelligence, an inference engine is a computer program that tries to derive answers from a knowledge base. It is the brain that expert systems use to… … Wikipedia
Structural rule — In proof theory, a structural rule is an inference rule that does not refer to any logical connective, but instead operates on the judgements or sequents directly. Structural rules often mimic intended meta theoretic properties of the logic.… … Wikipedia
Statistical inference — In statistics, statistical inference is the process of drawing conclusions from data that are subject to random variation, for example, observational errors or sampling variation.[1] More substantially, the terms statistical inference,… … Wikipedia
Deep inference — names a general idea in structural proof theory that breaks with the classical sequent calculus by generalising the notion of structure to permit inference to occur in contexts of high structural complexity. The term deep inference is generally… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
Descartes: methodology — Stephen Gaukroger INTRODUCTION The seventeenth century is often referred to as the century of the Scientific Revolution, a time of fundamental scientific change in which traditional theories were either replaced by new ones or radically… … History of philosophy
Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing … Wikipedia
Natural deduction — In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the natural way of reasoning. This contrasts with the axiomatic systems which instead use… … Wikipedia
Sequent calculus — In proof theory and mathematical logic, sequent calculus is a family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934 as … Wikipedia