Switch to: References

Add citations

You must login to add citations.
  1. The logic languages of the TPTP world.Geoff Sutcliffe - 2023 - Logic Journal of the IGPL 31 (6):1153-1169.
    The Thousands of Problems for Theorem Provers (TPTP) World is a well-established infrastructure that supports research, development and deployment of automated theorem proving systems. This paper provides an overview of the logic languages of the TPTP World, from classical first-order form (FOF), through typed FOF, up to typed higher-order form, and beyond to non-classical forms. The logic languages are described in a non-technical way and are illustrated with examples using the TPTP language.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Natural Deduction, Hybrid Systems and Modal Logics.Andrzej Indrzejczak - 2010 - Dordrecht, Netherland: Springer.
    This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis.Yaroslav Petrukhin & Vasilyi Shangin - forthcoming - Logic and Logical Philosophy:1.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A labelled natural deduction system for linear temporal logic.Andrzej Indrzejczak - 2003 - Studia Logica 75 (3):345 - 376.
    The paper is devoted to the concise description of some Natural Deduction System (ND for short) for Linear Temporal Logic. The system's distinctive feature is that it is labelled and analytical. Labels convey necessary semantic information connected with the rules for temporal functors while the analytical character of the rules lets the system work as a decision procedure. It makes it more similar to Labelled Tableau Systems than to standard Natural Deduction. In fact, our solution of linearity representation is rather (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations