In this paper, we introduce a system of nonstandard second-order arithmetic $\mathsf{ns}$-$\mathsf{WWKL_0}$ which consists of $\mathsf{ns}$-$\mathsf{BASIC}$ plus Loeb measure property. Then we show that $\mathsf{ns}$-$\mathsf{WWKL_0}$ is a conservative extension of $\mathsf{WWKL_0}$ and we do Reverse Mathematics for this system.

We introduce an operator to represent the simple notion of being wrong. Read Wp to mean: the agent is wrong about p. Being wrong about p means believing p though p is false. We add this operator to the language of propositional logic and study it. We introduce a canonical model for logics of being wrong, show completeness for the minimal logic of being wrong and various other systems. En route we examine the expressiveness of the language. In conclusion, we discuss an open question regarding K4.

In this paper we prove that the field of Logarithmic-Exponential power series endowed with the exponential function and a class of analytic functions containing both the overconvergent functions in the t-adic norm and the usual strictly convergent power series is o-minimal.

We study the notion of dp-minimality, beginning by providing several essential facts about dp-minimality, establishing several equivalent definitions for dp-minimality, and comparing dp-minimality to other minimality notions. The majority of the rest of the paper is dedicated to examples. We establish via a simple proof that any weakly o-minimal theory is dp-minimal and then give an example of a weakly o-minimal group not obtained by adding traces of externally definable sets. Next we give an example of a divisible ordered Abelian group which is dp-minimal and not weakly o-minimal. Finally we establish that the field of p-adic numbers is dp-minimal.

The block relation B(x,y) in a linear order is satisfied by elements that are finitely far apart; a block is an equivalence class under this relation. We show that every computable linear order with dense condensation-type (i.e., a dense collection of blocks) but no infinite, strongly η-like interval (i.e., with all blocks of size less than some fixed, finite k) has a computable copy with the nonblock relation ¬B(x,y) computably enumerable. This implies that every computable linear order has a computable copy with a computable nontrivial self-embedding and that the long-standing conjecture characterizing those computable linear orders every computable copy of which has a computable nontrivial self-embedding (as precisely those that contain an infinite, strongly η-like interval) holds for all linear orders with dense condensation-type.

Suppose $D$ is an ultrafilter on $\kappa$ and $\lambda^\kappa = \lambda$. We prove that if ${\bf B}_i$ is a Boolean algebra for every $i < \kappa$ and $\lambda$ bounds the depth of every ${\bf B}_i$, then the depth of the ultraproduct of the ${\bf B}_i$'s mod $D$ is bounded by $\lambda^+$. We also show that for singular cardinals with small cofinality, there is no gap at all. This gives a partial answer to a previous problem raised by Monk.

We discuss automorphisms of saturated models of PA and boundedly saturated models of PA. We show that Smoryński's Lemma and Kaye's Theorem are not only true for countable recursively saturated models of PA but also true for all boundedly saturated models of PA with slight modifications.

Which abstraction principles are acceptable? A variety of criteria have been proposed, in particular irenicity, stability, conservativeness, and unboundedness. This note charts their logical relations. This answers some open questions and corrects some old answers.