We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Π 2 and Σ 2 hard, and we conjecture it to be complete for second order arithmetic. A statement is constructively true iff it is realized by a constructive function under continuous function realiza...

An arithmetic circuit (McKenzie and Wagner [6]) is a labelled, directed graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this paper, we consider the definability of functions by means of arithmetic circuits. We prove two negative results: the first shows, roughly, that a function is not circuit-definable if it has an infinite r...

The paper considers a generalization of Peano arithmetic, Hilbert arithmetic as the basis world in Pythagorean manner. unifies foundations mathematics (Peano and set theory), physics (quantum mechanics information), philosophical transcendentalism (Husserl’s phenomenology) into formal theory mathematical structure literally following Husserl’s tracе “philosophy rigorous science”. In pathway to ...

Including the range of a rational function over an interval is an important problem in numerical computation. A direct interval arithmetic evaluation of a formula for the function yields in general a superset with an error linear in the width of the interval. Special formulas like the centered forms yield a better approximation with a quadratic error. Alefeld posed the question whether in gener...