Order:
  1.  16
    Higher-Order Logic.Johan van Benthem & Kees Doets - 1989 - Journal of Symbolic Logic 54 (3):1090-1092.
  2.  5
    Monadic $\Pi^11$-Theories of $\Pi1^1$}-Properties.Kees Doets - 1989 - Notre Dame Journal of Formal Logic 30 (2):224-240.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  29
    Elementary Properties of the Finite Ranks.Anuj Dawar, Kees Doets, Steven Lindell & Scott Weinstein - 1998 - Mathematical Logic Quarterly 44 (3):349-353.
    This note investigates the class of finite initial segments of the cumulative hierarchy of pure sets. We show that this class is first-order definable over the class of finite directed graphs and that this class admits a first-order definable global linear order. We apply this last result to show that FO = FO.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  19
    Axiomatizing Universal Properties of Quantifiers.Kees Doets - 1991 - Journal of Symbolic Logic 56 (3):901-905.
    We axiomatize all quantifier properties which can be expressed by a universal condition on the class of algebras of sets.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  6
    Axiomatizing Universal Properties of Quantifiers.Kees Doets - 1991 - Journal of Symbolic Logic 56 (3):901-905.
    We axiomatize all quantifier properties which can be expressed by a universal condition on the class of algebras of sets.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  6
    Relatives of the Russell Paradox.Kees Doets - 1999 - Mathematical Logic Quarterly 45 (1):73-83.
    A formula ϕ in the one non-logical symbol ϵ with one free variable x is Russell if the sentence Vχ) is logically valid. This note describes a pattern common to the classical examples of Russell formulas, adds a couple of new ones, and constructs many formulas that are near-Russell.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7. The Haskell Road to Logic, Maths and Programming.Kees Doets & J. van Eijck - 2004
     
    Export citation  
     
    Bookmark   1 citation  
  8.  1
    On $N$-Equivalence of Binary Trees.Kees Doets - 1987 - Notre Dame Journal of Formal Logic 28 (2):238-243.
  9.  10
    Uniform Short Proofs for Classical Theorems.Kees Doets - 2001 - Notre Dame Journal of Formal Logic 42 (2):121-127.
    This note exploits back-and-forth characteristics to construct, using a single method, short proofs for ten classics of first-order and modal logic: interpolation theorems, preservation theorems, and Lindström's theorem.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark