We prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the former but holds in the latter structure: There are degrees f > e > d > 0 such that any degree u ≤ f is either comparable with both e and d, or incomparable with both.

We study completely decomposable torsion-free abelian groups of the form $\mathcal{G}_S := \oplus_{n \in S} \mathbb{Q}_{p_n}$ for sets $S \subseteq \omega$. We show that $\mathcal{G}_S$has a decidable copy if and only if S is $\Sigma^0_2$and has a computable copy if and only if S is $\Sigma^0_3$.

As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can relativize this example by considering a universal prefix-free oracle machine U. Let [Formula: see text] be the halting probability of UA; this gives a natural uniform way of producing an A-random real for every A ∈ 2ω. It is this operator which is our primary object of study. We can draw an analogy between the jump operator from computability theory (...) and this Omega operator. But unlike the jump, which is invariant under the choice of an effective enumeration of the partial computable functions, [Formula: see text] can be vastly different for different choices of U. Even for a fixed U, there are oracles A =* B such that [Formula: see text] and [Formula: see text] are 1-random relative to each other. We prove this and many other interesting properties of Omega operators. We investigate these operators from the perspective of analysis, computability theory, and of course, algorithmic randomness. (shrink)

The Dushnik–Miller Theorem states that every infinite countable linear ordering has a nontrivial self-embedding. We examine computability-theoretical aspects of this classical theorem.

A structure ${\mathbb Y}$ of a relational language L is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $\,<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi $ of the linear order $\langle Y\setminus F, <\rangle $ the mapping $\mathop {\mathrm {id}}\nolimits _F \cup \varphi $ is a partial automorphism of ${\mathbb Y}$. By theorems of Fraïssé and Pouzet, an infinite structure ${\mathbb Y}$ is almost chainable iff the (...) profile of ${\mathbb Y}$ is bounded; namely, iff there is a positive integer m such that ${\mathbb Y}$ has $\leq m$ non-isomorphic substructures of size n, for each positive integer n. A complete first order L-theory ${\mathcal T}$ having infinite models is called almost chainable iff all models of ${\mathcal T}$ are almost chainable and it is shown that the last condition is equivalent to the existence of one countable almost chainable model of ${\mathcal T}$. In addition, it is proved that an almost chainable theory has either one or continuum many non-isomorphic countable models and, thus, the Vaught conjecture is confirmed for almost chainable theories. (shrink)

There is a perfect thin class whose upward closure in the Turing degrees has full measure . Thus, in the Muchnik lattice of classes, the degree of 2-random reals is comparable with the degree of some perfect thin class. This solves a question of Simpson [S. Simpson, Mass problems and randomness, Bulletin of Symbolic Logic 11 1–27].

We study the relationship between a computably enumerable real and its presentations. A set A presents a computably enumerable real α if A is a computably enumerable prefix-free set of strings such that equation image. Note that equation image is precisely the measure of the set of reals that have a string in A as an initial segment. So we will simply abbreviate equation image by μ. It is known that whenever A so presents α then A ≤wttα, where ≤wtt (...) denotes weak truth table reducibility, and that the wtt-degrees of presentations form an ideal ℐ in the computably enumerable wtt-degrees. We prove that any such ideal is equation image, and conversely that if ℐ is any nonempty equation image ideal in the computably enumerable wtt-degrees then there is a computable enumerable real α such that ℐ = ℐ. We also prove a kind of Rice Theorem for these ideals, namely that if the index set of such a equation image ideal is not empty or equal to ω then it is equation image-complete. (shrink)

A real is called properly n-generic if it is n-generic but not n+1-generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m > n ≥ 2 then an m-generic real cannot compute a properly n-generic real.

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let ${\sf BC}_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture. Assuming the classical Borel conjecture, $\neg{\sf BC}_{\aleph_1}$ is equivalent to the existence of a Kurepa tree of height $\aleph_1$. Using the connection of ${\sf BC}_{\kappa}$ with a generalization of Kurepa's Hypothesis, we obtain the following consistency results: 1. If it is consistent that there is a 1-inaccessible cardinal (...) then it is consistent that ${\sf BC}_{\aleph_1}$.2. If it is consistent that ${\sf BC}_{\aleph_1}$, then it is consistent that there is an inaccessible cardinal.3. If it is consistent that there is a 1-inaccessible cardinal with $\omega$ inaccessible cardinals above it, then $\neg{\sf BC}_{\aleph_{\omega}} + (\forall n < \omega){\sf BC}_{\aleph_n}$ is consistent.4. If it is consistent that there is a 2-huge cardinal, then it is consistent that ${\sf BC}_{\aleph_{\omega}}$.5. If it is consistent that there is a 3-huge cardinal, then it is consistent that ${\sf BC}_{\kappa}$ for a proper class of cardinals $\kappa$ of countable cofinality. (shrink)

We prove Fraïssé’s conjecture within the system of Π11-comprehension. Furthermore, we prove that Fraïssé’s conjecture follows from the Δ20-bqo-ness of 3 over the system of Arithmetic Transfinite Recursion, and that the Δ20-bqo-ness of 3 is a Π21-statement strictly weaker than Π11-comprehension.

Slavoj Zizek is operating from a position of certainty, a position discovered by Jacques Lacan in Seminar XI. In this essay, I examine this position of certainty ("Gewissheit") and the ways this position is distinct from both existential phenomenology and post-structuralism, ultimately arguing that for structuralist psychoanalysis to function requires an intentional forgetting of being.

In this paper I argue that split-brain syndrome is best understood within an extended mind framework and, therefore, that its very existence provides support for an externalist account of conscious perception. I begin by outlining the experimental aberration model of split-brain syndrome and explain both: why this model provides the best account of split-brain syndrome; and, why it is commonly rejected. Then, I summarise Susan Hurley’s argument that split-brain subjects could unify their conscious perceptual field by using external factors to (...) stand-in for the missing corpus callosum. I next provide an argument that split-brain subjects do unify their perceptual fields via external factors. Finally, I explain why my account provides one with an experimental aberration model which avoids the problems typically levelled at such views, and highlight some empirical predictions made by the account. The nature of split-brain syndrome has long been considered mysterious by proponents of internalist accounts of consciousness. However, in this paper I argue that externalist theories can provide a straightforward explanation of the condition. I therefore conclude that the ability of externalist accounts to explain split-brain syndrome gives us strong reason to prefer them over internalist rivals. (shrink)

Answering a question of Sakai :29–45, 2013), we show that the existence of an ω1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega _1$$\end{document}-Erdős cardinal suffices to obtain the consistency of Chang’s Conjecture with □ω1,2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square _{\omega _1, 2}$$\end{document}. By a result of Donder, volume 872 of lecture notes in mathematics. Springer, Berlin, pp 55–97, 1981) this is best possible. We also give an answer to another question of Sakai relating (...) to the incompatibility of □λ,2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square _{\lambda, 2}$$\end{document} and ↠\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \twoheadrightarrow $$\end{document} for uncountable κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}. (shrink)

Can we deploy creative practices to critically address the fatal interlocking of global surveillance technologies, neo-colonial expansionism, environmental degradation and the lethal threat of drone warfare? Throughout the following conversation, Shona Illingworth and Anthony Downey examine these and other questions in relation to the recent publication of Topologies of Air (Sternberg Press and The Power Plant, 2022). Edited by Downey, the book includes discussion and documentation of two major bodies of work by Illingworth, including Topologies of Air (2021) and Lesions (...) in the Landscape (2015), alongside an extended series of essays that analyse the psychological and environmental impact of military, industrial and corporate transformations of airspace and outer space. Employing interdisciplinary research and collaborative processes, Illingworth’s practice, as detailed in the discussion below, uses creative methodologies to visualize and interrogate this proliferating exploitation of airspace. The conversation between Illingworth and Downey also outlines the work of the Airspace Tribunal, an ongoing series of public hearings that brings together diverse disciplines, methodologies, knowledge and lived experiences to propose a new human right that will counter the colonization of the sky and, in time, protect individuals, communities and ecologies from ever-increasing threats from above. (shrink)

We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment complexity, such as those introduced by Solovay [125], Downey, Hirschfeldt, and Nies [39], Downey, Hirschfeldt, and LaForte [36], and Downey [31]; as well as other methods such as lowness notions of Kučera and Terwijn [71], Terwijn and Zambella [133], Nies [101, 100], and Downey, Griffiths, and Reid [34]; higher level randomness notions (...) going back to the work of Kurtz [73], Kautz [61], and Solovay [125]; and other calibrations of randomness based on definitions along the lines of Schnorr [117].These notions have complex interrelationships, and connections to classical notions from computability theory such as relative computability and enumerability. Computability figures in obvious ways in definitions of effective randomness, but there are also applications of notions related to randomness in computability theory. For instance, an exciting by-product of the program we describe is a more-or-less naturalrequirement-freesolution to Post's Problem, much along the lines of the Dekker deficiency set. (shrink)

Rado’s Conjecture is a compactness/reflection principle that says any nonspecial tree of height ω1 has a nonspecial subtree of size ℵ1. Though incompatible with Martin’s Axiom, Rado’s Conjecture turns out to have many interesting consequences that are also implied by certain forcing axioms. In this paper, we obtain consistency results concerning Rado’s Conjecture and its Baire version. In particular, we show that a fragment of PFA, which is the forcing axiom for Baire Indestructibly Proper forcings, is compatible (...) with the Baire Rado’s Conjecture. As a corollary, the Baire Rado’s Conjecture does not imply Rado’s Conjecture. Then we discuss the strength and limitations of the Baire Rado’s Conjecture regarding its interaction with stationary reflection principles and some families of weak square principles. Finally, we investigate the influence of Rado’s Conjecture on some polarized partition relations. (shrink)

It is still commonly supposed that Descartes based his argument for the mind-body distinction on the law of the indiscernibility of identicals. I argue that this interpretation is very unlikely to be correct. I explain three contemporary versions of this interpreta- tion and say why I reject it. Basically, use of this law for Descartes’s conclusion would require reference to human bodies or else the supposition, for the purpose of the argument, of reference to human bodies. But at the time (...) Descartes formulated his argument, he would not have allowed either. Instead, I amend a different interpretation which others have found, and briefly defend it against one famous objection. (shrink)

Kreisel’s conjecture is the statement: if, for all$n\in \mathbb {N}$,$\mathop {\text {PA}} \nolimits \vdash _{k \text { steps}} \varphi (\overline {n})$, then$\mathop {\text {PA}} \nolimits \vdash \forall x.\varphi (x)$. For a theory of arithmeticT, given a recursive functionh,$T \vdash _{\leq h} \varphi $holds if there is a proof of$\varphi $inTwhose code is at most$h(\#\varphi )$. This notion depends on the underlying coding.${P}^h_T(x)$is a predicate for$\vdash _{\leq h}$inT. It is shown that there exist a sentence$\varphi $and a total recursive functionhsuch (...) that$T\vdash _{\leq h}\mathop {\text {Pr}} \nolimits _T(\ulcorner \mathop {\text {Pr}} \nolimits _T(\ulcorner \varphi \urcorner )\rightarrow \varphi \urcorner )$, but, where$\mathop {\text {Pr}} \nolimits _T$stands for the standard provability predicate inT. This statement is related to a conjecture by Montagna. Also variants and weakenings of Kreisel’s conjecture are studied. By the use of reflexion principles, one can obtain a theory$T^h_\Gamma $that extendsTsuch that a version of Kreisel’s conjecture holds: given a recursive functionhand$\varphi (x)$a$\Gamma $-formula (where$\Gamma $is an arbitrarily fixed class of formulas) such that, for all$n\in \mathbb {N}$,$T\vdash _{\leq h} \varphi (\overline {n})$, then$T^h_\Gamma \vdash \forall x.\varphi (x)$. Derivability conditions are studied for a theory to satisfy the following implication: if, then$T\vdash \forall x.\varphi (x)$. This corresponds to an arithmetization of Kreisel’s conjecture. It is shown that, for certain theories, there exists a functionhsuch that$\vdash _{k \text { steps}}\ \subseteq\ \vdash _{\leq h}$. (shrink)

We prove that Kreisel's Conjecture is true, if Peano arithmetic is axiomatised using minimality principle and axioms of identity (theory $PA_M $ )-The result is independent on the choice of language of $PA_M $ . We also show that if infinitely many instances of A(x) are provable in a bounded number of steps in $PA_M $ then there existe k ∈ ω s. t. $PA_M $ ┤ ∀x > k̄ A(x). The results imply that $PA_M $ does not prove (...) scheme of induction or identity schemes in a bounded number of steps. (shrink)

The ‘scaling up’ objection says non-representational ecological-enactive accounts will be unable to explain ‘representation hungry’ cognition. Obsessive-compulsive disorder presents a paradigmatic instance of this objection, marked as it is by ‘representation hungry’ obsessive thoughts and compulsive behavior organized around them. In this paper I provide an ecological-enactive account of OCD, thereby demonstrating non-representational frameworks can ‘scale up’ to explain ‘representation hungry’ cognition. First, I outline a non-representational account of mind— a predictive processing operationalization of Sean Kelly’s theory of perception. This (...) account explains the ‘tensions’ and ‘pulls’ which guide and constrain our action-oriented and affect-laden perceptual ‘grip’ upon the world to be underwritten by an imperative to minimize prediction error. I then argue that OCD is best understood as ‘grip gone awry’— malformed predictive models signal inappropriately high error, and this results in extremely strong ‘tensions’ and ‘pulls’ which prescribe actions. Thus, I arrive at the idea that OCD is primarily constituted by ‘not just right’ feelings caused by high error signaling. Finally, I explain that this account provides a causal explanation of the non-representational existential feeling fundamental to OCD. Compulsions are considered manifestations of non-representational grip responsive to this feeling, whilst obsessions are explained to play a meta-role in the condition, being formulated by subjects in a bid to make their ‘not just right’ feeling intelligible. I explain that the meta-role obsessions play makes their representational status largely irrelevant to OCD, and so leave this an open question. Consequently, I provide a non-representational account of OCD, thereby demonstrating that ecological-enactive approaches can respond to the ‘scaling up’ objection. (shrink)

We formulate an analogue of Zilber's conjecture for o-minimal structures in general, and then prove it for a class of o-minimal structures over the reals. We conclude in particular that if is an ordered reduct of ,<,+,·,ex whose theory T does not have the CF property then, given any model of T, a real closed field is definable on a subinterval of.

We investigate how weak square principles are denied by Chang’s Conjecture and its generalizations. Among other things we prove that Chang’s Conjecture does not imply the failure of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_{\omega_1, 2}}$$\end{document}, i.e. Chang’s Conjecture is consistent with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_{\omega_1, 2}}$$\end{document}.

Assume G is a superstable locally modular group. We describe for any countable model M of Th(G) the quotient group G(M) / Gm(M). Here Gm is the modular part of G. Also, under some additional assumptions we describe G(M) / Gm(M) relative to G⁻(M). We prove Vaught's Conjecture for Th(G) relative to Gm and a finite set provided that ℳ(G) = 1 and the ring of pseudoendomorphisms of G is finite.

In this paper I argue that, by combining eliminativist and fictionalist approaches toward the sub-personal representational posits of predictive processing, we arrive at an empirically robust and yet metaphysically innocuous cognitive scientific framework. I begin the paper by providing a non-representational account of the five key posits of predictive processing. Then, I motivate a fictionalist approach toward the remaining indispensable representational posits of predictive processing, and explain how representation can play an epistemologically indispensable role within predictive processing explanations without thereby (...) requiring that representation metaphysically exists. Finally, I outline four consequences of accepting this approach and explain why they are beneficial: we arrive at a victory for metaphysical eliminativism in the ‘representation wars’; my account fits with extant empirical practice; my account provides guidance for future research; and, my account provides the beginnings of a response to Mark Sprevak’s IBE problem for fictionalist approaches toward sub-personal representation. (shrink)

In [R. Vaught, Denumerable models of complete theories, in: Infinitistic Methods, Pregamon, London, 1961, pp. 303–321] Vaught conjectured that a countable first order theory has countably many or 20 many countable models. Here, the following special case is proved.

Let T be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that T has continuum-many countable models. The proof is purely first order, but it raises the question of Borel completeness of T.

Suppose that $\sigma\in{\mathcal{L}}_{\omega _{1},\omega }$ is such that all equations occurring in $\sigma$ are positive, have the same set of variables on each side of the equality symbol, and have at least one function symbol on each side of the equality symbol. We show that $\sigma$ satisfies Vaught’s conjecture. In particular, this proves Vaught’s conjecture for sentences of $ {\mathcal{L}}_{\omega _{1},\omega }$ without equality.

Todorčević showed that Rado's Conjecture implies CC*, a strengthening of Chang's Conjecture. We generalize this by showing that also CC**, a global version of CC*, follows from RC. As a corollary we obtain that RC implies Semistationary Reflection and, i.e. the statement that all forcings that preserve the stationarity of subsets of ω1 are semiproper.

In his paper, “On paradox without self-reference”, Neil Tennant proposed the conjecture for self-referential paradoxes that any derivation formalizing self-referential paradoxes only generates a looping reduction sequence. According to him, the derivation of the Liar paradox in natural deduction initiates a looping reduction sequence and the derivation of the Yablo's paradox generates a spiral reduction. The present paper proposes the counterexample to Tennant's conjecture for self-referential paradoxes. We shall show that there is a derivation of the Liar paradox (...) which generates a spiraling reduction procedure. Since the Liar paradox is a self-referential paradox, the result is a counterexample to his conjecture. Tennant has believed that classical reductio has no essential role to formalize paradoxes. As our counterexample applies the rule of classical reductio, he may reject the counterexample. In this sense, it will be briefly argued that classical reductio and his rules for the liar sentence share some inferential role. If classical reductio should not be used in paradoxical reasoning, neither should be his rules for the liar sentence. (shrink)

We show that the complete first order theory of an MV algebra has equation image countable models unless the MV algebra is finitely valued. So, Vaught's Conjecture holds for all MV algebras except, possibly, for finitely valued ones. Additionally, we show that the complete theories of finitely valued MV algebras are equation image and that all ω-categorical complete theories of MV algebras are finitely axiomatizable and decidable. As a final result we prove that the free algebra on countably many (...) generators of any locally finite variety of MV algebras is ω-categorical. (shrink)

In using the term “heart” to describe that which is constitutive of human personhood, Jean Vanier gives evidence that he views the person largely as affective, open to attraction, to be acted upon by another and drawn to communion. This is not to suggest that the heart is irrational or anti-intellectual, or to suggest that Vanier’s vision of the human person is so. Rather it is to suggest that, for Vanier, all that is known and decided is to be shaped (...) by the affective basis within the human person which needs to be touched by the Spirit. Maintaining the importance of intellect and reason, especially as these bear upon the social order, Vanier’s concern is with the core or ground of the human person which is antecedent to intellectual activity or rational discourse, and which, when touched by the presence of the Spirit, motivates one to the activity of the beatitudes. Those who respond to this action of the Spirit, and act from the heart when moved by God to compassion, become signs of God’s love, healing, tenderness and compassion. (shrink)

This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies not only (...) in the depth of the results contained therein, but also in the fact that the notions the authors introduce allow them to unify results from several subfields of computability theory. (shrink)

We examine the multiplicity of complementation amongst subspaces of V ∞ . A subspace V is a complement of a subspace W if V ∩ W = {0} and (V ∪ W) * = V ∞ . A subspace is called fully co-r.e. if it is generated by a co-r.e. subset of a recursive basis of V ∞ . We observe that every r.e. subspace has a fully co-r.e. complement. Theorem. If S is any fully co-r.e. subspace then S has (...) a decidable complement. We give an analysis of other types of complements S may have. For example, if S is fully co-r.e. and nonrecursive, then S has a (nonrecursive) r.e. nowhere simple complement. We impose the condition of immunity upon our subspaces. Theorem. Suppose V is fully co-r.e. Then V is immune iff there exist M 1 , M 2 ∈ L(V ∞ ), with M 1 supermaximal and M 2 k-thin, such that $M_1 \oplus V = M_2 \oplus V = V_\infty$ . Corollary. Suppose V is any r.e. subspace with a fully co-r.e. immune complement W (e.g., V is maximal or V is h-immune). Then there exist an r.e. supermaximal subspace M and a decidable subspace D such that $V \oplus W = M \oplus W = D \oplus W = V_\infty$ . We indicate how one may obtain many further results of this type. Finally we examine a generalization of the concepts of immunity and soundness. A subspace V of V ∞ is nowhere sound if (i) for all Q ∈ L(V ∞ ) if $Q \supset V$ then Q = V ∞ , (ii) V is immune and (iii) every complement of V is immune. We analyse the existence (and ramifications of the existence) of nowhere sound spaces. (shrink)

In this paper, we explore some of the consequences of Martin’s Conjecture on degree invariant Borel maps. These include the strongest conceivable ergodicity result for the Turing equivalence relation with respect to the filter on the degrees generated by the cones, as well as the statement that the complexity of a weakly universal countable Borel equivalence relation always concentrates on a null set.

It is proved that Vaught's conjecture is true for modules over an arbitrary countable serial ring. It follows from the structural result that every module with few models over a (countable) serial ring is ω-stable.