Switch to: References

Add citations

You must login to add citations.
  1. On finite approximability of psi-intermediate logics.Wies?aw Dziobiak - 1982 - Studia Logica 41:67.
    The aim of this note is to show (Theorem 1.6) that in each of the cases: = {, }, or {, , }, or {, , } there are uncountably many -intermediate logics which are not finitely approximable. This result together with the results known in literature allow us to conclude (Theorem 2.2) that for each : either all -intermediate logics are finitely approximate or there are uncountably many of them which lack the property.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Some results concerning finite model separability of propositional calculi.Ronald Harrop - 1976 - Studia Logica 35 (2):179 - 189.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Some structure results for propositional calculi.Ronald Harrop - 1965 - Journal of Symbolic Logic 30 (3):271-292.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • The lattice of strengthenings of a strongly finite consequence operation.Wiesław Dziobiak - 1981 - Studia Logica 40 (2):177 - 193.
    First, we prove that the lattice of all structural strengthenings of a given strongly finite consequence operation is both atomic and coatomic, it has finitely many atoms and coatoms, each coatom is strongly finite but atoms are not of this kind — we settle this by constructing a suitable counterexample. Second, we deal with the notions of hereditary: algebraicness, strong finitisticity and finite approximability of a strongly finite consequence operation. Third, we formulate some conditions which tell us when the lattice (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Strong completeness with respect to finite kripke models.Wiesław Dziobiak - 1981 - Studia Logica 40 (3):249-252.
    We prove that each intermediate or normal modal logic is strongly complete with respect to a class of finite Kripke frames iff it is tabular, i.e. the respective variety of pseudo-Boolean or modal algebras, corresponding to it, is generated by a finite algebra.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark