A Complete Boolean Algebra without Homogeneous or Rigid Factors.
We give a complete characterization of the class of functions that are the intensional behaviours of primitive recursive (PR) algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers.
A family is constructed of cardinality equal to the continuum, whose members are totally incomparable hereditarily indecomposable Banach spaces.
Any given increasing function is completely determined by its contour lines. In this paper we show how each individual uninorm property can be translated into a property of contour lines. In particular, we describe commutativity in terms of orthosymmetry and we link associativity to the portation law and the exchange principle. Contrapositivity and rotation invariance are used to characterize uninorms that have a continuous contour line.