Chapter 1: Introduction. S = <{We}c<w; C,U,n,0,w> is the substructure formed by restricting the lattice <^P(w); C , U, n,0,w> to the re subsets We of the ...

We study the proof-theoretic strength and effective content of the infinite form of Ramsey's theorem for pairs. Let RT n k denote Ramsey's theorem for k-colorings of n-element sets, and let RT $^n_{ denote (∀ k)RT n k . Our main result on computability is: For any n ≥ 2 and any computable (recursive) k-coloring of the n-element sets of natural numbers, there is an infinite homogeneous set X with X'' ≤ T 0 (n) . Let IΣ n and BΣ (...) n denote the Σ n induction and bounding schemes, respectively. Adapting the case n = 2 of the above result (where X is low 2 ) to models of arithmetic enables us to show that RCA 0 + IΣ 2 + RT 2 2 is conservative over RCA 0 + IΣ 2 for Π 1 1 statements and that $RCA_0 + I\Sigma_3 + RT^2_{ , is Π 1 1 -conservative over RCA 0 + IΣ 3 . It follows that RCA 0 + RT 2 2 does not imply BΣ 3 . In contrast, J. Hirst showed that $RCA_0 + RT^2_{ does imply BΣ 3 , and we include a proof of a slightly strengthened version of this result. It follows that $RT^2_{ is strictly stronger than RT 2 2 over RCA 0. (shrink)

We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the proof-theoretic strength of the regularity of Lebesgue measure for Gδ sets. Our constructions essentially settle the reverse mathematical classification of this principle.

We show there is a non-recursive r.e. set A such that if W is any low r.e. set, then the join W $\oplus$ A is also low. That is, A is "almost deep". This answers a question of Jockusch. The almost deep degrees form an definable ideal in the r.e. degrees (with jump.).

We show that the double jump is definable in the computably enumerable sets. Our main result is as follows: let [Formula: see text] is the Turing degree of a [Formula: see text] set J ≥T0″}. Let [Formula: see text] such that [Formula: see text] is upward closed in [Formula: see text]. Then there is an ℒ property [Formula: see text] such that [Formula: see text] if and only if there is an A where A ≡T F and [Formula: see text]. (...) A corollary of this is that, for all n ≥ 2, the high n computably enumerable degrees are invariant in the computably enumerable sets. Our work resolves Martin's Invariance Conjecture. (shrink)

The main result of this paper is to show that for every recursive ordinal α ≠ 0 and for every nonrecursive r.e. degree d there is a r.e. set of rank α and degree d.

We state and prove the Translation Theorem. Then we apply the Translation Theorem to Soare's Extension Theorem, weakening slightly the hypothesis to yield a theorem we call the Modified Extension Theorem. We use this theorem to reprove several of the known results about orbits in the lattice of recursively enumerable sets. It is hoped that these proofs are easier to understand than the old proofs.

In this article we establish the existence of a number of new orbits in the automorphism group of the computably enumerable sets. The degree theoretical aspects of these orbits also are examined.

The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, ε, such that the question of membership in this orbit is ${\Sigma _1^1 }$ -complete. This result and proof have a number of nice corollaries: the Scott rank of ε is $\omega _1^{{\rm{CK}}}$ + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of ε; for all finite α ≥ 9, there is a properly $\Delta (...) _\alpha ^0 $ orbit (from the proof). (shrink)

We analyze three applications of Ramsey’s Theorem for 4-tuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramsey’s Theorem while the application in lattice theory is shown to be provable in the weaker system RCA0.

The purpose of this communication is to announce some recent results on the computably enumerable sets. There are two disjoint sets of results; the first involves invariant classes and the second involves automorphisms of the computably enumerable sets. What these results have in common is that the guts of the proofs of these theorems uses a new form of definable coding for the computably enumerable sets.We will work in the structure of the computably enumerable sets. The language is just inclusion, (...) ⊆. This structure is called ε.All sets will be computably enumerable non-computable sets and all degrees will be computably enumerable and non-computable, unless otherwise noted. Our notation and definitions are standard and follow Soare [1987]; however we will warm up with some definitions and notation issues so the reader need not consult Soare [1987]. Some historical remarks follow in Section 2.1 and throughout Section 3.We will also consider the quotient structure ε modulo the ideal of finite sets, ε*. ε* is a definable quotient structure of ε since “Χ is finite” is definable in ε; “Χ is finite” iff all subsets of Χ are computable. We use A* to denote the equivalent class of A under the ideal of finite sets. (shrink)

Let b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a such that b>a>c and all lattices containing a critical triple, including the lattice M5, cannot be embedded into the interval [c, a].

A result of Soare and Stob asserts that for any non-recursive r.e. setC, there exists a r.e.[C] setA such thatA⊕C is not of r.e. degree. A setY is called [of]m-REA (m-REA[C] [degree] iff it is [Turing equivalent to] the result of applyingm-many iterated ‘hops’ to the empty set (toC), where a hop is any function of the formX→X ⊕W e X . The cited result is the special casem=0,n=1 of our Theorem. Form=0,1, and any (m+1)-REA setC, ifC is not ofm-REA (...) degree, then for alln there exists an-r.e.[C] setA such thatA ⊕C is not of (m+n)-REA degree. We conjecture that this holds also form≥2. (shrink)

Soare [20] proved that the maximal sets form an orbit in${\cal E}$. We consider here${\cal D}$-maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer [12]. Some orbits of${\cal D}$-maximal sets are well understood, e.g., hemimaximal sets [8], but many are not. The goal of this paper is to define new invariants on computably enumerable sets and to use them to give a complete nontrivial classification of the${\cal D}$-maximal sets. Although these invariants help us to better understand the${\cal D}$-maximal (...) sets, we use them to show that several classes of${\cal D}$-maximal sets break into infinitely many orbits. (shrink)

We show that if A and $\widehat{A}$ are automorphic via Φ then the structures $S_{R}(A)$ and $S_{R}(\widehat{A})$ are $\Delta_{3}^{0}-isomorphic$ via an isomorphism Ψ induced by Φ. Then we use this result to classify completely the orbits of hhsimple sets.

A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many maximal contiguous degrees. Since the contiguous degrees are definable, the class of maximal contiguous degrees provides the first example of a definable infinite anti-chain in the c.e. degrees. In addition, we show that the class of maximal contiguous degrees forms an automorphism base for the c.e. degrees and therefore for the (...) Turing degrees in general. Finally we note that the construction of a maximal contiguous degree can be modified to answer a question of Walk about the array computable degrees and a question of Li about isolated formulas. (shrink)

Soare [20] proved that the maximal sets form an orbit in${\cal E}$. We consider here${\cal D}$-maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer [12]. Some orbits of${\cal D}$-maximal sets are well understood, e.g., hemimaximal sets [8], but many are not. The goal of this paper is to define new invariants on computably enumerable sets and to use them to give a complete nontrivial classification of the${\cal D}$-maximal sets. Although these invariants help us to better understand the${\cal D}$-maximal (...) sets, we use them to show that several classes of${\cal D}$-maximal sets break into infinitely many orbits. (shrink)

We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.

This reissue of his collection of early essays, Logico-Linguistic Papers, is published with a brand new introduction by Professor Strawson but, apart from minor ...

A complete system of classical Aristotelian logic intended for honors high school and college.

Ohne Rücksicht auf disziplinäre Schranken bringt dieses Buch verschiedene nicht-reduktionistische Lerntheorien miteinander ins Gespräch. In einem offenen Diskurs, der die Konzepte zueinander in Beziehung setzt, werden die unterschiedlichen Perspektiven kritisch abgewogen und hinsichtlich ihrer Stärken und Schwächen diskutiert.

Delo se loteva vprašanja aktualnosti pojma subjekta v filozofiji in politiki skozi analizo tistih avtorjev, ki so ga domnevno najbolj radikalno pokopali: pokaže, da vznik radikalno novega in problematika subjekta zavzema osrednje mesto v Deleuzovi filozofiji, kakor tudi v Lyotardovi pozni misli posvečeni praznini, v Foucaultovi obravnavi biopolitike in biooblasti, v delu Negrija in Hardta o Imperiju, ter nazadnje v Badioujevi predelavi temeljnih filozofskih kategorij biti, resnice in subjekta, na osnovi katerih je dandanes znova možna renesansa filozofije. Ta ima po (...) Badiouju štiri razsežnosti, ki se v delu Vznik subjekta nenehno prepletajo: »V osnovi želja filozofije implicira razsežnost upora: ni filozofije brez nezadovoljstva mišljenja v njegovem soočenju s svetom, kakršen je. Pa vendar želja filozofije vključuje tudi logiko: to je, prepričanje v moč argumenta in uma.«. (shrink)

The relationship of part to whole is one of the most fundamental there is; this is the first and only full-length study of this concept. This book shows that mereology, the formal theory of part and whole, is essential to ontology. Peter Simons surveys and criticizes previous theories, especially the standard extensional view, and proposes a more adequate account which encompasses both temporal and modal considerations in detail. 'Parts could easily be the standard book on mereology for the next (...) twenty or thirty years.' Timothy Williamson, Grazer Philosophische Studien. (shrink)

In this short but meaty book, Peter Unger questions the objective answers that have been given to central problems in philosophy. As Unger hypothesizes, many of these problems are unanswerable, including the problems of knowledge and scepticism, the problems of free will, and problems of causation and explanation. In each case, he argues, we arrive at one answer only relative to an assumption about the meaning of key terms, terms like "know" and like "cause," even while we arrive at (...) an opposite answer relative to quite different assumptions, but equally arbitrary assumptions, about what the key terms mean. (shrink)

Narrative thinking -- Narrative thinking about one's past -- Grief : a case study -- Narrative thinking about one's future -- Self-forgiveness : a case study -- The narrative sense of self -- Narrative, truth, life, and fiction.

While Hermann Levin Goldschmidt didn’t read Yiddish anarchists, there seems to have been a convergent evolution in their thinking. Goldschmidt’s looking up to Jewish lore as a source of liberating creativity is commonly encountered in Yiddish anarchist texts. His view of action as a constant response to internal and external challenges in the struggle for an open future is developed by Isaac Nachman Steinberg on the basis of nineteenth-century vitalism. Goldschmidt’s theory of anarchist individualism as willed self-limiting solidarity has a (...) compelling parallel in Hillel Solotaroff’s view of history. His use of impressionism and photography to eternalize the immediacy of human actuality is akin to Rudolf Rocker’s championing of decadent literature. In both cases, the goal of anarchism is not a dictatorship of the former downtrodden, but a continuous and contradictory evolution of freedom in ever-changing contexts. (shrink)

The norm of assertion, to be in force, is a social norm. What is the content of our social norm of assertion? Various linguistic arguments purport to show that to assert is to represent oneself as knowing. But to represent oneself as knowing does not entail that assertion is governed by a knowledge norm. At best these linguistic arguments provide indirect support for a knowledge norm. Furthermore, there are alternative, non-normative explanations for the linguistic data (as in recent work from (...) Van Elswyk). Direct arguments would rely on normative judgments about the permissibility or impermissibility of assertions with and without the speaker knowing the content asserted. John Turri's work experimental results purport to show that our norm of assertion is factive, and probably knowledge. But as a number of recent experimentalists (Kneer, Reuter and Broessel, Marsili and Wiegmann) have shown, Turri's results rely on the problemmatic use of 'should' as in 'Maria should assert that she owns a 1990 watch.' Correcting for this, these experimentalists provide strong evidence that our norm of assertion is not factive. The standard reply to evidence like this from the assertion of unlucky falsehoods is the excuse maneuver. But Marsili and Wiegmann, following Turri's protocol for testing for excuse validation, show that participants who judge that assertions unlucky falsehoods are permissible are not guilty of excuse validation. Given our current understanding of the experimental evidence, knowledge is not our norm of assertion. (shrink)

Metz holds that we can use African communal ethics to constitute global economic practices such as appropriation, production, distribution and consumption in such a way that promotes harmonious relations. In this article, I will show that Metz’s reformist approach to constituting the global economic practices is problematic as it fails to deal with the fundamental problem that pertains to a racialised world order that is structurally configured by coloniality of being. I will show that reformist approaches such as Metz’s use (...) of African communal ethics to constitute global economic practices in a way that promotes harmonious relations are undesirable attempts that are opposed and curtailed by a structural racialised logic/ontology of the world that governs and supervises the evolution of the world economic structures and practices in a way which undermines harmonious relations and in a way which causes economic marginalisation and impoverishment of historically disadvantaged indigenous Africans. (shrink)

Philosophy of music has flourished in the last thirty years, with great advances made in the understanding of the nature of music and its aesthetics. Peter Kivy has been at the center of this flourishing, and now offers his personal introduction to philosophy of music, a clear and lively explanation of how he sees the most important and interesting philosophical issues relating to music. Anyone interested in music will find this a stimulating introduction to some fascinating questions and ideas.

Abstractabstract:Karl Marx’s acerbic observation in the opening lines of The Eighteenth Brumaire that “all facts and personages of great importance in world history occur the first time as tragedy, the second as farce” may be profitably applied to a reconsideration of literary farce sui generis, a genre represented in this article by a long-neglected work of utopian fiction, Archibald Marshall’s Upsidonia (1915). Although Upsidonia’s current disregard is arguably undeserved, the article’s chief interest is not to reclaim the novel on aesthetic (...) grounds but to illuminate the mechanics of what Marx would call its “serious buffoonery.” In its persistent reversal of capitalist principles and relations, Upsidonia naturally invites readers to revisit Marx, whose mordant gambit may serve as a key to Marshall’s own farcical plot and praxis, rooted in return and repetition, the essential maneuvers of farce itself. (shrink)

This introduction by leading scholar Peter Trawny is the first to tackle the Black Notebooks, whose recent publication revealed the extent of Heidegger's anti-Semitism. Trawny directly confronts the most problematic aspects of Heidegger's thought, also fully surveying his work, from early writings to his magnum opus, Being and Time.