Switch to: References

Add citations

You must login to add citations.
  1. Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
    It is shown that all the provably total functions of Basic Arithmetic BA, a theory introduced by Ruitenburg based on Predicate Basic Calculus, are primitive recursive. Along the proof a new kind of primitive recursive realizability to which BA is sound, is introduced. This realizability is similar to Kleene's recursive realizability, except that recursive functions are restricted to primitive recursives.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Binary modal logic and unary modal logic.Dick de Jongh & Fatemeh Shirmohammadzadeh Maleki - forthcoming - Logic Journal of the IGPL.
    Standard unary modal logic and binary modal logic, i.e. modal logic with one binary operator, are shown to be definitional extensions of one another when an additional axiom |$U$| is added to the basic axiomatization of the binary side. This is a strengthening of our previous results. It follows that all unary modal logics extending Classical Modal Logic, in other words all unary modal logics with a neighborhood semantics, can equivalently be seen as binary modal logics. This in particular applies (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Avicenna on Syllogisms Composed of Opposite Premises.Behnam Zolghadr - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 433-442.
    This article is about Avicenna’s account of syllogisms comprising opposite premises. We examine the applications and the truth conditions of these syllogisms. Finally, we discuss the relation between these syllogisms and the principle of non-contradiction.
    Download  
     
    Export citation  
     
    Bookmark