Volume1 Issue32019-10-13T20:44:12+00:00

Volume 1: Issue 3

Volume 1: Issue 3

Relevant Functions to (p,q)-Gamma Function and (p,q)-Beta Function

Author(s):  Areen Al-Khateeb
DOI: 10.5281/zenodo.3471723
Keywords :  (p,q)-Gamma function; (p,q)-Beta function 
Cite this article:  Areen Al-Khateeb (2019). Relevant Functions to (p,q)-Gamma Function and (p,q)-Beta Function. Online Mathematics Journal, 01(03), 1–14. DOI: 10.5281/zenodo.3471723. [BibTeX Export]

In this article, we study some new functions (namely Γ ̃_(p,q) (z)=Γ_(q/p) (z) and B ̃_(p,q) (s,t)=Γ_(q/p) (s,t)) and we will show how these functions are relevant to (p,q)-Gamma function and (p,q)-Beta function.

  • Andrews, R. Askey and R. Roy Special functions, V 71 of Encyclopedia of Mathematics and it Applications, Cambridge University Press, Cambridge,1997.
  • Exton  Q-hypergeometric  functions  and  applications,  Ellis  HorwoodSeries:Mathematics, and it Applications, Ellis Horwood Ltd., Chichester,1985.
  • Gasper and M. Rahman, Basic hypergeometric series, V 35 of Encyclope-dia of Mathematics and its Applications, Cambridge University Press, Cambridge,1992.
  • Jackson, A generalization of the functions (N) and XN , Proc. Roy. Sc.London, (74) pp 64-72, 1906.
  • H. Jackson, On Q–definite integrals, Quart. J. Pure and Appli. Math, (41) pp 193-203,1910.
  • Kac and P. Cheung, Quantum Calculus, Universitext, Springer-Verlag, New York, 2004.
  • T. Koelink and T. H.Koornwinder, Q-special functions, a tutorial, in De-formation theory and quantum groups with applications to mathematical physics (Amherst, MA, 1990), volume 134 of Contemp. Math., pp 141–142, Amer. Math. Soc.,Providence, RI, 1992.
  • H. Koornwinder, Special functions and Q-commuting variables, in Special func-tions, Q-series and related topics (Toronto, ON, 1995), volume 14 of Fields Inst. Commun., pp 131–166,Amer. Math. Soc., Providence, RI, 1997.
  • Thomae, BeitragezurTheorie der durch die HeinescheReihe., J. reineangew. Math, (70) pp 258–281, 1869.
  • Aral, A, Gupta, V: (p,q)-type Beta functions.
  • M. Burban, A. U. Klimyk: (P,Q)-Differentiation, (P,Q) integration, and (P,Q)-hypergeometric functions related to quantum groups, Integral Transform and Special Functions, 2:1, 15-36, (1994)
  • Chakrabarti, R. Jagannathan, A (p, q)-oscillator realization of two-parameter quantum algebras, J. Phys. A: Math. Gen. 24, L711, 1991
  • N SADJANG: On the (p,q)-Gamma and the (p,q)-Beta functions, arXiv 1506.07394v1.22Jun 2015.
  • Odzijewicz, Quantum algebraa and q-special functions related to coherent states maps of the disc, Commun. Math. Phys., 192, 183-215, 1998
  • Quesne, K. A. Penson, V. M. Tkachuk, Maths-type q-deformed coherent states for q > 1, Phys. Lett. A 313 29, 2003
  • M. Temme: Special Functions, an Introduction to Classical Functions of Mathematical Physics, John Wiley & Sons, New York, 1996.
Download Full Text

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

Author(s):  Hend Dawood and Yasser Dawood
DOI: 10.5281/zenodo.3234184
Keywords :  Interval mathematics; Interval dependency; Functional dependence; Skolemization; Guaranteed bounds; Interval enclosures; Interval functions; Quantifiable uncertainty; Scientific knowledge; Reliability; Fuzzy mathematics; InCLosure 
Cite this article:  Hend Dawood and Yasser Dawood (2019). A Logical Formalization of the Notion of Interval Dependency: Towards Reliable Intervalizations of Quantifiable Uncertainties. Online Mathematics Journal, 01(03), 15–36. DOI: 10.5281/zenodo.3234184. [BibTeX Export]

Supplementary Material: http://doi.org/10.5281/zenodo.3466032

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.

Alefeld, G. & Herzberger, J. (1983), Introduction to Interval Computation, Academic Press, New York.

Alefeld, G. & Mayer, G. (2000), ‘Interval Analysis: Theory and Applications’, Journal of Computational and Applied Mathematics 121(1), 421–464.

Amer, M. A. (1989), ‘First Order Logic with Empty Structures’, Studia Logica 48, 169–177.

Armstrong, W. W. (1974), Dependency Structures of Data Base Relationships, in ‘Proceedings of IFIP Congress’, pp. 580–583.

Barnes, D. W. & Mack, J. M. (1975), An Algebraic Introduction to Mathematical Logic, Springer Verlag.

Basu, S.; Pollack, R. & Roy, M.-F. (2003), Algorithms in Real Algebraic Geometry, Springer Verlag.

Boche, R. E. (1963), ‘An Operational Interval Arithmetic”IEEE National Electronics Conference, University of Illinois’, Chicago.

Burkill, J. C. (1924), ‘Functions of Intervals’, Proceedings of the London Mathematical Society 2(1), 275–310.

Cantor, G. (1897), ‘Beitrage zur Begrundung der transfiniten Mengenlehre II’, Mathematische Annalen 49, 207–246.

Chen, G. & Pham, T. T. (2000), Introduction to Fuzzy Sets, Fuzzy Logic, and Fuzzy Control Systems, CRC Press.

Chevillard, S.; Joldes, M. & Lauter, C. (2010), Sollya: An Environment for the Development of Numerical Codes, in K. Fukuda; J. van der Hoeven; M. Joswig & N. Takayama, ed., ‘Mathematical Software – ICMS 2010’, Springer, Heidelberg, Germany, pp. 28–31.

Clay, J. R. (1992), Nearrings: Geneses and Applications, Oxford University Press.

Collins, G. E. (1975), Quantifier Elimination for the Elementary Theory of Real Closed Fields by Cylindrical Algebraic Decomposition, in ‘Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern’, Springer Verlag, , pp. 134-183.

Corcoran, J. & Ramnauth, A. (2013), ‘Equality and Identity’, Bulletin of Symbolic Logic 19(3), 255–256.

Dawood, H. (2014), Interval Mathematics as a Potential Weapon against Uncertainty, in S. Chakraverty, ed., ‘Mathematics of Uncertainty Modeling in the Analysis of Engineering and Science Problems’, IGI Global, Hershey, PA, pp. 1–38.

Dawood, H. (2019), ‘On Some Algebraic and Order-Theoretic Aspects of Machine Interval Arithmetic’, Online Mathematics Journal 1(2), 1–13.

Dawood, H. (2018), ‘InCLosure (Interval enCLosure)–A Language and Environment for Reliable Scientific Computing’, Technical report, Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt, InCLosure Support: http://scholar.cu.edu.eg/henddawood/software/InCLosure.

Dawood, H. (2012), ‘Interval Mathematics: Foundations, Algebraic Structures, and Applications’, Master’s thesis, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. (2011), Theories of Interval Arithmetic: Mathematical Foundations and Applications, LAP Lambert Academic Publishing, Saarbrücken.

Dawood, H. & Dawood, Y. (2020), Universal Intervals: Towards a Dependency-Aware Interval Algebra, in S. Chakraverty, ed., ‘Mathematical Methods in Interdisciplinary Sciences’, John Wiley & Sons, Hoboken, New Jersey.

Dawood, H. & Dawood, Y. (2019), ‘Parametric Intervals: More Reliable or Foundationally Problematic?’, Online Mathematics Journal 1(3), 37–54.

Dawood, H. & Dawood, Y. (2017), ‘Investigations into a Formalized Theory of Interval Differentiation'(CU-Math-2017-03-IFTID), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2016), ‘Interval Algerbras: A Formalized Treatment'(CU-Math-2016-06-IAFT), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2016), ‘The Form of the Uncertain: On the Mathematical Structures of Uncertainty'(CU-Math-2016-09-FUMSU), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2014), ‘On Some Order-theoretic Aspects of Interval Algebras'(CU-Math-2014-06-OTAIA), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2013), ‘Logical Aspects of Interval Dependency'(CU-Math-2013-03-LAID), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2013), ‘A Dependency-Aware Interval Algebra'(CU-Math-2013-09-DAIA), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2010), ‘On the Metamathematics of the Theory of Interval Numbers'(CU-Math-2010-06-MTIN), Technical report, Department of Mathematics, Faculty of Science, Cairo University, Giza.

Dawood, H. & Megahed, N. (2019), ‘A Consistent and Categorical Axiomatization of Differentiation Arithmetic Applicable to First and Higher Order Derivatives’, Punjab University Journal of Mathematics 51(11), 77–100.

Dwyer, P. S. (1951), Linear computations, Chapman & Hall, New York.

Euler, L. (2000), Foundations of Differential Calculus, Springer Verlag.

Feferman, S. (2006), What Kind of Logic is Independence-Friendly Logic?, in Randall E. Auxier & Lewis Edwin Hahn, ed., ‘The Philosophy of Jaakko Hintikka’, Open Court Publishing Company, , pp. 453–469.

Frege, G. (1879), Begriffsschrift: Eine der Arithmetischen Nachgebildete Formelsprache des Reinen Denkens, Verlag von Louis Nebert, Halle.

Fu, C.; Liu, Y. & Xiao, Z. (2019), ‘Interval Differential Evolution with Dimension-Reduction Interval Analysis Method for Uncertain Optimization Problems’, Applied Mathematical Modelling 69, 441–452.

Gaganov, A. A. (1985), ‘Computational Complexity of the Range of the Polynomial in Several Variables’, Cybernetics 21, 418–421.

Gardenyes, E.; Mielgo, H. & Trepat, A. (1985), Modal Intervals: Reason and Ground Semantics, in ‘Interval Mathematics’, Springer Verlag, , pp. 27–35.

Hansen, E. R. (1975), A Generalized Interval Arithmetic, in ‘Interval Mathematics’, Springer Verlag, , pp. 7–18.

Hintikka, J. (1996), The Principles of Mathematics Revisited, Cambridge University Press.

van Hoorn, W. G. & van Rootselaar, B. (1967), ‘Fundamental Notions in the Theory of Seminearrings’, Compositio Mathematica 18(1-2), 65–78.

Committee, I. 1788. (2018), ‘IEEE Standard for Interval Arithmetic (Simplified)’, IEEE Std 1788.1-2017, 1–38.

Committee, I. 1788. (2015), ‘IEEE Standard for Interval Arithmetic’, IEEE Std 1788-2015, 1–97.

Kleene, S. C. (2002), Mathematical Logic, Dover Publications, New York.

Kneusel, R. T. (2015), Numbers and Computers, Springer International Publishing, Switzerland.

Kolev, L. V. (1993), Interval Methods for Circuit Analysis, World Scientific Publishing Company.

Kosheleva, O. & Kreinovich, V. (2019), ‘Physics Need for Interval Uncertainty and How It Explains Why Physical Space Is (at Least) 3-Dimensional'(UTEP-CS-19-05), Technical report, University of Texas at El Paso.

Kreinovich, V. (2008), Interval Computations as an Important Part of Granular Computing: An Introduction, in Witold Pedrycz; Andrzej Skowron & Vladik Kreinovich, ed., ‘Handbook of Granular Computing’, Wiley-Interscience, .

Kreinovich, V. & Shary, S. P. (2016), ‘Interval Methods for Data Fitting Under Uncertainty: A Probabilistic Treatment’, Reliable Computing 23, 105–141.

Kulisch, U. W. (2008), Computer Arithmetic and Validity: Theory, Implementation, and Applications, Walter de Gruyter.

Lobachevskii, N. I. (1951), Complete works 5, Moscow-Leningrad.

Lodwick, W. A. (1999), ‘Constrained Interval Arithmetic'(138), Technical report, University of Colorado at Denver, Center for Computational Mathematics, Denver, USA.

Markov, S. M. (1995), ‘On Directed Interval Arithmetic and its Applications’, Journal of Universal Computer Science 1(7), 514–526.

McCallum, S. (2001), On Propagation of Equational Constraints in CAD-Based Quantifier Elimination, in ‘Proceedings of the International Symposium on Symbolic and Algebraic Computation’, pp. 223–231.

Melquiond, G. (2008), Proving Bounds on Real-Valued Functions with Computations, in Alessandro Armando; Peter Baumgartner & Gilles Dowek, ed., ‘International Joint Conference on Automated Reasoning IJCAR’, Springer-Verlag, , pp. 2–17.

Menini, C. & Oystaeyen, F. V. (2004), Abstract Algebra: A Comprehensive Treatment, CRC Press.

Moore, R. E. (1979), Methods and Applications of Interval Analysis, SIAM, Philadelphia.

Moore, R. E. (1966), Interval Analysis, Prentice Hall.

Moore, R. E. (1962), ‘Interval Arithmetic and Automatic Error Analysis in Digital Computing’, PhD thesis, Stanford University.

Moore, R. E. (1959), ‘Automatic Error Analysis in Digital Computation'(LMSD-48421), Technical report, Lockheed Missiles and Space Company, Lockheed Corporation, Palo Alto, CA.

Moore, R. E.; Kearfott, R. B. & Cloud, M. J. (2009), Introduction to Interval Analysis, SIAM.

Muller, J.-M.; Brisebarre, N.; Dinechin, F. D.; Jeannerod, C.-P.; Lefevre, V.; Melquiond, G. & Revol, N. (2009), Handbook of Floating-Point Arithmetic, Birkh?user Boston.

Pilz, G. (1983), Near-Rings: The Theory and its Applications, Vol. 23, North-Holland Publishing Company.

Rokne, J. & Ratschek, H. (1984), Computer Methods for the Range of Functions, Ellis Horwood Publications.

Rump, S. M. (1999), INTLAB–INTerval LABoratory, in T. Csendes, ed., ‘Developments in Reliable Computing’, Kluwer Academic Publishers, Dordrecht, pp. 77–104.

Shayer, S. (1965), ‘Interval Arithmetic with Some Applications for Digital Computers'(LMSD-5136512), Technical report, Lockheed Missiles and Space Company, Lockheed Corporation, Palo Alto, CA.

Skolem, T. A. (1920), ‘Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Satze nebst einem Theoreme über dichte Mengen’, Skrifter utgit av Videnskabsselskapet i Kristiania, I. Matematisk-Naturvidenskabelig Klasse No. 4, pp. 1–36, Translated from Norwegian as “Logico-combinatorial investigations on the satisfiability or provability of mathematical propositions: A simplified proof of a theorem by Loewenheim” by Stefan Bauer-Mengelberg..

Sunaga, T. (1958), Theory of an Interval Algebra and its Application to Numerical Analysis, in ‘RAAG Memoirs’, pp. 29–46.

Suppes, P. (1972), Axiomatic Set Theory, Dover Publications, New York.

Tarski, A. (1994), Introduction to Logic and to the Methodology of the Deductive Sciences, Oxford University Press, New York.

Tarski, A. (1951), A Decision Method for Elementary Algebra and Geometry, University of California Press.

Vaananen, J. (2007), Dependence Logic: A New Approach to Independence Friendly Logic, Cambridge University Press.

Wolfram Research, I. (2018), ‘Mathematica, Version 11.3, `Computer Software”, Wolfram Research, Inc., Champaign, Illinois.

Young, R. C. (1931), ‘The Algebra of Many-Valued Quantities’, Mathematische Annalen 104, 260–290.

Heath, T. L., ed. (2009), The Works of Archimedes: Edited in Modern Notation with Introductory Chapters, Cambridge University Press, Cambridge.

Download Full Text

Parametric Intervals: More Reliable or Foundationally Problematic?

Author(s):  Hend Dawood and Yasser Dawood
DOI: 10.5281/zenodo.3234186
Keywords :  Interval mathematics, Classical interval arithmetic, Parametric interval arithmetic, Constrained interval arithmetic, Overestimation-free interval arithmetic, Interval dependency, Functional dependence, Dependency predicate, Interval enclosures, S-semiring, Uncertainty, Reliability 
Cite this article:  Hend Dawood and Yasser Dawood (2019). Parametric Intervals: More Reliable or Foundationally Problematic?. Online Mathematics Journal, 01(03), 37–54. DOI: 10.5281/zenodo.3234186. [BibTeX Export]

Interval arithmetic has been proved to be very subtle, reliable, and most fundamental in addressing uncertainty and imprecision. However, the theory of classical interval arithmetic and all its alternates suffer from algebraic anomalies, and all have difficulties with interval dependency. A theory of interval arithmetic that seems promising is the theory of parametric intervals. The theory of parametric intervals is presented in the literature with the zealous claim that it provides a radical solution to the long-standing dependency problem in the classical interval theory, along with the claim that parametric interval arithmetic, unlike Moore’s classical interval arithmetic, has additive and multiplicative inverse elements, and satisfies the distributive law. So, does the theory of parametric intervals accomplish these very desirable objectives? Here it is argued that it does not.

Amer, M. A. (1989), ‘First Order Logic with Empty Structures’, Studia Logica 48, 169–177.

Barnes, D. W. & Mack, J. M. (1975), An Algebraic Introduction to Mathematical Logic, Springer Verlag.

Boche, R. E. (1963), ‘An Operational Interval Arithmetic”IEEE National Electronics Conference, University of Illinois’, Chicago.

Burkill, J. C. (1924), ‘Functions of Intervals’, Proceedings of the London Mathematical Society 2(1), 275–310.

Chevillard, S.; Joldes, M. & Lauter, C. (2010), Sollya: An Environment for the Development of Numerical Codes, in K. Fukuda; J. van der Hoeven; M. Joswig & N. Takayama, ed., ‘Mathematical Software – ICMS 2010’, Springer, Heidelberg, Germany, pp. 28–31.

Clay, J. R. (1992), Nearrings: Geneses and Applications, Oxford University Press.

Cleary, J. G. (1993), ‘Proving the Existence of Solutions in Logical Arithmetic’, Technical report, University of Waikato, Department of Computer Science, Hamilton, New Zealand.

Cleary, J. G. (1987), ‘Logical Arithmetic’, Future Computing Systems 2(2), 125–149.

Corcoran, J. & Ramnauth, A. (2013), ‘Equality and Identity’, Bulletin of Symbolic Logic 19(3), 255–256.

Dawood, H. (2014), Interval Mathematics as a Potential Weapon against Uncertainty, in S. Chakraverty, ed., ‘Mathematics of Uncertainty Modeling in the Analysis of Engineering and Science Problems’, IGI Global, Hershey, PA, pp. 1–38.

Dawood, H. (2019), ‘On Some Algebraic and Order-Theoretic Aspects of Machine Interval Arithmetic’, Online Mathematics Journal 1(2), 1–13.

Dawood, H. (2018), ‘InCLosure (Interval enCLosure)–A Language and Environment for Reliable Scientific Computing’, Technical report, Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt, InCLosure Support: http://scholar.cu.edu.eg/henddawood/software/InCLosure.

Dawood, H. (2012), ‘Interval Mathematics: Foundations, Algebraic Structures, and Applications’, Master’s thesis, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. (2011), Theories of Interval Arithmetic: Mathematical Foundations and Applications, LAP Lambert Academic Publishing, Saarbrücken.

Dawood, H. & Dawood, Y. (2020), Universal Intervals: Towards a Dependency-Aware Interval Algebra, in S. Chakraverty, ed., ‘Mathematical Methods in Interdisciplinary Sciences’, John Wiley & Sons, Hoboken, New Jersey.

Dawood, H. & Dawood, Y. (2019), ‘A Logical Formalization of the Notion of Interval Dependency: Towards Reliable Intervalizations of Quantifiable Uncertainties’, Online Mathematics Journal 1(3), 15–36.

Dawood, H. & Dawood, Y. (2017), ‘Investigations into a Formalized Theory of Interval Differentiation'(CU-Math-2017-03-IFTID), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2016), ‘Interval Algerbras: A Formalized Treatment'(CU-Math-2016-06-IAFT), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2016), ‘The Form of the Uncertain: On the Mathematical Structures of Uncertainty'(CU-Math-2016-09-FUMSU), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2014), ‘On Some Order-theoretic Aspects of Interval Algebras'(CU-Math-2014-06-OTAIA), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2013), ‘Logical Aspects of Interval Dependency'(CU-Math-2013-03-LAID), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Dawood, Y. (2013), ‘A Dependency-Aware Interval Algebra'(CU-Math-2013-09-DAIA), Technical report, Department of Mathematics, Faculty of Science, Cairo University.

Dawood, H. & Megahed, N. (2019), ‘A Consistent and Categorical Axiomatization of Differentiation Arithmetic Applicable to First and Higher Order Derivatives’, Punjab University Journal of Mathematics 51(11), 77–100.

Dwyer, P. S. (1951), Linear computations, Chapman & Hall, New York.

Elishakoff, I. & Miglis, Y. (2012), ‘Overestimation-Free Computational Version of Interval Analysis’, International Journal for Computational Methods of Engineering Science and Mechanics 13(5), 319–328.

Feferman, S. (2006), What Kind of Logic is Independence-Friendly Logic?, in Randall E. Auxier & Lewis Edwin Hahn, ed., ‘The Philosophy of Jaakko Hintikka’, Open Court Publishing Company, , pp. 453–469.

Fu, C.; Liu, Y. & Xiao, Z. (2019), ‘Interval Differential Evolution with Dimension-Reduction Interval Analysis Method for Uncertain Optimization Problems’, Applied Mathematical Modelling 69, 441–452.

Gardenyes, E.; Mielgo, H. & Trepat, A. (1985), Modal Intervals: Reason and Ground Semantics, in ‘Interval Mathematics’, Springer Verlag, , pp. 27–35.

Gutowski, M. W. (2003), ‘Power and Beauty of Interval Methods’, ArXiv e-prints.

Hansen, E. R. (1975), A Generalized Interval Arithmetic, in ‘Interval Mathematics’, Springer Verlag, , pp. 7–18.

Hayes, N. T. (2009), ‘Introduction to Modal Intervals’, IEEE 1788 Working Group.

Hintikka, J. (1959), ‘Existential Presuppositions and Existential Commitments’, The Journal of Philosophy 56(3), 125–137.

van Hoorn, W. G. & van Rootselaar, B. (1967), ‘Fundamental Notions in the Theory of Seminearrings’, Compositio Mathematica 18(1-2), 65–78.

Committee, I. 1788. (2018), ‘IEEE Standard for Interval Arithmetic (Simplified)’, IEEE Std 1788.1-2017, 1–38.

Committee, I. 1788. (2015), ‘IEEE Standard for Interval Arithmetic’, IEEE Std 1788-2015, 1–97.

Kneusel, R. T. (2015), Numbers and Computers, Springer International Publishing, Switzerland.

Kolev, L. V. (1993), Interval Methods for Circuit Analysis, World Scientific Publishing Company.

Kosheleva, O. & Kreinovich, V. (2019), ‘Physics Need for Interval Uncertainty and How It Explains Why Physical Space Is (at Least) 3-Dimensional'(UTEP-CS-19-05), Technical report, University of Texas at El Paso.

Kreinovich, V. & Shary, S. P. (2016), ‘Interval Methods for Data Fitting Under Uncertainty: A Probabilistic Treatment’, Reliable Computing 23, 105–141.

Kulisch, U. W. (2008), Complete Interval Arithmetic and its Implementation, in ‘Numerical Validation in Current Hardware Architectures: International Dagstuhl Seminar’.

Kulisch, U. W. (2008), Computer Arithmetic and Validity: Theory, Implementation, and Applications, Walter de Gruyter.

Lodwick, W. A. (1999), ‘Constrained Interval Arithmetic'(138), Technical report, University of Colorado at Denver, Center for Computational Mathematics, Denver, USA.

Markov, S. M. (1995), ‘On Directed Interval Arithmetic and its Applications’, Journal of Universal Computer Science 1(7), 514–526.

Melquiond, G. (2008), Proving Bounds on Real-Valued Functions with Computations, in Alessandro Armando; Peter Baumgartner & Gilles Dowek, ed., ‘International Joint Conference on Automated Reasoning IJCAR’, Springer-Verlag, , pp. 2–17.

Moore, R. E. (1959), ‘Automatic Error Analysis in Digital Computation'(LMSD-48421), Technical report, Lockheed Missiles and Space Company, Lockheed Corporation, Palo Alto, CA.

Moore, R. E.; Kearfott, R. B. & Cloud, M. J. (2009), Introduction to Interval Analysis, SIAM.

Mostowski, A. (1951), ‘On the Rules of Proof in the Pure Functional Calculus of the First Order’, The Journal of Symbolic Logic 16(2), 107–111.

Muller, J.-M.; Brisebarre, N.; Dinechin, F. D.; Jeannerod, C.-P.; Lefevre, V.; Melquiond, G. & Revol, N. (2009), Handbook of Floating-Point Arithmetic, Birkh?user Boston.

Piegat, A. & Landowski, M. (2017), ‘Is an Interval the Right Result of Arithmetic Operations on Intervals?’, International Journal of Applied Mathematics and Computer Science 27(3), 575–590.

Pilz, G. (1983), Near-Rings: The Theory and its Applications, Vol. 23, North-Holland Publishing Company.

Quine, W. V. O. (1954), ‘Quantification and the Empty Domain’, The Journal of Symbolic Logic 19(3), 177–179.

Rokne, J. & Ratschek, H. (1984), Computer Methods for the Range of Functions, Ellis Horwood Publications.

Rump, S. M. (1999), INTLAB–INTerval LABoratory, in T. Csendes, ed., ‘Developments in Reliable Computing’, Kluwer Academic Publishers, Dordrecht, pp. 77–104.

Shayer, S. (1965), ‘Interval Arithmetic with Some Applications for Digital Computers'(LMSD-5136512), Technical report, Lockheed Missiles and Space Company, Lockheed Corporation, Palo Alto, CA.

Skolem, T. A. (1920), ‘Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Satze nebst einem Theoreme über dichte Mengen’, Skrifter utgit av Videnskabsselskapet i Kristiania, I. Matematisk-Naturvidenskabelig Klasse No. 4, pp. 1–36, Translated from Norwegian as “Logico-combinatorial investigations on the satisfiability or provability of mathematical propositions: A simplified proof of a theorem by Loewenheim” by Stefan Bauer-Mengelberg..

Sunaga, T. (1958), Theory of an Interval Algebra and its Application to Numerical Analysis, in ‘RAAG Memoirs’, pp. 29–46.

Suppes, P. (1972), Axiomatic Set Theory, Dover Publications, New York.

Tarski, A. (1994), Introduction to Logic and to the Methodology of the Deductive Sciences, Oxford University Press, New York.

Vaananen, J. (2007), Dependence Logic: A New Approach to Independence Friendly Logic, Cambridge University Press.

Young, R. C. (1931), ‘The Algebra of Many-Valued Quantities’, Mathematische Annalen 104, 260–290.

Heath, T. L., ed. (2009), The Works of Archimedes: Edited in Modern Notation with Introductory Chapters, Cambridge University Press, Cambridge.

Download Full Text