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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.Aczel, Non-Well-Founded Sets, Center for the Study of Lang. and Information, Palo Alto, 1988.
J.Barwise, The Situation in Logic-IV: On the Model Theory of Common Knowledge, Center for the Study of Lang. an Information, Palo Alto, 1988.
J.Barwise and J.Etchemendy: The Liar: An Essay on Truth and Circularity, Oxford Univ. Press, New York, 1987.
D.Booth, Hereditarily Finite Finsler Sets, J1. Sym. Logic, to appear.
D.Dietmeyer, Logic Design of Digital Systems, Allyn and Bacon, Boston, 1971.
B.Elspas, The Theory of Autonomous Linear Sequential Networks, I.R.E. Trans. on Circuit Theory CT-6, (1959), pp. 45–60.
P.Finsler and G.Unger (ed.), Aufsatze zur Mengentehre, Wissenschaftliche Buchgesellschaft, Darmstadt, 1975.
P.Finsler, Über die Grundlegung der Mengenlehre I, Math. Zeitschrift 25 (1926), pp. 172–218.
D.A.Huffman, The Synthesis of Sequential Switching Circuits, J1. Franklin Inst., 257, (1954). pp. 161–303.
D.Mirimanoff, Les Antinomies de Russell et de Burali-Forti et le probleme foundemental de la theorie des ensembles, L'enseignment Math., 19 (1917), pp. 37–52.
J.P.Roth, Algebraic Topological Methods for the Synthesis of Switching Systems, Trans. A.M.S. 88, (1958), pp. 301–326.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Booth, D. Logical feedback. Stud Logica 50, 225–239 (1991). https://doi.org/10.1007/BF00370184
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370184