Skip to content
naulon

Not checkedNot checked for notices yet.

Raven paradox: problem and solution given on the basis of Aristotle’s logic

Zamorev Anton, Fedyukovsky Alexander

E3S Web of Conferences · 2021

doi:10.1051/e3sconf/202124411032 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The paper is devoted to the solution of two well-known paradoxes of inductive logic: Hempel’s and Goodman’s, which the science has not solved unambiguously yet. The results of this research can be used in any natural science, but they are especially relevant for areas where there is an emphasis placed on environmental friendliness and sustainable development. The central problem of this research is the problem of limits of applying classical logic laws. The problem is solved by method of reduction of logical laws to those cases where they, according to Aristotle, act faultlessly, and refusal of their recognition in the cases where their action is questionable. The aim of the paper is to demonstrate the solution of both problems within Aristotle’s logic. In that regard, the following results are received: common faults of previous solutions of Hempel’s paradox, consisting in ignoring any of its parties, are revealed; the original nature of Goodman’s paradox, consisting in wrong interpreting “inductive confirmation” criteria is opened; two methods of forming and assessing the subject volumes of statements are revealed: analytical and synthetical ones; it is proved that the theses treated in Hempel’s paradox as equivalent ones are not always so, but only on condition of their subjects’ reality and of their subject volumes’ identity; it is established that the conditions of the statement equivalence correspond to the limits of applying logic laws in Aristotle’s interpretation.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.