Related papers: Adequate conditionals and Kripke's theory of truth
The supervaluationist approach to fixed-point semantics is, arguably, the most celebrated and studied competitor to the Strong Kleene approach within Kripkean truth. In this paper, we show how to obtain supervaluationist fixed-point…
The paper explores applications of Kripke's theory of truth to semantics for anti-luck epistemology, that is, to subjunctive theories of knowledge. Subjunctive theories put forward modal or subjunctive conditions to rule out knowledge by…
On the basis of elementary thinking about language functioning, a solution of truth paradoxes is given and a corresponding semantics of a truth predicate is founded. It is shown that it is precisely the two-valued description of the maximal…
I show that the logic $\textsf{TJK}^{d+}$, one of the strongest logics currently known to support the naive theory of truth, is obtained from the Kripke semantics for constant domain intuitionistic logic by (i) dropping the requirement that…
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…
We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of…
Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation.…
Questions concerning the proof-theoretic strength of classical versus non-classical theories of truth have received some attention recently. A particularly convenient case study concerns classical and nonclassical axiomatizations of…
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…
In this work we first illustrate the subjective theory of de Finetti. We recall the notion of coherence for both the betting scheme and the penalty criterion, by considering the unconditional and conditional cases. We show the equivalence…
We develop a bottom-up approach to truth-value semantics for classical logic of partial terms based on equality and apply it to prove the conservativity of the addition of partial description and partial selection functions, independently…
We compare the conceptual strength of two axiomatic theories of truth: KF and WKF. The first one has been designed to capture Kripke's fixed-point construction based on Strong Kleene logic. The second one is based on the Weak Kleene…
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…
The purpose of this paper is to introduce justification logics based on conditional logics. We introduce a new family of logics, called conditional justification logics, which incorporates a counterfactual conditional in its language. For…
In the paper, the question whether truth values can be assigned to the propositions before their verification is discussed. To answer this question, a notion of a propositionally noncontextual theory is introduced that in order to explain…
In Outline of a Theory of Truth, Kripke introduces some of the central concepts of the logical study of truth and paradox. He informally defines some of these -- such as groundedness and paradoxicality -- using modal locutions. We introduce…
The primary theme of this investigation is a decision theoretic account of conditional ought statements (e.g., "You ought to do A, if C") that rectifies glaring deficiencies in classical deontic logic. The resulting account forms a sound…
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…
Logic programming has developed as a rich field, built over a logical substratum whose main constituent is a nonclassical form of negation, sometimes coexisting with classical negation. The field has seen the advent of a number of…