We define a finitary model of first-order Peano Arithmetic in which satisfaction and quantification are interpreted constructively in terms of Turing-computability.
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
A new approach to mixed-signal circuit interfacing based on fuzzy logic models is presented. Due to their continuous rather than discrete character, fuzzy logic models offer a sig...
Nearness (a fuzzy nearness) is a fuzzy relation that can be used to model various grades of “being close” in a linear space. We study the uniform convergence of a sequence of ...