Switch to: References

Add citations

You must login to add citations.
  1. A progression semantics for first-order logic programs.Yi Zhou & Yan Zhang - 2017 - Artificial Intelligence 250 (C):58-79.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
    §0. Introduction. In [16], Barwise described his graduate study at Stanford. He told of his interactions with Kreisel and Scott, and said how he chose Feferman as his advisor. He began working on admissible fragments of infinitary logic after reading and giving seminar talks on two Ph.D. theses which had recently been completed: that of Lopez-Escobar, at Berkeley, on infinitary logic [46], and that of Platek [58], at Stanford, on admissible sets.Barwise's work on infinitary logic and admissible sets is described (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • 1998 European Summer Meeting of the Association for Symbolic Logic.S. Buss - 1999 - Bulletin of Symbolic Logic 5 (1):59-153.
  • On branching quantifiers in English.Jon Barwise - 1979 - Journal of Philosophical Logic 8 (1):47 - 80.
  • Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.