Switch to: Citations

Add references

You must login to add references.
  1. Algebraization of quantifier logics, an introductory overview.István Németi - 1991 - Studia Logica 50 (3-4):485 - 569.
    This paper is an introduction: in particular, to algebras of relations of various ranks, and in general, to the part of algebraic logic algebraizing quantifier logics. The paper has a survey character, too. The most frequently used algebras like cylindric-, relation-, polyadic-, and quasi-polyadic algebras are carefully introduced and intuitively explained for the nonspecialist. Their variants, connections with logic, abstract model theory, and further algebraic logics are also reviewed. Efforts were made to make the review part relatively comprehensive. In some (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Taming logic.Maarten Marx, Szabolcs Mikul & István Németi - 1995 - Journal of Logic, Language and Information 4 (3):207-226.
    In this paper, we introduce a general technology, calledtaming, for finding well-behaved versions of well-investigated logics. Further, we state completeness, decidability, definability and interpolation results for a multimodal logic, calledarrow logic, with additional operators such as thedifference operator, andgraded modalities. Finally, we give a completeness proof for a strong version of arrow logic.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Taming first-order logic.Szabolcs Mikulás - 1998 - Logic Journal of the IGPL 6 (2):305-316.
    In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable.
    Download  
     
    Export citation  
     
    Bookmark   5 citations