7 found
Order:
  1.  11
    First Steps Towards Probabilistic Justification Logic.Ioannis Kokkinis, Petar Maksimović, Zoran Ognjanović & Thomas Studer - 2015 - Logic Journal of the IGPL 23 (4):662-687.
  2.  25
    A P‐Adic Probability Logic.Angelina Ilić‐Stepić, Zoran Ognjanović, Nebojša Ikodinović & Aleksandar Perović - 2012 - Mathematical Logic Quarterly 58 (4-5):263-280.
    In this article we present a p-adic valued probabilistic logic equation image which is a complete and decidable extension of classical propositional logic. The key feature of equation image lies in ability to formally express boundaries of probability values of classical formulas in the field equation image of p-adic numbers via classical connectives and modal-like operators of the form Kr, ρ. Namely, equation image is designed in such a way that the elementary probability sentences Kr, ρα actually do have their (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  20
    A P-Adic Probability Logic.Angelina Illic-Stepic, Zoran Ognjanovic, Nebojsa Ikodinovic & Aleksandar Perovic - 2012 - Mathematical Logic Quarterly 58 (4):263-280.
    In this article we present a p-adic valued probabilistic logic equation image which is a complete and decidable extension of classical propositional logic. The key feature of equation image lies in ability to formally express boundaries of probability values of classical formulas in the field equation image of p-adic numbers via classical connectives and modal-like operators of the form Kr, ρ. Namely, equation image is designed in such a way that the elementary probability sentences Kr, ρα actually do have their (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  28
    Logics for Reasoning About Processes of Thinking with Information Coded by P-Adic Numbers.Angelina Ilić Stepić & Zoran Ognjanović - 2015 - Studia Logica 103 (1):145-174.
    In this paper we present two types of logics and \ ) where certain p-adic functions are associated to propositional formulas. Logics of the former type are p-adic valued probability logics. In each of these logics we use probability formulas K r,ρ α and D ρ α,β which enable us to make sentences of the form “the probability of α belongs to the p-adic ball with the center r and the radius ρ”, and “the p-adic distance between the probabilities of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  7
    Completeness Theorem for Propositional Probabilistic Models Whose Measures Have Only Finite Ranges.Radosav Dordević, Miodrag Rašković & Zoran Ognjanović - 2004 - Archive for Mathematical Logic 43 (4):557-563.
    A propositional logic is defined which in addition to propositional language contains a list of probabilistic operators of the form P ≥s (with the intended meaning ‘‘the probability is at least s’’). The axioms and rules syntactically determine that ranges of probabilities in the corresponding models are always finite. The completeness theorem is proved. It is shown that completeness cannot be generalized to arbitrary theories.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  7
    A Propositional Linear Time Logic with Time Flow Isomorphic to Ω2.Bojan Marinković, Zoran Ognjanović, Dragan Doder & Aleksandar Perović - 2014 - Journal of Applied Logic 12 (2):208-229.
  7.  3
    Probabilistic Logics with Independence and Confirmation.Dragan Doder & Zoran Ognjanović - 2017 - Studia Logica 105 (5):943-969.
    The main goal of this work is to present the proof-theoretical and model-theoretical approaches to probabilistic logics which allow reasoning about independence and probabilistic support. We extend the existing formalisms [14] to obtain several variants of probabilistic logics by adding the operators for independence and confirmation to the syntax. We axiomatize these logics, provide corresponding semantics, prove that the axiomatizations are sound and strongly complete, and discuss decidability issues.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark