Switch to: Citations

Add references

You must login to add references.
  1. A theorem on permutations in models.Lars Svenonius - 1959 - Theoria 25 (3):173-178.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Logic with Denumerably Long Formulas and Finite Strings of Quantifiers.Dana Scott, J. W. Addison, Leon Henkin & Alfred Tarski - 1971 - Journal of Symbolic Logic 36 (1):157-158.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Constituents and finite identifiability.Jaakko Hintikka - 1972 - Journal of Philosophical Logic 1 (1):45 - 52.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
    Download  
     
    Export citation  
     
    Bookmark   102 citations  
  • Some Remarks on Infinitely Long Formulas.L. Henkin & Carol R. Karp - 1965 - Journal of Symbolic Logic 30 (1):96-97.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • On the Theory of Definability in First-order Logic.Veikko Rantala - 1973
    Download  
     
    Export citation  
     
    Bookmark   3 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-64dd777598-b9rvg uwo