4 found
Sort by:
  1. Katarzyna Pałasińska (forthcoming). Three-Element Non-Finitely Axiomatizable Matrices and Term-Equivalence. Logic and Logical Philosophy.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Katarzyna Pałasińska (2004). No Matrix Term-Equivalent to Wroński's 3-Element Matrix is Finitely Based. Studia Logica 77 (3):413 - 423.
    Motivated by a question of W. Rautenberg, we prove that any matrix that is term-equivalent to the well-known nonfinitely based matrix of A. Wroski is itself also nonfinitely based.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Katarzyna Pałasińska (2003). Finite Basis Theorem for Filter-Distributive Protoalgebraic Deductive Systems and Strict Universal Horn Classes. Studia Logica 74 (1-2):233 - 273.
    We show that a finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. Equivalently, every protoalgebraic and filter-distributive multidimensional deductive system determined by a finite set of finite matrices can be presented by finitely many axioms and rules.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Katarzyna Pałasińska (1994). Three-Element Nonfinitely Axiomatizable Matrices. Studia Logica 53 (3):361 - 372.
    There are exactly two nonfinitely axiomatizable algebraic matrices with one binary connective o such thatx(yz) is a tautology of . This answers a question asked by W. Rautenberg in [2], P. Wojtylak in [8] and W. Dziobiak in [1]. Since every 2-element matrix can be finitely axiomatized ([3]), the matrices presented here are of the smallest possible size and in some sense are the simplest possible.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation