Published July 1, 2019 | Version v1
Journal article Open

A Logical Formalization of the Notion of Interval Dependency: Towards Reliable Intervalizations of Quantifiable Uncertainties

  • 1. Department of Mathematics, Faculty of Science, Cairo University, Giza 12613, Egypt
  • 2. Department of Astronomy, Faculty of Science, Cairo University, Giza 12613, Egypt

Description

Progress in scientific knowledge discloses an increasingly paramount use of quantifiable properties in the description of states and processes of the real-world physical systems. Through our encounters with the physical world, it reveals itself to us as systems of uncertain quantifiable properties. One approach proved to be most fundamental and reliable in coping with quantifiable uncertainties is interval mathematics. A main drawback of interval mathematics, though, is the persisting problem known as the "interval dependency problem". This, naturally, confronts us with the question: Formally, what is interval dependency? Is it a meta-concept or an object-ingredient of interval and fuzzy computations? In other words, what is the fundamental defining properties that characterize the notion of interval dependency as a formal mathematical object? Since the early works on interval mathematics by John Charles Burkill and Rosalind Cecily Young in the dawning of the twentieth century, this question has never been touched upon and remained a question still today unanswered. Although the notion of interval dependency is widely used in the interval and fuzzy literature, it is only illustrated by example, without explicit formalization, and no attempt has been made to put on a systematic basis its meaning, that is, to indicate formally the criteria by which it is to be characterized. Here, we attempt to answer this long-standing question. This article, therefore, is devoted to presenting a complete systematic formalization of the notion of interval dependency, by means of the notions of Skolemization and quantification dependence. A novelty of this formalization is the expression of interval dependency as a logical predicate (or relation) and thereby gaining the advantage of deducing its fundamental properties in a merely logical manner. Moreover, on the strength of the generality of the logical apparatus we adopt, the results of this article are not only about classical intervals, but they are meant to apply also to any possible theory of interval arithmetic. That being so, our concern is to shed new light on some fundamental problems of interval mathematics and to take one small step towards paving the way for developing alternate dependency-aware interval theories and computational methods.

Notes

Supplementary Material: http://doi.org/10.5281/zenodo.3466032 Download latest release of InCLosure via https://doi.org/10.5281/zenodo.2702404

Files

OMJ_01-03_p15-36_Dawood.pdf

Files (528.8 kB)

Name Size Download all
md5:1fc878f2e9d4ae0d327a220c4f5325f5
528.8 kB Preview Download

Additional details

Related works

Cites
Software: 10.5281/zenodo.2702404 (DOI)
Dataset: 10.5281/zenodo.3466032 (DOI)
Journal article: 10.5281/zenodo.2656089 (DOI)