Switch to: References

Add citations

You must login to add citations.
  1. Completeness theorem for topological class models.Radosav Djordjevic, Nebojša Ikodinović & Žarko Mijajlović - 2007 - Archive for Mathematical Logic 46 (1):1-8.
    A topological class logic is an infinitary logic formed by combining a first-order logic with the quantifier symbols O and C. The meaning of a formula closed by quantifier O is that the set defined by the formula is open. Similarly, a formula closed by quantifier C means that the set is closed. The corresponding models are a topological class spaces introduced by Ćirić and Mijajlović (Math Bakanica 1990). The completeness theorem is proved.
    Download  
     
    Export citation  
     
    Bookmark  
  • Completeness theorems for σ–additive probabilistic semantics.Nebojša Ikodinović, Zoran Ognjanović, Aleksandar Perović & Miodrag Rašković - 2020 - Annals of Pure and Applied Logic 171 (4):102755.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A first-order probabilistic logic with approximate conditional probabilities.N. Ikodinovi, M. Ra Kovi, Z. Markovi & Z. Ognjanovi - 2014 - Logic Journal of the IGPL 22 (4):539-564.
    Download  
     
    Export citation  
     
    Bookmark  
  • Sequent calculus for classical logic probabilized.Marija Boričić - 2019 - Archive for Mathematical Logic 58 (1-2):119-136.
    Gentzen’s approach to deductive systems, and Carnap’s and Popper’s treatment of probability in logic were two fruitful ideas that appeared in logic of the mid-twentieth century. By combining these two concepts, the notion of sentence probability, and the deduction relation formalized in the sequent calculus, we introduce the notion of ’probabilized sequent’ \ with the intended meaning that “the probability of truthfulness of \ belongs to the interval [a, b]”. This method makes it possible to define a system of derivations (...)
    Download  
     
    Export citation  
     
    Bookmark