Logic Functions and Equations pp 249-297 | Cite as

# Logic, Arithmetic, and Special Functions

## Abstract

In this chapter we will give an outline of applications of logic functions and equations that are not directly related to the design of hardware. The applications in propositional logic are surely the oldest and reach back to the developments of science in ancient Greece. The names *Boolean Algebra* and *Boolean Ring* have been selected in honor of *George Boole* who wanted to formalize the ideas expressed by texts in natural language and *to calculate* the truth of complex constructions (in order to be precise and more accurate). Naturally we already had to use logic in this sense throughout the book, however, we will go back to an introductory or elementary point of view and show that the knowledge that has been prepared up to now is fully appropriate to solve these problems. There was an enormous development of logic (in a broad mathematical sense) during the last 150 years that resulted in a highly sophisticated and specialized level, however, the propositional calculus is still the foundation of all these developments, and it is still necessary and useful to have a good understanding of these concepts. Binary arithmetic is widely used in computer hardware, control systems, or other electronic devices. In this chapter we will give an outline of binary Mathematics before hardware-related problems will be discussed in more detail. Coding is a unique mapping of arbitrary objects to certain code words. Binary codes can be seen as bridges between many real world areas and logic functions. The code words can be a subset of a given finite set so that changes of one or more bits can be detected or even corrected. The introduced *Specific Normal Form* uniquely expresses a logic function, differs significantly from other known normal forms, and has several remarkable properties. This new normal form is used to find the most complex logic functions and to classify bent functions. Bent functions are logic functions having the largest distance to all linear function which is a useful property for cryptographic applications.

## References

- 31.Rothaus, O.S.: On “Bent” functions. J. Comb. Theory (A)
**20**, 300–305 (1976)CrossRefGoogle Scholar - 39.Steinbach, B.: Adjacency graph of the SNF as source of information. In: Steinbach, B. (ed.) Boolean Problems, Proceedings of the 7th International Workshops on Boolean Problems, IWSBP 7, Sept. 2006, pp. 19–28. Freiberg University of Mining and Technology, Freiberg (2006). ISBN: 978-3-86012-287-7Google Scholar
- 41.Steinbach, B.: Most complex Boolean functions. In: Proceedings Reed-Muller 2007 RM, Oslo, May 2007, pp. 13–23Google Scholar
- 44.Steinbach, B., De Vos, A.: The shape of the SNF as a source of information. In: Steinbach, B. (ed.) Boolean Problems, Proceedings of the 8th International Workshops on Boolean Problems. IWSBP 8, Sept. 2008, pp. 127–136. Freiberg University of Mining and Technology, Freiberg (2008). ISBN: 978-3-86012-346-1Google Scholar
- 47.Steinbach, B., Mishchenko, A.: A special normal form for ESOPs. In: Proceedings of the 5th International Workshop on Application of the Reed-Muller Expansion in Circuit Design, RM, Starkville (Mississippi), Aug. 2001, pp. 66–81Google Scholar
- 51.Steinbach, B., Posthoff, C.: Classes of bent functions identified by specific normal forms and generated using Boolean differential equations. Facta Univ. (Nis). Electr. Eng.
**24**(3), 357–383 (2011)Google Scholar - 52.Steinbach, B., Posthoff, C.: Classification and generation of bent functions. In: Proceedings Reed-Muller 2011 Workshop, RM, Tuusula, May 2011, pp. 81–91Google Scholar
- 57.Steinbach, B., Posthoff, C.: Boolean Differential Equations. Morgan & Claypool Publishers, San Rafael (2013). ISBN: 978-1-6270-5241-2. https://doi.org/10.2200/S00511ED1V01Y201305DCS042 zbMATHGoogle Scholar
- 73.Steinbach, B., Yanchurkin, V., Lukac, M.: On SNF optimization: a functional comparison of methods. In: Proceedings of the 6th International Symposium on Representations and Methodology of Future Computing Technology, RM, Trier, Mar. 2003, pp. 11–18Google Scholar