Switch to: Citations

Add references

You must login to add references.
  1. Provability with finitely many variables.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Bulletin of Symbolic Logic 8 (3):348-379.
    For every finite n ≥ 4 there is a logically valid sentence φ n with the following properties: φ n contains only 3 variables (each of which occurs many times); φ n contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol): φ n has a proof in first-order logic with equality that contains exactly n variables, but no proof containing only n - 1 variables. This result was first proved using the machinery of (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Nonfinite axiomatizability results for cylindric and relation algebras.Roger D. Maddux - 1989 - Journal of Symbolic Logic 54 (3):951-974.
    The set of equations which use only one variable and hold in all representable relation algebras cannot be derived from any finite set of equations true in all representable relation algebras. Similar results hold for cylindric algebras and for logic with finitely many variables. The main tools are a construction of nonrepresentable one-generated relation algebras, a method for obtaining cylindric algebras from relation algebras, and the use of relation algebras in defining algebraic semantics for first-order logic.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Nonfinitizability of classes of representable polyadic algebras.James S. Johnson - 1969 - Journal of Symbolic Logic 34 (3):344-352.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Nonfinitizability of classes of representable cylindric algebras.J. Donald Monk - 1969 - Journal of Symbolic Logic 34 (3):331-343.
    Download  
     
    Export citation  
     
    Bookmark   34 citations