Abstract

Just as non-well-founded sets extend the usual sets of ZF, so do root reflexive propositional formulas extends the usual class of Boolean expressions. Though infinitary, these formulas are generated by finite patterns. They possess transition functions instead of truth values and have applications in electric circuit theory.