- Data Mining in Finance
- Scientific Discovery and
- Theory and methods
- Comparisons with
- Prediction problem
- Mearsurement theory
- Probabilistic formal
- Induction problem
- Natural classification
- Functional systems
- Computer models
- Financial forecasting
- Forensic Accounting
- Evgenii Vityaev
- Boris Kovalerchuk
Last updated 07/05/2020
One problem with induction is the dependence on the language used in its formulation.
Fortunately by placing reasonable restrictions on acceptable languages these dependencies can be resolved and the problem of
induction be made well defined.
Generalization of the Goodman's paradox presented in the papers.
Evgenii Vityaev, Irina Khomicheva. Goodman's paradox generalizations. In: Proceedings of the 12th International Congress of Logic Methodology and Philosophy of Science, (12 International Congress of Logic, Methodology and Philosophy of Science Oviedo (Spain), August 7-13 2003), 2003, pp.146-147. Vityaev E., Khomicheva I, Stating of induction problem using second level laws of nature In: Probabilistic ideas in science and philosophy, Novosibirsk, 2003, pp.72-86.
Vityaev E., Khomicheva I. Goodman's induction paradox. In: Methodological problems of cognitive processes. Proceedings of the Institute of mathematics SD RAS (Computer systems, #170), Novosibirsk, 2002 (in Russian)
One way to avoid Goodman's paradox is to extend the notion of language/ontology
with more properties concerning experimental procedures. By formulating a property of experiment - "the inheritance
of experimental results" - it can be proven that experimental dependency is logically equivalent to a set of universal formulas.
This property of experiment restricts the possible transformations of the language but gives a class of hypotheses which express
the experimental dependence. Only hypotheses from this class need to be tested by the inductive method.
This makes the problem of induction well defined.