A tableau-like proof procedure for normal modal logics

AbstractIn this paper a new proof procedure for some propositional and first-order normal modal logics is given. It combines a tableau-like approach and a resolution-like inference. Completeness and decidability for some propositional logics are proved. An extension for the first-order case is presented

A Logic with Kolmogorov Style Conditional Probabilities ⋆

Abstract. In this paper we investigate a probability logic with conditional probability operators. The logic (denoted LP P) allows making statements such as CP≥s(α | β), with the intended meaning ”the conditional probability of α given β is at least s”. Conditional probabilities are P (α∧β) P (β) defined in the usual Kolmogorv style: P (α | β) = , P (β)> 0. A possible-world approach is used to give semantics to probability formulas. An infinitary axiomatic system for our logic is given and the corresponding strong completeness theorem is proved. It is proved that the logic is decidable.

Some probability logics and their applications in computer sciences

Part1. Subjective and objective interpretations of probability are described. The organization of the text is given. Part2. Some propositional probability logics are introduced. Their languages, models, satisfiability relations, and (in)finitary axiomatic systems are given. In this paper the terms finitary and infinitary concern meta language only. Object languages are countable, formulas are finite, while only proofs are allowed to be infinite. Basically, the considered languages are obtained by adding unary probabilistic operators of the form P≥s with the intended meaning “the probability is greater than s”. A Kripke-like possible-world approach to interpret probabilityformulas such that they remain either true or false is proposed. Since the compactness theorem does not hold for some of the considered logics, infinitary axiomatic systems allows proving the corresponding extended completeness theorems. Decidability of the logics is proved using a reduction of the satisfiability problem to the linear programming problem. Part 3. In this part some first order probability logics are considered. In a paper of Abadi and Halpern is proved that there is no recursive axiomatization of these logics, so the presented approach involving infinitary inference rules is the only way to achieve any complete axiomatization. Part 4. New types of probability operators of the form QF, where F is a recursive rational subset of [0, 1] are introduced. A formula QFA is satisfied in a probability model if the measure of the set of worlds that satisfy A is in F. The new operators are suitable for describing events in discrete sample spaces. It is show that the new operators are not definable in languages of probability logics that have been used so far. Part 5. A propositional and a first-order logic for reasoning about discrete linear time and finitely additive probability are given. The languages of these logics allow formulas that say ‘sometime in the future, A holds with probability at least s’. Sound and complete infinitary axiomatizations for the logics are provided. Part 6. In this part a probabilistic extension of modal logic is investigated. It is showed that those logics are closely related, but that modal necessity (denoted by □) is a stronger notion than probability necessity (probability one, P≥1). An example of probability version of Barcan-formula which assures this conclusion is given. Part 7. Decidability of the considered logics is shown by reducing the corresponding satisfiability problem to the linear programming problem. Two automated theorem provers based on that idea are described. Appendix A. This appendix contains the main definitions and formulations of some statements related to probability, Loeb’measure, infinitary logics, and computation complexity. Appendix B. This appendix describes some other approaches in the field: work of Keisler concerning the probabilistic quantifiers, and some other papers about probabilistic operators written by Nilsson, Fagin, Halpern etc

Measures of inconsistency and defaults

AbstractWe introduce a method for measuring inconsistency based on the number of formulas needed for deriving a contradiction. The relationships to previously considered methods based on probability measures are discussed. Those methods are extended to conditional probability and default reasoning

Probabilistic justification logic

We present a probabilistic justification logic, PPJ⁠, as a framework for uncertain reasoning about rational belief, degrees of belief and justifications. We establish soundness and strong completeness for PPJ with respect to the class of so-called measurable Kripke-like models and show that the satisfiability problem is decidable. We discuss how PPJ provides insight into the well-known lottery paradox

Cultural Heritage Digitization in Serbia: Standards, Policies, and Case Studies

The paper identifies necessary steps to create a national information system for management and preservation of cultural heritage documentation. The Republic of Serbia, where the digitization of cultural heritage is recognized as a segment of cultural development and officially accepted as one of the methods for preservation and presentation of heritage documentation, is taken as a case study. The paper describes the evolutionary path of the digitization process in Serbia and analyzes the importance of the adoption of a legal framework and establishment of national standards in the process of achieving the uniqueness in cultural heritage long-term sustainable documentation management and preservation across cultural institutions