You are not currently logged in.
Access JSTOR through your library or other institution:
Studia Logica: An International Journal for Symbolic Logic
Vol. 50, No. 2 (1991), pp. 225-239
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015575
Page Count: 15
You can always find the topics here!Topics: Plant roots, Electrical engineering, Boolean data, Mathematical relations, Boolean algebras, Feedback circuits, Headway, Electrical circuits, Mathematical set theory, Bistable circuits
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Studia Logica: An International Journal for Symbolic Logic © 1991 Springer