Ramsey-type graph coloring and diagonal non-computability

A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions play a central role in algorithmic randomness and reverse mathematics. Flood and Towsner asked for which functions h, the principle stating the existence of an h-bounded d.n.c. function (DNR_h) implies the Ramsey-type K\"onig's lemma (RWKL). In this paper, we prove that for every computable order h, there exists an~$\omega$-model of DNR_h which is not a not model of the Ramsey-type graph coloring principle for two colors (RCOLOR2) and therefore not a model of RWKL. The proof combines bushy tree forcing and a technique introduced by Lerman, Solomon and Towsner to transform a computable non-reducibility into a separation over omega-models.Comment: 18 page

Sub-computable Boundedness Randomness

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for PSPACE functions. These new notions are robust in that there are equivalent formulations in terms of (1) Martin-L\"of tests, (2) Kolmogorov complexity, and (3) martingales. We show these notions can be equivalently defined with prefix-free Kolmogorov complexity. We prove that one direction of van Lambalgen's theorem holds for relative computability, but the other direction fails. We discuss statistical properties of these notions of randomness

On New Notions of Algorithmic Dimension, Immunity, and Medvedev Degree

Ph.D

Asymptotic density and the coarse computability bound

For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is coarsely computable at density } r\}$. We study the interactions of these concepts with Turing reducibility. For example, we show that if $r \in (0,1]$ there are sets $A_0, A_1$ such that $\gamma(A_0) = \gamma(A_1) = r$ where $A_0$ is coarsely computable at density $r$ while $A_1$ is not coarsely computable at density $r$. We show that a real $r \in [0,1]$ is equal to $\gamma(A)$ for some c.e.\ set $A$ if and only if $r$ is left-$\Sigma^0_3$. A surprising result is that if $G$ is a $\Delta^0_2$ $1$-generic set, and $A \leq\sub{T} G$ with $\gamma(A) = 1$, then $A$ is coarsely computable at density $1$

Computability Theory

Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science

Epistemic Modality, Mind, and Mathematics

This book concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality relates to the computational theory of mind; metaphysical modality; the types of mathematical modality; to the epistemic status of large cardinal axioms, undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal profile of rational intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. Chapter \textbf{3} provides an abstraction principle for epistemic intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states, by contrast to availing of modal axiom 4 (i.e. the KK principle). Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's "criterial" identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapter \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. Chapter \textbf{8} examines the modal commitments of abstractionism, in particular necessitism, and epistemic modality and the epistemology of abstraction. Chapter \textbf{9} examines the modal profile of $\Omega$-logic in set theory. Chapter \textbf{10} examines the interaction between epistemic two-dimensional truthmaker semantics, epistemic set theory, and absolute decidability. Chapter \textbf{11} avails of modal coalgebraic automata to interpret the defining properties of indefinite extensibility, and avails of epistemic two-dimensional semantics in order to account for the interaction of the interpretational and objective modalities thereof. The hyperintensional, topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapter \textbf{2} is applied in chapters \textbf{7}, \textbf{8}, \textbf{10}, and \textbf{11}. Chapter \textbf{12} provides a modal logic for rational intuition and provides four models of hyperintensional semantics. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Chapter \textbf{14} examines, finally, the modal semantics for the different types of intention and the relation of the latter to evidential decision theory

Mathematical Logic and Its Applications 2020

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021