Related papers: Some problems with two axiomatizations of discussi…

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…

Faroldi argues that deontic modals are hyperintensional and thus traditional modal logic cannot provide an appropriate formalization of deontic situations. To overcome this issue, we introduce novel justification logics as hyperintensional…

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

We propose a multi-agent epistemic logic capturing reasoning with degrees of plausibility that agents can assign to a given statement, with $1$ interpreted as "entirely plausible for the agent" and $0$ as "completely implausible" (i.e., the…

Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a…

In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…

Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of…

Dialogue games are two-player logic games between a Proponent who puts forward a logical formula A as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which…

The standard notion of formal theory, in Logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed…

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

The current literature on AI-advised decision making -- involving explainable AI systems advising human decision makers -- presents a series of inconclusive and confounding results. To synthesize these findings, we propose a simple theory…

This article is motivated by the fact that there is a distinction between the descriptions of logical explosion from syntactic and semantic points of view. The discussion is illustrated using the concept of abstract model structures and the…

Possibilistic computation tree Logic (PoCTL) is one kind of branching temporal logic combined with uncertain information in possibility theory, which was introduced in order to cope with the systematic verification on systems with uncertain…

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk,…

We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory. We start by showing that generalizations of existing answer set approaches to preference…

In prior work, we showed that logic programming compilation can be given a proof-theoretic justification for generic abstract logic programming languages, and demonstrated this technique in the case of hereditary Harrop formulas and their…

Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…

In a recent work Foulis and Pulmannov\' a \cite{Foulis2012} studied the logical connectives in lattice effect algebras. In this paper we extend their study and investigate further the logical calculus for which the lattice effect algebras…

We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…