Synchronic Bayesian updating and the Sleeping Beauty problem: reply to Pust

I maintain, in defending “thirdism,” that Sleeping Beauty should do Bayesian updating after assigning the “preliminary probability” 1/4 to the statement S: “Today is Tuesday and the coin flip is heads.” (This preliminary probability obtains relative to a specific proper subset I of her available information.) Pust objects that her preliminary probability for S is really zero, because she could not be in an epistemic situation in which S is true. I reply that the impossibility of being in such an epistemic situation is irrelevant, because relative to I, statement S nonetheless has degree of evidential support 1/4.     

Responsibility for believing

Many assume that we can be responsible only what is voluntary. This leads to puzzlement about our responsibility for our beliefs, since beliefs seem not to be voluntary. I argue against the initial assumption, presenting an account of responsibility and of voluntariness according to which, not only is voluntariness not required for responsibility, but the feature which renders an attitude a fundamental object of responsibility (that the attitude embodies one’s take on the world and one’s place in it) also guarantees that it could not be voluntary. It turns out, then, that, for failing to be voluntary, beliefs are a central example of the sort of thing for which we are most fundamentally responsible.     

Interpolation in non-classical logics

We discuss the interpolation property on some important families of non classical logics, such as intuitionistic, modal, fuzzy, and linear logics. A special paragraph is devoted to a generalization of the interpolation property, uniform interpolation. Supported by PRIN project 2006/2007 ‘Large-scale development of certified mathematical proofs’.     

Routes to Triviality

It is known that a number of inference principles can be used to trivialise the axioms of naïve comprehension – the axioms underlying the naïve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naïve comprehension.     

Light Affine Set Theory: A Naive Set Theory of Polynomial Time

In [7], a naive set theory is introduced based on a polynomial time logical system, Light Linear Logic (LLL). Although it is reasonably claimed that the set theory inherits the intrinsically polytime character from the underlying logic LLL, the discussion there is largely informal, and a formal justification of the claim is not provided sufficiently. Moreover, the syntax is quite complicated in that it is based on a non-traditional hybrid sequent calculus which is required for formulating LLL.In this paper, we consider a naive set theory based on Intuitionistic Light Affine Logic (ILAL), a simplification of LLL introduced by [1], and call it Light Affine Set Theory (LAST). The simplicity of LAST allows us to rigorously verify its polytime character. In particular, we prove that a function over {0, 1}* is computable in polynomial time if and only if it is provably total in LAST.     

Products of Modal Logics. Part 3: Products of Modal and Temporal Logics

In this paper we improve the results of [2] by proving the product f.m.p. for the product of minimal n-modal and minimal n-temporal logic. For this case we modify the finite depth method introduced in [1]. The main result is applied to identify new fragments of classical first-order logic and of the equational theory of relation algebras, that are decidable and have the finite model property.     

Completeness of Certain Bimodal Logics for Subset Spaces

Subset Spaces were introduced by L. Moss and R. Parikh in [8]. These spaces model the reasoning about knowledge of changing states.In [2] a kind of subset space called intersection space was considered and the question about the existence of a set of axioms that is complete for the logic of intersection spaces was addressed. In [9] the first author introduced the class of directed spaces and proved that any set of axioms for directed frames also characterizes intersection spaces.We give here a complete axiomatization for directed spaces. We also show that it is not possible to reduce this set of axioms to a finite set.     

A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S5

The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic proofs for modal logics, which is grounded in the logic of questions IEL.     

Taking Degrees of Truth Seriously

This is a contribution to the discussion on the role of truth degrees in manyvalued logics from the perspective of abstract algebraic logic. It starts with some thoughts on the so-called Suszko’s Thesis (that every logic is two-valued) and on the conception of semantics that underlies it, which includes the truth-preserving notion of consequence. The alternative usage of truth values in order to define logics that preserve degrees of truth is presented and discussed. Some recent works studying these in the particular cases of Łukasiewicz’s many-valued logics and of logics associated with varieties of residuated lattices are also presented. Finally the extension of this paradigm to other, more general situations is discussed, highlighting the need for philosophical or applied motivations in the selection of the truth degrees, due both to the interpretation of the idea of truth degree and to some mathematical difficulties.     

Proof Systems for Reasoning about Computation Errors

In the paper we examine the use of non-classical truth values for dealing with computation errors in program specification and validation. In that context, 3-valued McCarthy logic is suitable for handling lazy sequential computation, while 3-valued Kleene logic can be used for reasoning about parallel computation. If we want to be able to deal with both strategies without distinguishing between them, we combine Kleene and McCarthy logics into a logic based on a non-deterministic, 3-valued matrix, incorporating both options as a non-deterministic choice. If the two strategies are to be distinguished, Kleene and McCarthy logics are combined into a logic based on a 4-valued deterministic matrix featuring two kinds of computation errors which correspond to the two computation strategies described above. For the resulting logics, we provide sound and complete calculi of ordinary, two-valued sequents. Presented by Yaroslav Shramko and Heinrich Wansing