The purpose of the present paper is to provide a way of understanding systems of logic of essence by introducing a new semantic framework for them. Three central results are achieved: first, the now standard Fitting semantics for the propositional logic of evidence is adapted in order to provide a new, simplified semantics for the propositional logic of essence; secondly, we show how it is possible to construe the concept of necessary truth explicitly by using the concept of essential truth; (...) finally, Fitting semantics is adapted in order to present a simplified semantics for the quantified logic of essence. (shrink)

After introductory reminder of and comments on Gödel’s ontological proof, we discuss the collapse of modalities, which is provable in Gödel’s ontological system GO. We argue that Gödel’s texts confirm modal collapse as intended consequence of his ontological system. Further, we aim to show that modal collapse properly fits into Gödel’s philosophical views, especially into his ontology of separation and union of force and fact, as well as into his cosmological theory of the nonobjectivity of the lapse of time. As (...) a result, modal collapse should not be conceived in Gödel so much as a deficit, but rather as a kind of the rise of modalities to the “perfect” being. We further show that, in accordance with Gödel’s ontology, the concepts of modality and time should be derived in terms of the “fundamental philosophical concept” of cause. To give an example of how a formalization of such causative Gödelian ontology and ontological proof might look, we propose the transformation of GO into a kind of causally re-interpreted justification logic. (shrink)

LP can be seen as a logic of knowledge with justifications. See [S. Artemov, The logic of justification, The Review of Symbolic Logic 1 477–513] for a recent comprehensive survey of justification logics generally. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikka-style logic of knowledge S4, in which they are not explicitly present. Justifications, however, are far from unique. There are many ways of realizing each theorem of S4 in the logic LP. If (...) the machinery of justifications is to be applied to artificial intelligence, or better yet, to everyday reasoning, we will need to work with whatever justifications we may have at hand—one version may not be interchangeable with another, even though they realize the same S4 formula. In this paper we begin the process of providing tools for reasoning about justifications directly. The tools are somewhat complex, but in retrospect this should not be surprising. Among other things, we provide machinery for combining two realizations of the same formula, and for replacing subformulas by equivalent subformulas. The results are algorithmic in nature—semantics for LP plays no role. We apply our results to provide a new algorithmic proof of Artemov’s Realization Theorem itself. This paper is a much extended version of [M.C. Fitting, Realizations and LP, in: S. Artemov, A. Nerode , Logical Foundations of Computer Science—New York ’07, in: Lecture Notes in Computer Science, vol. 4514, Springer-Verlag, 2007, pp. 212–223]. (shrink)

Justification logics are constructive analogues of modal logics. They are often used as epistemic logics, particularly as models of evidentialist justification. However, in this role, justification (and modal) logics are defective insofar as they represent justification with a necessity-like operator, whereas actual evidentialist justification is usually probabilistic. This paper first examines and rejects extant candidates for solving this problem: Milnikel’s Logic of Uncertain Justifications, Ghari’s Hájek–Pavelka-Style Justification Logics and a version of probabilistic justification logic developed by Kokkinis et al. It (...) then proposes a new solution to the problem in the form of a justification logic that incorporates the essential features of both a fuzzy logic and a probabilistic logic. (shrink)

The paper proposes a logical framework representing the notion of explicit knowledge as the combination of awareness of and awareness that. The setting, semantically combining neighbourhood models with ideas from awareness logic, separates the mere fact of entertaining some information (being aware of $\varphi$) from the acknowledgement that the information is indeed the case (being aware that $\varphi$ holds). The text discusses not only the main properties these concepts obtain under the given representation, but also several of the epistemic actions (...) that can be defined, and the way they affect the agent’s awareness (and thus her knowledge). (shrink)

Justification logics provide frameworks for studying the fine structure of evidence and justification. Traditionally, these logics do not impose any closure requirements on justification. In this paper, we argue that for some applications they should subject justification to closure under some variety of logical consequence. Specifically, we argue, building on ideas from Beall, that the non-classical logic FDE offers a particularly attractive notion of consequence for this purpose and define a justification logic where justification is closed under FDE consequence. We (...) show the resulting logic to be sound and complete. Lastly, we discuss how the closure of justification under FDE ontrasts closure under related non-classical logics and how our approach contrasts with some alternatives. (shrink)

We combine linear temporal logic (with both past and future modalities) with a deontic version of justification logic to provide a framework for reasoning about time and epistemic and normative reasons. In addition to temporal modalities, the resulting logic contains two kinds of justification assertions: epistemic justification assertions and deontic justification assertions. The former presents justification for the agent’s knowledge and the latter gives reasons for why a proposition is obligatory. We present two kinds of semantics for the logic: one (...) based on Fitting models and the other based on neighborhood models. The use of neighborhood semantics enables us to define the dual of deontic justification assertions properly, which corresponds to a notion of permission in deontic logic. We then establish the soundness and completeness of an axiom system of the logic with respect to these semantics. Further, we formalize the Protagoras versus Euathlus paradox in this logic and present a precise analysis of the paradox, and also briefly discuss Leibniz’s solution. (shrink)

Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...) dynamical scenario. These are preliminaries results of a wider project on Paraconsistent Belief Change conduced by the authors. (shrink)

Arguments have always played a central role within logic and philosophy. But little attention has been paid to arguments as a distinctive kind of discourse, with its own semantics and pragmatics. The goal of this essay is to study the mechanisms by means of which we make arguments in discourse, starting from the semantics of argument connectives such as `therefore'. While some proposals have been made in the literature, they fail to account for the distinctive anaphoric behavior of `therefore', as (...) well as uses of argument connectives in complex arguments, suppositional arguments, arguments with non-declarative conclusions, as well as arguments with parenthetical remarks. A comprehensive account of arguments requires imposing a distinctive tree-like structure on contexts. We show how to extend our account to accommodate modal subordination and and di fferent flavors of `therefore'. (shrink)

When we say “I know why he was late”, we know not only the fact that he was late, but also an explanation of this fact. We propose a logical framework of “knowing why” inspired by the existing formal studies on why-questions, scientific explanation, and justification logic. We introduce the Kyi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {K}}{}\textit{y}}_i$$\end{document} operator into the language of epistemic logic to express “agent i knows why φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document}” and propose a Kripke-style semantics of such expressions in terms of knowing an explanation of φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document}. We obtain two sound and complete axiomatizations w.r.t. two different model classes depending on different assumptions about introspection. Finally we connect our logic with justification logic technically by providing an alternative semantics and an in-depth comparison on various design choices. (shrink)

Rosenkranz has recently proposed a logic for propositional, non-factive, all-things-considered justification, which is based on a logic for the notion of being in a position to know, 309–338 2018). Starting from three quite weak assumptions in addition to some of the core principles that are already accepted by Rosenkranz, I prove that, if one has positive introspective and modally robust knowledge of the axioms of minimal arithmetic, then one is in a position to know that a sentence is not provable (...) in minimal arithmetic or that the negation of that sentence is not provable in minimal arithmetic. This serves as the formal background for an example that calls into question the correctness of Rosenkranz’s logic of justification. (shrink)

Abductive problems and their solutions are presented by means of justification logic. We introduce additional meta-constructions in order to generate and compare different solutions to the same abductive problem. Our approach has three advantages: (i) it makes structurally explicit the solution to an abductive problem (as it has a syntactic nature); (ii) it gives a precise meaning to the notion of evidence; (iii) it provides clear definitions and procedures for the comparison of solutions that can be adapted to different needs.

Nous proposons une logique épistémique quadrivalente AR4.

The present paper wants to promote epistemic pluralism as an alternative view of non-classical logics. For this purpose, a bilateralist logic of acceptance and rejection is developed in order to make an important di erence between several concepts of epistemology, including information and justi cation. Moreover, the notion of disagreement corresponds to a set of epistemic oppositions between agents. The result is a non-standard theory of opposition for many-valued logics, rendering total and partial disagreement in terms of epistemic negation and (...) semi-negations. (shrink)

This paper explores the relationship between dynamic and truth conditional semantics for epistemic modals. It provides a generalization of a standard dynamic update semantics for modals. This new semantics derives a Kripke semantics for modals and a standard dynamic semantics for modals as special cases. The semantics allows for new characterizations of a variety of principles in modal logic, including the inconsistency of ‘p and might not p’. Finally, the semantics provides a construction procedure for transforming any truth conditional semantics (...) for modals into a dynamic semantics for modals with similar properties. (shrink)

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics. The behavior and interaction of agents in distributed system is often modeled using logics of knowledge and time. In this paper, we sketch some preliminary ideas on how the modal knowledge part of such logics of knowledge and time could be replaced with an appropriate justification logic.

The concept of knowledge can be modelled in epistemic modal logic and, if modelled by using a standard modal operator, it is subject to the problem of logical omniscience. The classical solution to this problem is to distinguish between implicit and explicit knowledge and to construe the knowledge operator as capturing the concept of implicit knowledge. In addition, since a proposition is said to be implicitly known just in case it is derivable from the set of propositions that are explicitly (...) known by using a certain set of logical rules, the concept of implicit knowledge is definable on the basis of the concept of explicit knowledge. In any case, both implicit and explicit knowledge are typically characterized as factive, i.e. such that it is always the case that what is known is also true. The aim of the present paper is twofold: first, we will develop a dynamic system of explicit intersubjective knowledge that allows us to introduce the operator of implicit knowledge by definition; secondly, we will show that it is not possible to hold together the following two theses: (1) the concept of implicit knowledge is definable along the lines indicated above and (2) the concept of implicit knowledge is factive. (shrink)

Justification logics provide a framework for reasoning about justifications and evidence. In this article, we study a fuzzy variant of justification logics in which an agent’s justification for a belief has certainty degree between 0 and 1. We replace the classical base of justification logics with Hájek’s rational Pavelka logic. We introduce fuzzy possible world semantics with crisp accessibility relation and also single world models for our logics. We establish soundness and graded-style completeness for both kinds of semantics. We also (...) introduce extensions with product conjunction. Finally, we offer a solution to a variant of the sorites paradox in our fuzzy justification logics. (shrink)

The logic of justification provides an in-depth analysis of the epistemic states of an agent. This paper aims at solving some of the problems to which the common interpretation of the operators of justification logic is subject by providing a framework in which a crucial distinction between potential and explicit justifiers is exploited. The paper is subdivided into three sections. The first section offers an introduction to a basic system LJ of justification logic and to the problems concerning its interpretation. (...) In the second section, three new systems of justification logic are introduced and characterised with respect to an appropriate semantics. The final section shows why the highlighted problems do not afflict the new systems and how it is possible to interpret LJ in the new framework. (shrink)

Gödel's ontological argument is related to Gödel's view that causality is the fundamental concept in philosophy. This explicit philosophical intention is developed in the form of an onto-theological Gödelian system based on justification logic. An essentially richer language, so extended, offers the possibility to express new philosophical content. In particular, theorems on the existence of a universal cause on a causal "slingshot" are formulated.

The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics with distributive substructural logics. Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is also shown that the framework presents a natural solution to the problem of logical omniscience.

The paper explains how Gettier’s conclusion can be reached on general theoretical grounds within the framework of epistemic logic, without reliance on thought experiments. It extends the argument to permissive conceptions of justification that invalidate principles of multi-premise closure and require neighbourhood semantics rather than semantics of a more standard type. The paper concludes by recommending a robust methodology that aims at convergence in results between thought experimentation and more formal methods. It also warns against conjunctive definitions as sharing several (...) of the drawbacks of disjunctive definitions. (shrink)

We present a complete, decidable logic for reasoning about a notion of completely trustworthy evidence and its relations to justifiable belief and knowledge, as well as to their explicit justifications. This logic makes use of a number of evidence-related notions such as availability, admissibility, and “goodness” of a piece of evidence, and is based on an innovative modification of the Fitting semantics for Artemovʼs Justification Logic designed to preempt Gettier-type counterexamples. We combine this with ideas from belief revision and awareness (...) logics to provide an account for explicitly justified knowledge based on conclusive evidence that addresses the problem of omniscience. (shrink)

Internalization is a key property of justification logics. It states that justification logics internalize their own notion of proof which is essential for the proof of the realization theorem. The aim of this note is to show how to make use of internalization to track where an agent’s knowledge comes from and how to apply this to the problem of data privacy.

Justification Logic provides an axiomatic description of justifications and delegates the question of their nature to semantics. In this note, we address the conceptual issue of the logical type of justifications: we argue that justifications in the logical setting are naturally interpreted as sets of formulas which leads to a class of epistemic models that we call modular models . We show that Fitting models for Justification Logic naturally encode modular models and can be regarded as convenient pre-models of the (...) former. (shrink)

Epistemic logic is the logic of knowledge and belief. It provides insight into the properties of individual knowers, has provided a means to model complicated scenarios involving groups of knowers and has improved our understanding of the dynamics of inquiry.

We present a neighbourhood-style semantic framework for modal epistemic logic modelling agents who process information using relevant logic. The distinguishing feature of the framework in comparison to relevant modal logic is that the environment the agent is situated in is assumed to be a classical possible world. This framework generates two-layered logics combining classical logic on the propositional level with relevant logic in the scope of modal operators. Our main technical result is a general soundness and completeness theorem.

Recent logic and linguistic literature suggest that certain forms of denial cannot be reduced to a simple assertion of negation. In particular, the existence of mathematical and empirical conjectures offers a basis for refuting Frege’s thesis of equivalence between denial and assertion of negation. Following this line of thought we develop a formal framework with two primitive illocutionary operators for assertion and denial, where denial is not a simple negation of assertion. We introduce a semantics for the operators mentioned above. (...) Finally, we discuss the relations between asserted and denied contents. (shrink)

In this paper, we build on earlier work by Standefer (Logic J IGPL 27(4):543–569, 2019) in investigating extensions of substructural logics, particularly relevant logics, with the machinery of justification logics. We strengthen a negative result from the earlier work showing a limitation with the canonical model method of proving completeness. We then show how to enrich the language with an additional operator for implicit commitment to circumvent these problems. We then extend the logics with axioms for D, 4, and 5, (...) which requires additional justification term operators, following the work of Pacuit (in proceedings of the fifth panhellenic logic symposium, 2005) and Rubtsova (in Grigoriev D, Harrison J (eds) Computer science—theory and applications, CSR 2006; J Logic Comput 16(5):671–684, 2006), and present the required modifications to the frame semantics. We present a simplification of the neighborhood frames from the earlier work and we close by investigating the distinctive contribution of the + operator to the logic. (shrink)

This volume is a collation of original contributions from the key actors of a new trend in the contemporary theory of knowledge and belief, that we call “dynamic epistemology”. It brings the works of these researchers under a single umbrella by highlighting the coherence of their current themes, and by establishing connections between topics that, up until now, have been investigated independently. It also illustrates how the new analytical toolbox unveils questions about the theory of knowledge, belief, preference, action, and (...) rationality, in a number of central axes in dynamic epistemology: temporal, social, probabilistic and even deontic dynamics. (shrink)

In this paper, we present a new semantic challenge to the moral error theory. Its first component calls upon moral error theorists to deliver a deontic semantics that is consistent with the error-theoretic denial of moral truths by returning the truth-value false to all moral deontic sentences. We call this the ‘consistency challenge’ to the moral error theory. Its second component demands that error theorists explain in which way moral deontic assertions can be seen to differ in meaning despite necessarily (...) sharing the same intension. We call this the ‘triviality challenge’ to the moral error theory. Error theorists can either meet the consistency challenge or the triviality challenge, we argue, but are hard pressed to meet both. (shrink)

Sarah Moss’ thesis that we have probabilistic knowledge is from some perspectives unsurprising and from other perspectives hard to make sense of. The thesis is potentially transformative, but not yet elaborated in sufficient detail for epistemologists. This paper interprets Mossean probabilistic knowledge in a suitably-modified Kripke framework, thus filling in key details. It argues that probabilistic knowledge looks natural and plausible when so interpreted, and shows how the most pressing challenges to the thesis can be overcome. Most importantly, probabilistic knowledge (...) can satisfy factivity in the framework, though we are not forced to accept a specific account of probabilistic “facts”. The framework also reflects Moss’ claim that old-fashioned propositional knowledge is just a limiting case of probabilistic knowledge, and all knowledge is fundamentally probabilistic. Finally, Moss endorses a failure of contraposition: for example, p implies probably p, but not probably p does not imply not p. The framework makes clear the sense in which the valid inferences regarding probably p are as Moss claims. (shrink)

Scientists collect evidence in order to confirm or falsify scientific theories. Unfortunately, scientific evidence may sometimes be false or deceiving and as a consequence lead individuals to believe in a false theory. By interaction between scientists, such false beliefs may spread through the entire community. There is currently a debate about the effect of various network configurations on the epistemic reliability of scientific communities. To contribute to this debate from a logical perspective, this paper introduces an epistemic logical framework of (...) observation, interaction and belief revision in scientific communities. The presented sound and complete system provides the formal tools for qualitative analysis of the social dynamics of scientific inquiry. Furthermore, this paper includes detailed suggestions for future applications of the framework. (shrink)

In this paper, we propose a decidable single-agent modal logic for reasoning about goal-directed “knowing how”, based on ideas from linguistics, philosophy, modal logic, and automated planning in AI. We first define a modal language to express “I know how to guarantee \ given \” with a semantics based not on standard epistemic models but on labeled transition systems that represent the agent’s knowledge of his own abilities. The semantics is inspired by conformant planning in AI. A sound and complete (...) proof system is given to capture valid reasoning patterns, which highlights the compositional nature of “knowing how”. The logical language is further extended to handle knowing how to achieve a goal while maintaining other conditions. (shrink)

The aim of this paper is to provide an intuitive semantics for systems of justification logic which allows us to cope with the distinction between implicit and explicit justifiers. The paper is subdivided into three sections. In the first one, the distinction between implicit and explicit justifiers is presented and connected with a proof-theoretic distinction between two ways of interpreting sequences of sentences; that is, as sequences of axioms in a certain set and as sequences proofs constructed from that set (...) of axioms. In the second section, a basic system of justification logic for implicit and explicit justifiers is analyzed and some significant facts about it are proved. In the final section, an adequate semantics is proposed, and the system is proved to be sound and complete whit respect to it. (shrink)

Two kinds of justification logics are studied. Then, this article shows how the notion of quasi-truth can be defined in these systems.

We study arbitrary intermediate propositional logics extended with a collection of axioms from justification logics. For these, we introduce various semantics by combining either Heyting algebras or Kripke frames with the usual semantic machinery used by Mkrtychev’s, Fitting’s or Lehmann and Studer’s models for classical justification logics. We prove unified completeness theorems for all intermediate justification logics and their corresponding semantics using a respective propositional completeness theorem of the underlying intermediate logic. Further, by a modification of a method of Fitting, (...) we prove unified realization theorems for a large class of intermediate justification logics and accompanying intermediate modal logics. (shrink)

This manuscript presents a topological argumentation framework for modelling notions of evidence-based (i.e., justified) belief. Our framework relies on so-called topological evidence models to represent the pieces of evidence that an agent has at her disposal, and it uses abstract argumentation theory to select the pieces of evidence that the agent will use to define her beliefs. The tools from abstract argumentation theory allow us to model agents who make decisions in the presence of contradictory information. Thanks to this, it (...) is possible to define two new notions of beliefs, grounded beliefs and fully grounded beliefs. These notions are discussed in this paper, analysed and compared with the existing notion of topological justified belief. This comparison revolves around three main issues: closure under conjunction introduction, the level of consistency and their logical strength. (shrink)

The main objective of this paper is to define a logic for reasoning about distributed time-stamped claims. Such a logic is interesting for theoretical reasons, i.e. as a logic per se, but also because it has a number of practical applications, in particular when one needs to reason about a huge amount of pieces of evidence collected from different sources, where some of the pieces of evidence may be contradictory and some sources are considered to be more trustworthy than others. (...) We introduce the time-stamped claim logic including a sound and complete sequent calculus. In order to show how time-stamped claim logic can be used in practice, we consider a concrete cyber-attribution case study. (shrink)

The purpose of this paper is to present a formalization of the language, semantics and axiomatization of justification logic in Coq. We present proofs in a natural deduction style derived from the axiomatic approach of justification logic. Additionally, we present possible world semantics in Coq based on Fitting models to formalize the semantic satisfaction of formulas. As an important result, with this implementation, it is possible to give a proof of soundness for $\mathsf{L}\mathsf{P}$ with respect to Fitting models.

This paper reviews the central points and presents some recent developments of the epistemic approach to paraconsistency in terms of the preservation of evidence. Two formal systems are surveyed, the basic logic of evidence (BLE) and the logic of evidence and truth (LET J ), designed to deal, respectively, with evidence and with evidence and truth. While BLE is equivalent to Nelson’s logic N4, it has been conceived for a different purpose. Adequate valuation semantics that provide decidability are given for (...) both BLE and LET J . The meanings of the connectives of BLE and LET J , from the point of view of preservation of evidence, is explained with the aid of an inferential semantics. A formalization of the notion of evidence for BLE as proposed by M. Fitting is also reviewed here. As a novel result, the paper shows that LET J is semantically characterized through the so-called Fidel structures. Some opportunities for further research are also discussed. (shrink)

Modal logic S5 is commonly viewed as an epistemic logic that captures the most basic properties of knowledge. Kripke proved a completeness theorem for the first-order modal logic S5 with respect to a possible worlds semantics. A multiagent version of the propositional S5 as well as a version of the propositional S5 that describes properties of distributed knowledge in multiagent systems has also been previously studied. This article proposes a version of S5-like epistemic logic of distributed knowledge with quantifiers ranging (...) over the set of agents, and proves its soundness and completeness with respect to a Kripke semantics. (shrink)

In this paper, we explore the relation between an agent’s doxastic attitude and her arguments in support of a given claim. Our main contribution is the design of a logical setting that allows us reason about binary arguments which are either in favour or against a certain claim. This is a setting in which arguments and propositions are the basic building blocks so that the concept of argument-based belief emerges in a straightforward way. We work against the background of Dung’s (...) abstract argumentation framework, extending it to a new setting in which we can study the formal properties of binary arguments as well as the larger structures they establish. This paper introduces a formal ‘two-dimensional’ language to talk about propositions and arguments, for which a sound and complete axiom system is provided. (shrink)

We outline an intuitionistic view of knowledge which maintains the original Brouwer–Heyting–Kolmogorov semantics for intuitionism and is consistent with the well-known approach that intuitionistic knowledge be regarded as the result of verification. We argue that on this view coreflectionA→KAis valid and the factivity of knowledge holds in the formKA→ ¬¬A‘known propositions cannot be false’.We show that the traditional form of factivityKA→Ais a distinctly classical principle which, liketertium non datur A∨ ¬A, does not hold intuitionistically, but, along with the whole of (...) classical epistemic logic, is intuitionistically valid in its double negation form ¬¬(KA¬A).Within the intuitionistic epistemic framework the knowability paradox is resolved in a constructive manner. We argue that this paradox is the result of an unwarranted classical reading of constructive principles and as such does not have the consequences for constructive foundations traditionally attributed it. (shrink)

Justification logics are modal-like logics that provide a framework for reasoning about justifications. This paper introduces labeled sequent calculi for justification logics, as well as for combined modal-justification logics. Using a method due to Sara Negri, we internalize the Kripke-style semantics of justification and modal-justification logics, known as Fitting models, within the syntax of the sequent calculus to produce labeled sequent calculi. We show that all rules of these systems are invertible and the structural rules (weakening and contraction) and the (...) cut rule are admissible. Soundness and completeness are established as well. The analyticity for some of our labeled sequent calculi are shown by proving that they enjoy the subformula, sublabel and subterm properties. We also present an analytic labeled sequent calculus for S4LPN based on Artemov–Fitting models. (shrink)

In Artemovʼs Justification Logic, one can make statements interpreted as “t is evidence for the truth of formula F.” We propose a variant of this logic in which one can say “I have degree r of confidence that t is evidence for the truth of formula F.” After defining both an axiomatic approach and a semantics for this Logic of Uncertain Justifications, we will prove the usual soundness and completeness theorems.