No label defined (Q3758822)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4008385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4008385 |
Statements
1984
0 references
proof theory
0 references
design of inductive inference algorithms
0 references
0.7644296288490295
0 references
0.7450317740440369
0 references
[For the entire collection see Zbl 0544.00005.] An attempt is made to exhibit what share proof theoretic methods can contribute to the design of inductive inference algorithms. The problem is investigated in two ways: first, from examining particular inductive inference algorithms to detect their inherent deductive components; and second, from developing a general approach to figure out what part of inductive inference algorithms is deductive in spirit. The investigations made in the paper lead to the following thesis: Formal proofs in particular theories, in particular, methods of efficiently proving inequalities, play a leading role in mechanized inductive inference.
0 references