Overview of Finite Propositional Boolean Algebras I

Abstract of monadic or relational predicate calculus (Fa, Gb, Rab, Hcd, etc.). • The Boolean Algebra BL set-up by such a language will be such that: – BL will have 2 n states (corresponding to the state descriptions of L) – BL will contain 2 2n propositions, in total. ∗ This is because each proposition p in BL is equivalent to a disjunction of state descriptions. Thus, each subset of the set of..
Keywords No keywords specified (fix it)
Categories No categories specified (fix it)
Options
 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: 5,679
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries

    Similar books and articles
    Lars Hansen (2005). On an Algebra of Lattice-Valued Logic. Journal of Symbolic Logic 70 (1):282 - 318.

    Analytics

    Monthly downloads

    Added to index

    2011-06-20

    Total downloads

    5 ( #160,368 of 549,088 )

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


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

    Other forums