Abstract
Boolean and logical hypercubes are discussed as providers of tags to logical object sets, transforming them into logical tagged sets, a generalization of fuzzy sets. The equivalence of Boolean and logical sets permits to consider natural tags as an equivalent basis of logical tagged sets. Boolean hypercube concatenation easily allows studying how Boolean information is transmitted. From there a Gödel-like behavior of Boolean hypercubes and thus of logical object sets can be unveiled. Later, it is discussed the iterative building of natural numbers, considering Mersenne numbers as upper bounds of this kind of recursive construction. From there information acquisition, recursive logic, and artificial intelligence are also examined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
