Logical feedback

Studia Logica 50 (2):225 - 239 (1991)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370184
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,707
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

3 ( #483,044 of 1,726,249 )

Recent downloads (6 months)

2 ( #289,836 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.