In an earlier paper we have shown that a proposition can have a well-defined probability value, even if its justification consists of an infinite linear chain. In the present paper we demonstrate that the same holds if the justification takes the form of a closed loop. Moreover, in the limit that the size of the loop tends to infinity, the probability value of the justified proposition is always well-defined, whereas this is not always so for the infinite linear chain. This suggests that infinitism sits more comfortably with a coherentist view of justification than with an approach in which justification is portrayed as a linear process.

The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class of Schnorr random reals does not overlap with any of these classes of generic reals, their degrees may. In this paper, we describe the extent to which this is possible for the Turing, weak truth-table, and truth-table degrees and then extend our analysis to the Schnorr random and hyperimmune reals.

Working in ZF+AD alone, we prove that every set of ordinals with cardinality at least Θ can be covered by a set of ordinals in HOD of K(ℝ) of the same cardinality, when there is no inner model with an ℝ-complete measurable cardinal. Here ℝ is the set of reals and Θ is the supremum of the ordinals which are the surjective image of ℝ.

We develop a new method for constructing hyperimmune minimal degrees and construct an ANR degree which is a minimal cover of a minimal degree.

We give a syntactic translation from first-order intuitionistic predicate logic into second-order intuitionistic propositional logic IPC2. The translation covers the full set of logical connectives ∧, ∨, →, ⊥, ∀, and ∃, extending our previous work, which studied the significantly simpler case of the universal-implicational fragment of predicate logic. As corollaries of our approach, we obtain simple proofs of nondefinability of ∃ from the propositional connectives and nondefinability of ∀ from ∃ in the second-order intuitionistic propositional logic. We also show that the ∀-free fragment of IPC2 is undecidable.

If ZFC is consistent, then the collection of countable computably saturated models of ZFC satisfies all of the Multiverse Axioms of Hamkins.

With each superintuitionistic propositional logic L with a disjunction property we associate a set of modal logics the assertoric fragment of which is L. Each formula of these modal logics is interdeducible with a formula representing a set of rules admissible in L. The smallest of these logics contains only formulas representing derivable in L rules while the greatest one contains formulas corresponding to all admissible in L rules. The algebraic semantic for these logics is described.

The present note offers a proof that systems developed by Majkić are actually extensions of intuitionistic logic, and therefore not paraconsistent.