The iota-delta function as an alternative to Boolean formalism

DOI10.1142/S0129054118500120zbMATH Open1385.68024OpenAlexW2801085104MaRDI QIDQ4640341FDOQ4640341

Authors: Luan Carlos de S. M. Ozelim, André L. B. Cavalcante 

Publication date: 17 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118500120

Recommendations

• Representations of Boolean functions
• A new symbolic representation of the basic truth-functions of the propositional calculus
• Representation of Boolean functions by polynomial forms
• scientific article; zbMATH DE number 3877102
• System of transformations of certain representations of Boolean functions

zbMATH Keywords

cellular automataiota-delta functionBoolean universality

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Boolean functions (06E30)

Cites Work

• Title not available (Why is that?)
• Representing Boolean functions as polynomials modulo composite numbers
• On the degree of Boolean functions as real polynomials
• On the iota-delta function: universality in cellular automata's representation
• Continuum versus discrete: a physically interpretable general rule for cellular automata by means of modular arithmetic
• Title not available (Why is that?)

This page was built for publication: The iota-delta function as an alternative to Boolean formalism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640341)