Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Logical Feedback

David Booth
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
  • Download ($43.95)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Logical Feedback
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
[225]
    [225]
  • Thumbnail: Page 
226
    226
  • Thumbnail: Page 
227
    227
  • Thumbnail: Page 
228
    228
  • Thumbnail: Page 
229
    229
  • Thumbnail: Page 
230
    230
  • Thumbnail: Page 
231
    231
  • Thumbnail: Page 
232
    232
  • Thumbnail: Page 
233
    233
  • Thumbnail: Page 
234
    234
  • Thumbnail: Page 
235
    235
  • Thumbnail: Page 
236
    236
  • Thumbnail: Page 
237
    237
  • Thumbnail: Page 
238
    238
  • Thumbnail: Page 
239
    239