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

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.

[1]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[2]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[3]  Jean-Michel Muller,et al.  Handbook of Floating-Point Arithmetic (2nd Ed.) , 2018 .

[4]  Lubomir V. Kolev,et al.  Interval Methods for Circuit Analysis , 1993, Advanced Series in Circuits and Systems.

[5]  S. Griffis EDITOR , 1997, Journal of Navigation.

[6]  Siegfried M. Rump,et al.  INTLAB - INTerval LABoratory , 1998, SCAN.

[7]  Guanrong Chen,et al.  Introduction to Fuzzy Sets, Fuzzy Logic, and Fuzzy Control Systems , 2000 .

[8]  J. Hintikka The Principles of Mathematics Revisited: Introduction , 1996 .

[9]  Zhang Xiao,et al.  Interval differential evolution with dimension-reduction interval analysis method for uncertain optimization problems , 2019, Applied Mathematical Modelling.

[10]  Jon G. Rokne,et al.  Computer Methods for the Range of Functions , 1984 .

[11]  Hend Dawood On Some Algebraic and Order-Theoretic Aspects of Machine Interval Arithmetic , 2019 .

[12]  R. Baker Kearfott,et al.  Introduction to Interval Analysis , 2009 .

[13]  Victor Joseph. Monte Leon Automatic error analysis in finite digital computations, using range arithmetic. , 1966 .

[14]  Scott McCallum On propagation of equational constraints in CAD-based quantifier elimination , 2001, ISSAC '01.

[15]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[16]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[17]  Gottlob Frege,et al.  Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens , 1879 .

[18]  Leonhard Euler,et al.  Foundations of Differential Calculus , 2000 .

[19]  A. A. Gaganov,et al.  Computation complexity of the range of a polynomial in several variables , 1985 .

[20]  G. Alefeld,et al.  Interval analysis: theory and applications , 2000 .

[21]  Donald W. Barnes,et al.  An Algebraic Introduction to Mathematical Logic , 1975 .

[22]  Hend Dawood,et al.  Parametric Intervals: More Reliable or Foundationally Problematic? , 2019 .

[23]  Hend Dawood,et al.  Universal Intervals , 2020 .

[24]  Christoph Quirin Lauter,et al.  Sollya: An Environment for the Development of Numerical Codes , 2010, ICMS.

[25]  Ronald T. Kneusel,et al.  Numbers and Computers , 2015, Springer International Publishing.

[26]  Ernest Gardeñes,et al.  Modal Intervals: Reason and Ground Semantics , 1985, Interval Mathematics.

[27]  Günter Pilz,et al.  Near-rings : the theory and its applications , 1983 .

[28]  Weldon A. Lodwick,et al.  Constrained Interval Arithmetic , 1999 .

[29]  Patrick Suppes,et al.  Axiomatic set theory , 1969 .

[30]  Mikolás Janota,et al.  Digital Object Identifier (DOI): , 2000 .

[31]  W. G. V. Hoorn,et al.  Fundamental notions in the theory of seminearrings , 1967 .

[32]  J. R. Clay,et al.  Nearrings: Geneses and Applications , 1992 .

[33]  Hend Dawood,et al.  Theories of Interval Arithmetic: Mathematical Foundations and Applications , 2011 .

[34]  Mohamed A. Amer First order logic with empty structures , 1989, Stud Logica.

[35]  Freddy Van Oystaeyen,et al.  Abstract Algebra : A Comprehensive Treatment , 2019 .

[36]  Hend Dawood,et al.  A Consistent and Categorical Axiomatization of Differentiation Arithmetic Applicable to First and Higher Order Derivatives , 2019 .

[37]  E. R. Hansen,et al.  A Generalized Interval Arithmetic , 1975, Interval Mathematics.

[38]  Ramon E. Moore Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[39]  Hend Dawood InCLosure (Interval enCLosure): A Language and Environment for Reliable Scientific Computing , 2018 .

[40]  Ramon E. Moore Interval arithmetic and automatic error analysis in digital computing , 1963 .

[41]  Svetoslav Markov,et al.  On directed interval arithmetic and its applications , 1996 .

[42]  Ulrich W. Kulisch,et al.  Computer Arithmetic and Validity - Theory, Implementation, and Applications , 2008, de Gruyter studies in mathematics.

[43]  J. C. Burkill Functions of Intervals , 1924 .

[44]  V. Kreinovich,et al.  Interval Methods for Data Fitting under Uncertainty: A Probabilistic Treatment , 2015 .

[45]  Guillaume Melquiond Proving Bounds on Real-Valued Functions with Computations , 2008, IJCAR.

[46]  G. Cantor Beiträge zur Begründung der transfiniten Mengenlehre , 1897 .

[47]  Vladik Kreinovich,et al.  Physics's Need for Interval Uncertainty and How It Explains Why Physical Space Is (at Least) 3-Dimensional , 2019, EUSFLAT Conf..

[48]  G. Sacks A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[49]  Hend Dawood Interval Mathematics: Foundations, Algebraic Structures, and Applications , 2012 .

[50]  S. Shayer INTERVAL ARITHMETIC WITH SOME APPLICATIONS FOR DIGITAL COMPUTERS , 1965 .

[51]  Jouko A. Väänänen,et al.  Dependence Logic - A New Approach to Independence Friendly Logic , 2007, London Mathematical Society student texts.

[52]  S. Feferman What Kind of Logic Is " Independence Friendly " Logic? , 2022 .

[53]  R. Young The algebra of many-valued quantities , 1931 .

[54]  Hend Dawood Interval Mathematics as a Potential Weapon against Uncertainty , 2014 .

[55]  T. Sunaga Theory of an interval algebra and its application to numerical analysis , 2009 .

[56]  Vladik Kreinovich,et al.  Interval Computations as an Important Part of Granular Computing: An Introduction , 2007 .