Switch to: Citations

Add references

You must login to add references.
  1. A Formalization of Set Theory Without Variables.István Németi - 1988 - American Mathematical Soc..
    Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to (...)
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • Dual Tableaux: Foundations, Methodology, Case Studies.Ewa Orlowska & Joanna Golinska-Pilarek - 2011 - Springer.
    The book presents logical foundations of dual tableaux together with a number of their applications both to logics traditionally dealt with in mathematics and philosophy (such as modal, intuitionistic, relevant, and many-valued logics) and to various applied theories of computational logic (such as temporal reasoning, spatial reasoning, fuzzy-set-based reasoning, rough-set-based reasoning, order-of magnitude reasoning, reasoning about programs, threshold logics, logics of conditional decisions). The distinguishing feature of most of these applications is that the corresponding dual tableaux are built in a (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Tableaux and Dual Tableaux: Transformation of Proofs.Joanna Golińska-Pilarek & Ewa Orłowska - 2007 - Studia Logica 85 (3):283-302.
    We present two proof systems for first-order logic with identity and without function symbols. The first one is an extension of the Rasiowa-Sikorski system with the rules for identity. This system is a validity checker. The rules of this system preserve and reflect validity of disjunctions of their premises and conclusions. The other is a Tableau system, which is an unsatisfiability checker. Its rules preserve and reflect unsatisfiability of conjunctions of their premises and conclusions. We show that the two systems (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Description Logic Handbook.Franz Baader (ed.) - 2003 - Cambridge University Press.
    The Description Logic Handbook covers all aspects of the research in the field of knowledge representation. Written by some of the most prominent researchers in the field, and covering the basic technical material and implementational aspects, it is both a unique reference and a self-study guide.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • (1 other version)On the calculus of relations.Alfred Tarski - 1941 - Journal of Symbolic Logic 6 (3):73-89.
    The logical theory which is called thecalculus of (binary) relations, and which will constitute the subject of this paper, has had a strange and rather capricious line of historical development. Although some scattered remarks regarding the concept of relations are to be found already in the writings of medieval logicians, it is only within the last hundred years that this topic has become the subject of systematic investigation. The first beginnings of the contemporary theory of relations are to be found (...)
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • (2 other versions)A Formalization of Set Theory Without Variables.István Németi - 1990 - Journal of Symbolic Logic 55 (1):350-352.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • (1 other version)On the Calculus of Relations.Alfred Tarski - 1942 - Journal of Symbolic Logic 7 (1):38-38.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Relational interpretation of modal logics.Ewa Orlowska - 1988 - Bulletin of the Section of Logic 17 (1):2-10.
    The purpose of the present paper is to show that modal propositional logics can be interpreted in a logic based on relational calculus. We consider languages with necessity operators [R], where R is an accessibility relation expression representing an element of the algebra of binary relations with operations −,∪,∩, −1 , ◦. The relational logic is based on relational calculus enriched by operations of weakest prespecification and weakest postspecification introduced in Hoare and He Jifeng and investigated in He Jifeng et (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations