Switch to: Citations

Add references

You must login to add references.
  1. Complete Propositional Connectives.Roger F. Wheeler - 1961 - Mathematical Logic Quarterly 7 (11-14):185-198.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The determination of all Sheffer functions in $3$-valued logic, using a logical computer. [REVIEW]Eric Foxley - 1962 - Notre Dame Journal of Formal Logic 3 (1):41-50.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Complete Propositional Connectives.Roger F. Wheeler - 1961 - Mathematical Logic Quarterly 7 (11‐14):185-198.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An Asymptotic Formula for the Number of Complete Propositional Connectives.Roger F. Wheeler - 1962 - Mathematical Logic Quarterly 8 (1):1-4.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An Asymptotic Formula for the Number of Complete Propositional Connectives.Roger F. Wheeler - 1962 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (1):1-4.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Many-valued Logics.Leonard Goddard - 1954 - Philosophical Quarterly 4 (15):188-189.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-c4c498947-z4tjs uwo