Electronic Resource
Springer
Studia logica
50 (1991), S. 225-239
ISSN:
1572-8730
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Philosophy
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00370184
Permalink
|
Location |
Call Number |
Expected |
Availability |