Switch to: Citations

Add references

You must login to add references.
  1. Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
    Download  
     
    Export citation  
     
    Bookmark   58 citations  
  • (3 other versions)Review: Michael O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Weakly Definable Relations and Special Automata.Michael O. Rabin - 1975 - Journal of Symbolic Logic 40 (4):622-623.
    Download  
     
    Export citation  
     
    Bookmark   4 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-7674574dd6-8q2d6 uwo