We propose the notion of flocks, which formerly were introduced only in based algebras, for any universal algebra. This generalization keeps the main properties we know from vector spaces, e.g. a closure system that extends the subalgebra one. It comes from the idempotent elementary functions, we call "interpolators", that in case of vector spaces merely are linear functions with normalized coefficients.
The main example, we consider outside vector spaces, concerns Boolean algebras,...
To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex. We use a semantic construction to get this extension. This...
Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we "show" that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A minor modification of this standard definition might fix it.
Download Results (CSV)