# The Complexity of Non-Iterated Probabilistic Justification Logic

```@inproceedings{Kokkinis2016TheCO,
title={The Complexity of Non-Iterated Probabilistic Justification Logic},
author={Ioannis Kokkinis},
booktitle={FoIKS},
year={2016}
}```
• Ioannis Kokkinis
• Published in FoIKS 20 July 2015
• Philosophy, Mathematics, Computer Science
The logic \$\$\mathsf {PJ}\$\$ is a probabilistic logic defined by adding non-iterated probability operators to the basic justification logic \$\$\mathsf {J}\$\$. In this paper we establish upper and lower bounds for the complexity of the derivability problem in the logic \$\$\mathsf {PJ}\$\$. The main result of the paper is that the complexity of the derivability problem in \$\$\mathsf {PJ}\$\$ remains the same as the complexity of the derivability problem in the underlying logic \$\$\mathsf {J}\$\$, which is…
6 Citations
Justification Logic with Confidence
• Philosophy
Stud Logica
• 2020
The justification logic with confidence is constructed, motivation is provided in terms of the notion of confidence deriving recent work by Paul and Quiggin, and axiomatise the semantics of JC to provide a sound and complete semantics.
The complexity of satisfiability in non-iterated and iterated probabilistic logics
• Ioannis Kokkinis
• Mathematics, Philosophy
Annals of Mathematics and Artificial Intelligence
• 2018
Tight complexity bounds are obtained for the satisfiability problem in PL and PPL when L is classical propositional logic or justification logic, which are parameterized in the complexity of satisfiability of conjunctions of positive and negative formulas that have neither a probabilistic nor a classical operator as a top-connective.
Probabilistic Justification Logic
• Philosophy, Mathematics
LFCS
• 2016
A probabilistic justification logic is presented to study rational belief, degrees of belief and justifications, and its satisfiability problem is decidable and it is used to provide a solution to the lottery paradox.
Uncertain Reasoning in Justification Logic
This thesis introduces two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J, and proves soundness and completeness theorems for these logics and establishes decidability procedures.
Justification Logic with Approximate Conditional Probabilities
• Philosophy, Computer Science
LORI
• 2017
A new logic of this kind, \(\mathsf {CPJ}\), is introduced, which extends justification logic and supports non-monotonic reasoning with and about evidences.
Probabilistic justification logic
• Philosophy
J. Log. Comput.
• 2020
A probabilistic justification logic, PPJ, is presented as a framework for uncertain reasoning about rational belief, degrees of belief and justifications and it is established that the satisfiability problem is decidable.

## References

SHOWING 1-10 OF 39 REFERENCES
Probabilistic Justification Logic
• Philosophy, Mathematics
LFCS
• 2016
A probabilistic justification logic is presented to study rational belief, degrees of belief and justifications, and its satisfiability problem is decidable and it is used to provide a solution to the lottery paradox.
Uncertain Reasoning in Justification Logic
This thesis introduces two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J, and proves soundness and completeness theorems for these logics and establishes decidability procedures.
Lower complexity bounds in justification logic
• Philosophy
Ann. Pure Appl. Log.
• 2012
Probability Logics
• Philosophy
Springer International Publishing
• 2016
This introduction gives an overview of some fields of mathematical logic and underlying principles (ω-rule,Lω1ω, nonstandard analysis, admissible sets,modal logics) that are used in the rest of the
On the Complexity of Explicit Modal Logics
The complexity of LP as well as the complexity of explicit counterparts of the modal logics K, D, T, K4, D4 found by V. Brezhnev are studied to find the satisfiability problem for each of them belongs to the class Σ2p of the polynomial hierarchy.
Complexity issues in justification logic
• Philosophy
• 2008
Justification Logic is an emerging field that studies provability, knowledge, and belief via explicit proofs or justifications that are part of the language. There exist many justification logics
NEXP-Completeness and Universal Hardness Results for Justification Logic
This work provides a lower complexity bound for the satisfiability problem of a multi-agent justification logic, and uses a simple modification of the corresponding reduction to prove that satisfiability for all multi- agent justification logics from there is \(\varSigma _2^p\)-hard – given certain reasonable conditions.
Explicit provability and constructive semantics
This paper finds the logic LP of propositions and proofs and shows that Godel's provability calculus is nothing but the forgetful projection of LP, which achievesGodel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which resisted formalization since the early 1930s.
A Logic for Reasoning about Justified Uncertain Beliefs
• Philosophy
IJCAI
• 2015
A possibilistic justification logic is introduced, its syntax and semantics are presented, and its meta-properties, such as soundness, completeness, and realizability are investigated.