In a remarkable development, I have constructed a new definition for a self-delimiting universal Turing machine (UTM) that is easy to program and runs very quickly. This provides a new foundation for algorithmic information theory (AIT), which is the theory of the size in bits of programs for selfdelimiting UTM's. Previously, AIT had an abstract mathematical quality. Now it is possible to write down executable programs that embody the constructions in the proofs of theorems. So AIT goes from dealing with (...) remote idealized mythical objects to being a theory about practical down-to-earth gadgets that one can actually play with and use. (shrink)

The objective of the present edition of this monograph is the same as that of earlier editions, namely, to provide readers with some mathemati cal maturity a rigorous and modern introduction to the ideas and principal theorems of probabilistic information theory. It is not necessary that readers have any prior knowledge whatever of information theory. The rapid development of the subject has had the consequence that any one book can now cover only a fraction of the literature. The latter is (...) often written by engineers for engineers, and the mathematical reader may have some difficulty with it. The mathematician who understands the content and methods of this monograph should be able to read the literature and start on research of his own in a subject of mathematical beauty and interest. The present edition differs from the second in the following: Chapter 6 has been completely replaced by one on arbitrarily varying channels. Chapter 7 has been greatly enlarged. Chapter 8 on semi-continuous channels has been drastically shortened, and Chapter 11 on sequential decoding completely removed. The new Chapters 11-15 consist entirely of material which has been developed only in the last few years. The topics discussed are rate distortion, source coding, multiple access channels, and degraded broadcast channels. Even the specialist will find a new approach in the treatment of these subjects. Many of the proofs are new, more perspicuous, and considerably shorter than the original ones. (shrink)

Jensen's remarkable Coding Theorem asserts that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of Strong Coding. In particular, our proof avoids the split into cases, according to whether or not 0# exists in the ground model.

In this paper we focus on theorem proving for conditional logics. First, we give a detailed description of CondLean, a theorem prover for some standard conditional logics. CondLean is a SICStus Prolog implementation of some labeled sequent calculi for conditional logics recently introduced. It is inspired to the so called “lean” methodology, even if it does not fit this style in a rigorous manner. CondLean also comprises a graphical interface written in Java. Furthermore, we introduce a goal-directed proof (...) search mechanism, derived from the above mentioned sequent calculi based on the notion of uniform proofs. Finally, we describe GOALDUCK, a simple SICStus Prolog implementation of the goal-directed calculus mentioned here above. Both the programs CondLean and GOALDUCK, together with their source code, are available for free download at. (shrink)

Given any subset A of ω1 there is a proper partial order which forces that the predicate xA and the predicate xω1A can be expressed by -provably incompatible Σ3 formulas over the structure Hω2,,NSω1. Also, if there is an inaccessible cardinal, then there is a proper partial order which forces the existence of a well-order of Hω2 definable over Hω2,,NSω1 by a provably antisymmetric Σ3 formula with two free variables. The proofs of these results involve a technique for manipulating the (...) guessing properties of club-sequences defined on stationary subsets of ω1 at will in such a way that the Σ3 theory of Hω2,,NSω1 with countable ordinals as parameters is forced to code a prescribed subset of ω1. On the other hand, using theorems due to Woodin it can be shown that, in the presence of sufficiently strong large cardinals, the above results are close to optimal from the point of view of the Levy hierarchy. (shrink)

In the context of constructive reverse mathematics, we show that weak Kőnig's lemma () implies that every pointwise continuous function is induced by a code in the sense of reverse mathematics. This, combined with the fact that implies the Fan theorem, shows that implies the uniform continuity theorem: every pointwise continuous function has a modulus of uniform continuity. Our results are obtained in Heyting arithmetic in all finite types with quantifier‐free axiom of choice.

Yu, X., Riesz representation theorem, Borel measures and subsystems of second-order arithmetic, Annals of Pure and Applied Logic 59 65-78. Formalized concept of finite Borel measures is developed in the language of second-order arithmetic. Formalization of the Riesz representation theorem is proved to be equivalent to arithmetical comprehension. Codes of Borel sets of complete separable metric spaces are defined and proved to be meaningful in the subsystem ATR0. Arithmetical transfinite recursion is enough to prove the measurability of Borel (...) sets for any finite Borel measure on a compact complete separable metric space. (shrink)

Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine (...) – Is continuality universal? – Diffeomorphism and velocity – Einstein’s general principle of relativity – „Mach’s principle“ – The Skolemian relativity of the discrete and the continuous – The counterexample in § 6 of their paper – About the classical tautology which is untrue being replaced by the statements about commeasurable quantum-mechanical quantities – Logical hidden parameters – The undecidability of the hypothesis about hidden parameters – Wigner’s work and и Weyl’s previous one – Lie groups, representations, and psi-function – From a qualitative to a quantitative expression of relativity − psi-function, or the discrete by the random – Bartlett’s approach − psi-function as the characteristic function of random quantity – Discrete and/ or continual description – Quantity and its “digitalized projection“ – The idea of „velocity−probability“ – The notion of probability and the light speed postulate – Generalized probability and its physical interpretation – A quantum description of macro-world – The period of the as-sociated de Broglie wave and the length of now – Causality equivalently replaced by chance – The philosophy of quantum information and religion – Einstein’s thesis about “the consubstantiality of inertia ant weight“ – Again about the interpretation of complex velocity – The speed of time – Newton’s law of inertia and Lagrange’s formulation of mechanics – Force and effect – The theory of tachyons and general relativity – Riesz’s representation theorem – The notion of covariant world line – Encoding a world line by psi-function – Spacetime and qubit − psi-function by qubits – About the physical interpretation of both the complex axes of a qubit – The interpretation of the self-adjoint operators components – The world line of an arbitrary quantity – The invariance of the physical laws towards quantum object and apparatus – Hilbert space and that of Minkowski – The relationship between the coefficients of -function and the qubits – World line = psi-function + self-adjoint operator – Reality and description – Does a „curved“ Hilbert space exist? – The axiom of choice, or when is possible a flattening of Hilbert space? – But why not to flatten also pseudo-Riemannian space? – The commutator of conjugate quantities – Relative mass – The strokes of self-movement and its philosophical interpretation – The self-perfection of the universe – The generalization of quantity in quantum physics – An analogy of the Feynman formalism – Feynman and many-world interpretation – The psi-function of various objects – Countable and uncountable basis – Generalized continuum and arithmetization – Field and entanglement – Function as coding – The idea of „curved“ Descartes product – The environment of a function – Another view to the notion of velocity-probability – Reality and description – Hilbert space as a model both of object and description – The notion of holistic logic – Physical quantity as the information about it – Cross-temporal correlations – The forecasting of future – Description in separable and inseparable Hilbert space – „Forces“ or „miracles“ – Velocity or time – The notion of non-finite set – Dasein or Dazeit – The trajectory of the whole – Ontological and onto-theological difference – An analogy of the Feynman and many-world interpretation − psi-function as physical quantity – Things in the world and instances in time – The generation of the physi-cal by mathematical – The generalized notion of observer – Subjective or objective probability – Energy as the change of probability per the unite of time – The generalized principle of least action from a new view-point – The exception of two dimensions and Fermat’s last theorem. (shrink)

The uniform continuity theorem states that every pointwise continuous real‐valued function on the unit interval is uniformly continuous. In constructive mathematics, is strictly stronger than the decidable fan theorem, but Loeb [17] has shown that the two principles become equivalent by encoding continuous real‐valued functions as type‐one functions. However, the precise relation between such type‐one functions and continuous real‐valued functions (usually described as type‐two objects) has been unknown. In this paper, we introduce an appropriate notion of continuity for (...) a modulus of a continuous real‐valued function on [0, 1], and show that real‐valued functions with continuous moduli are exactly those functions induced by Loeb's codes. Our characterisation relies on two assumptions: (1) real numbers are represented by regular sequences (equivalently Cauchy sequences with explicitly given moduli); (2) the continuity of a modulus is defined with respect to the product metric on the regular sequences inherited from the Baire space. Our result implies that is equivalent to the statement that every pointwise continuous real‐valued function on [0, 1] with a continuous modulus is uniformly continuous. We also show that is equivalent to a similar principle for real‐valued functions on the Cantor space. These results extend Berger's [2] characterisation of for integer‐valued functions on and unify some characterisations of in terms of functions having continuous moduli. (shrink)

We prove the following version of Hechler's classical theorem: For each partially ordered set (Q, ≤) with the property that every countable subset of Q has a strict upper bound in Q, there is a ccc forcing notion such that in the generic extension for each tall analytic P-ideal J (coded in the ground model) a cofinal subset of (J, ⊆*) is order isomorphic to (Q, ≤).

Let Γ be a collection of relations on the reals and let M be a set of reals. We call M a perfect set basis for Γ if every set in Γ with parameters from M which is not totally included in M contains a perfect subset with code in M. A simple elementary proof is given of the following result (assuming mild regularity conditions on Γ and M): If M is a perfect set basis for Γ, the field of (...) every wellordering in Γ is contained in M. An immediate corollary is Mansfield's Theorem that the existence of a Σ 1 2 wellordering of the reals implies that every real is constructible. Other applications and extensions of the main result are also given. (shrink)

In this paper we prove a boundedness theorem in the theory ID1. This answers a question asked by Feferman, for example in [3]. The background is the following.Let A[X, x] be an X-positive formula arithmetic in X. The theory ID1 is an extension of Peano arithmetic PA by the following axioms:for arbitrary formulas F; PA is a constant for the least fixed point of A[X, x]. Set-theoretically, PA can be defined by recursion on the ordinals as follows:where is the (...) first nonrecursive ordinal.Now let a ≺ b be the arithmetic relation which expresses that the recursive tree coded by a is a proper subtree of the tree coded by b, and defineThe least fixed point of Tree[X, x] is the set PTree of all well-founded recursive trees. We write W or Wα for PTree or, respectively. Since W is complete we have for all α <. If we define for each element a ∈ W its inductive norm ∣a∣ by ∣a∣≔ min{ξ: a ∈ Wξ}, then we have = {∣a∣: a ∈ W} and the elements of W can be used as codes for the ordinals less than.Assume that B[X, x] is an X-positive formula arithmetic in X with the only free variables X and x, and assume that QB is a relation that satisfiesIf we definethen we obviously have PB = IB. (shrink)

We give a short proof of a theorem of Kanovei on separating induction and collection schemes for Σ n formulas using families of subsets of countable models of arithmetic coded in elementary end extensions.

The aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin's famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the limiting constant is determined by the complexity of the theory itself, which is assumed to be good (...) measure of the strength of the theory. I exhibit certain strong counterexamples and establish conclusively that the received view is false. Moreover, I show that the limiting constants provided by the theorem do not in any way reflect the power of formalized theories, but that the values of these constants are actually determined by the chosen coding of Turing machines, and are thus quite accidental. (shrink)

This paper contains the full code of a prototype implementation in Haskell [5], in ‘literate programming’ style [6], of the tableau-based calculus and proof procedure for hybrid logic presented in [4].

We study the first-order consequences of Ramsey’s Theorem fork-colourings ofn-tuples, for fixed$n, k \ge 2$, over the relatively weak second-order arithmetic theory$\mathrm {RCA}^*_0$. Using the Chong–Mourad coding lemma, we show that in a model of$\mathrm {RCA}^*_0$that does not satisfy$\Sigma ^0_1$induction,$\mathrm {RT}^n_k$is equivalent to its relativization to any proper$\Sigma ^0_1$-definable cut, so its truth value remains unchanged in all extensions of the model with the same first-order universe.We give a complete axiomatization of the first-order consequences of$\mathrm {RCA}^*_0 + \mathrm (...) {RT}^n_k$for$n \ge 3$. We show that they form a non-finitely axiomatizable subtheory of$\mathrm {PA}$whose$\Pi _3$fragment coincides with$\mathrm {B} \Sigma _1 + \exp $and whose$\Pi _{\ell +3}$fragment for$\ell \ge 1$lies between$\mathrm {I} \Sigma _\ell \Rightarrow \mathrm {B} \Sigma _{\ell +1}$and$\mathrm {B} \Sigma _{\ell +1}$. We also give a complete axiomatization of the first-order consequences of$\mathrm {RCA}^*_0 + \mathrm {RT}^2_k + \neg \mathrm {I} \Sigma _1$. In general, we show that the first-order consequences of$\mathrm {RCA}^*_0 + \mathrm {RT}^2_k$form a subtheory of$\mathrm {I} \Sigma _2$whose$\Pi _3$fragment coincides with$\mathrm {B} \Sigma _1 + \exp $and whose$\Pi _4$fragment is strictly weaker than$\mathrm {B} \Sigma _2$but not contained in$\mathrm {I} \Sigma _1$.Additionally, we consider a principle$\Delta ^0_2$-$\mathrm {RT}^2_2$which is defined like$\mathrm {RT}^2_2$but with both the$2$-colourings and the solutions allowed to be$\Delta ^0_2$-sets rather than just sets. We show that the behaviour of$\Delta ^0_2$-$\mathrm {RT}^2_2$over$\mathrm {RCA}_0 + \mathrm {B}\Sigma ^0_2$is in many ways analogous to that of$\mathrm {RT}^2_2$over$\mathrm {RCA}^*_0$, and that$\mathrm {RCA}_0 + \mathrm {B} \Sigma ^0_2 + \Delta ^0_2$-$\mathrm {RT}^2_2$is$\Pi _4$- but not$\Pi _5$-conservative over$\mathrm {B} \Sigma _2$. However, the statement we use to witness failure of$\Pi _5$-conservativity is not provable in$\mathrm {RCA}_0 +\mathrm {RT}^2_2$. (shrink)

We construct a machine that knows its own code, at the price of not knowing its own factivity.

Abstract Taking my point of entry from George Eliot's reference to ?the power of Ignorance?, I analyse some manifestations of that power as she portrays it in the life of a young woman of affluence, in her novel Daniel Deronda. Comparing and contrasting this kind of ignorance with James Mill's avowed ignorance of local tradition and custom in his History of British India, I consider how ignorance can foster immoral beliefs which, in turn, contribute to social-political arrangements of dominance and (...) subordination. Yet I ask, too, how judgements of culpability can be sustained when ignorance is culturally induced. (shrink)

This article presents two theorems: a generalization of Löb’s Theorem that applies to formal proof systems operating with bounded computational resources, such as formal verification software or theorem provers, and a theorem on the robust cooperation of agents that employ proofs about one another’s source code as unexploitable criteria for cooperation. The latter illustrates a capacity for outperforming classical Nash equilibria and correlated equilibria, attaining mutually cooperative program equilibrium in the Prisoner’s Dilemma while remaining unexploitable, i.e., sometimes (...) achieving the outcome, and never receiving the outcome as player 1. (shrink)

We prove: Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has 2 ℵ 0 nonisomorphic countable models. Combined with the corresponding result or superstable theories from [4] our result confirms the Vaught conjecture for trivial theories which admit finite coding.

In this essay I take issue with entrenched conceptions of individual autonomy for how they block understandings of the implications of rape in patriarchal cultures both 'at home' and in situations of armed conflict. I focus on human vulnerability as it manifests in sedimented assumptions about violence against women as endemic to male-female relations, thwarting possibilities of knowing the specific harms particular acts of rape enact well enough to render intelligible their far-reaching social-political-moral implications. Taking my point of departure from (...) Debra Bergoffen's call for 'a new epistemology of rape', I consider what such a call can amount to within an instituted social imaginary where male domination and female subordination are taken for granted—naturalized. (shrink)

Ajtai’s completeness theorem roughly states that a countable structure A coded in a model of arithmetic can be end-extended and expanded to a model of a given theory G if and only if a contradiction cannot be derived by a proof from G plus the diagram of A, provided that the proof is definable in A and contains only formulas of a standard length. The existence of such model extensions is closely related to questions in complexity theory. In this (...) paper we give a new proof of Ajtai’s theorem using basic techniques of model theory. (shrink)

A Millian response is presented to Sen's celebrated Paretian liberal impossibility theorem. It is argued that Millian Paretian liberalism is possible, if the application of Paretian norms is restricted to the selection of an optimal code of liberal justice and rights, as well as to individual choices made in compliance with the rules of the code. Key steps in outlining the Millian response include suitably modifying Sen's social choice formulation of the idea of claim-right to personal liberty, and incorporating (...) within social choice theory the distinction between a right and its direction of exercise. The Millian response is illustrated in the context of Sen's original example of the ‘prude’ and the ‘lewd’. If the argument is successful, coherent and appealing liberal versions of Pareto-inclusive philosophies such as utilitarianism, contractualism and neo-republicanism are feasible in principle. (Published Online February 16 2006). (shrink)

I offer an examination of trust relations in scientific inquiry as they seem to contrast with a lack of trust in an example of knowledge imposed from above by an unaccountable institutional power structure. On this basis I argue for a re-reading of John Hardwig's account of the place of trust in knowledge, and suggest that it translates less well than social epistemologists and others have assumed into a model for democratic epistemic practice.

We propose a simple notion of "extender" for coding large elementary embeddings of models of set theory. As an application we present a self-contained proof of the theorem by D. Martin and J. Steel that infinitely many Woodin cardinals imply the determinacy of every projective set.

Solovay has shown that if F: [ω] ω → 2 is a clopen partition with recursive code, then there is an infinite homogeneous hyperarithmetic set for the partition (a basis result). Simpson has shown that for every 0 α , where α is a recursive ordinal, there is a clopen partition F: [ω] ω → 2 such that every infinite homogeneous set is Turing above 0 α (an anti-basis result). Here we refine these results, by associating the "order type" of (...) a clopen set with the Turing complexity of the infinite homogeneous sets. We also consider the Nash-Williams barrier theorem and its relation to the clopen Ramsey theorem. (shrink)

Louveau showed that if a Borel set in a Polish space happens to be in a Borel Wadge class $$\Gamma $$, then its $$\Gamma $$ -code can be obtained from its Borel code in a hyperarithmetical manner. We extend Louveau’s theorem to Borel functions: If a Borel function on a Polish space happens to be a $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -function, then one can find its $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -code hyperarithmetically relative to its Borel code. More generally, we (...) prove extension-type, domination-type, and decomposition-type variants of Louveau’s theorem for Borel functions. (shrink)

In this lively and accessible book Lorraine Code addresses one of the most controversial questions in contemporary theory of knowledge, a question of fundamental concern for feminist theory as well: Is the sex of the knower epistemologically significant? Responding in the affirmative, Code offers a radical alterantive to mainstream philosophy's terms for what counts as knowledge and how it is to be evaluated. Code first reviews the literature of established epistemologies and unmasks the prevailing assumption in Anglo-American philosophy that "the (...) knower" is a value-free and ideologically neutral abstraction. Approaching knowledge as a social construct produced and validated through critical dialogue, she defines the knower in light of a conception of subjectivity based on a personal relational model. Code maps out the relevance of the particular people involved in knowing: their historical specificity, the kinds of relationships they have, the effects of social position and power on those relationships, and the ways in which knowledge can change both knower and known. In an exploration of the politics of knowledge that mainstream epistemologies sustain, she examines such issues as the function of knowledge in shaping institutions and the unequal distribution of cognitive resources. What Can She Know? will raise the level of debate concerning epistemological issues among philosophers, political and social scientists, and anyone interested in feminist theory. (shrink)

Having adequate knowledge of the world is not just a matter of survival but also one of obligation. This obligation to "know well" is what philosophers have termed "epistemic responsibility." In this innovative and eclectic study, Lorraine Code explores the possibilities inherent in this concept as a basis for understanding human attempts to know and understand the world and for discerning the nature of intellectual virtue. By focusing on the idea that knowing is a creative process guided by imperatives of (...) epistemic responsibility, Code provides a fresh perspective on the theory of knowledge. From this new perspective, Code poses questions about knowledge that have a different focus from those traditionally raised in the two leading epistemological theories, foundationalism and coherentism. While not rejecting these approaches, this new position moves away from a primary concentration on determinate products and towards an examination of ever-changing processes. Arguing that knowledge never exists as an ungrounded abstraction but rather emerges through dialogue between variously authoritative "knowers" situated within particular social and historical contexts, she draws extensively on examples from lived social experience to illustrate the ways in which human beings have long tried to recognize and meet their epistemic responsibilities. This edition of Epistemic Responsibility includes a new preface from Lorraine Code"--Provided by the publisher. (shrink)

CHAPTER ONE Is the Sex of the Knower Epistemologically Significant? The Question A question that focuses on the knower, as the title of this chapter does, ...

In this lively and accessible book Lorraine Code addresses one of the most controversial questions in contemporary theory of knowledge, a question of fundamental concern for feminist theory as well: Is the sex of the knower epistemologically significant? Responding in the affirmative, Code offers a radical alterantive to mainstream philosophy's terms for what counts as knowledge and how it is to be evaluated. Code first reviews the literature of established epistemologies and unmasks the prevailing assumption in Anglo-American philosophy that "the (...) knower" is a value-free and ideologically neutral abstraction. Approaching knowledge as a social construct produced and validated through critical dialogue, she defines the knower in light of a conception of subjectivity based on a personal relational model. Code maps out the relevance of the particular people involved in knowing: their historical specificity, the kinds of relationships they have, the effects of social position and power on those relationships, and the ways in which knowledge can change both knower and known. In an exploration of the politics of knowledge that mainstream epistemologies sustain, she examines such issues as the function of knowledge in shaping institutions and the unequal distribution of cognitive resources. What Can She Know? will raise the level of debate concerning epistemological issues among philosophers, political and social scientists, and anyone interested in feminist theory. (shrink)

Arguing that ecological thinking can animate an epistemology capable of addressing feminist, multicultural, and other post-colonial concerns, this book critiques the instrumental rationality, hyperbolized autonomy, abstract individualism, and exploitation of people and places that western epistemologies of mastery have legitimated. It proposes a politics of epistemic location, sensitive to the interplay of particularity and diversity, and focused on responsible epistemic practices. Starting from an epistemological approach implicit in Rachel Carson’s scientific projects, the book draws, constructively and critically, on ecological theory (...) and practice, on (post-Quinean) naturalized epistemology, and on feminist and post-colonial theory. Analyzing extended examples from developmental psychology, from medicine and law, and from circumstances where vulnerability, credibility, and public trust are at issue, the argument addresses the constitutive part played by an instituted social imaginary in shaping and regulating human lives. The practices and examples discussed invoke the responsibility requirements central to this text’s larger purpose of imagining, crafting, articulating a creative, innovative, instituting social imaginary, committed to interrogating entrenched hierarchical social structures, en route to enacting principles of ideal cohabitation. (shrink)

The essays in Rhetorical Spaces grow out of Lorraine Code's ongoing commitment to engaging philosophical issues as they figure in people's everyday lives. The arguements in this book are informed at once by the moral-political implications of how knowledge is produced and circulated and by issues of gendered subjectivity. In their critical dimension, these lucid essays engage with the incapacity of the philosophical mainstream's dominant epistemologies to offer regulative principles that guide people in the epistemic projects that figure centrally in (...) their lives. In its constructive dimension, Rhetorical Spaces focuses on developing productive, case-by-case analyses of knowing other people in situations where social-political inequalities create asymmetrical patterns of epistemic power and privilege. Framing all of the essays is the conception of rhetorical spaces which shows that prevailing intellectual-political climates can work to enhance or to thwart possibilities of establishing cognitive authority for the members of a society who belong to groups other than the dominant ones. Finally, bridging the gap between theory and practice, Lorraine Code shows how the issue of reconfiguring structures of authority and expertise are not just matters of individual responsibility, but require a radical restructuring of the communities and social orders in which people know and act. (shrink)

The arguments in this book are informed at once by the moral-political implications of how knowledge is produced and circulated and by issues of gendered subjectivity. In their critical dimension, these lucid essays engage with the incapacity of the philosophical mainstream's dominant epistemologies to offer regulative principles that guide people in the epistemic projects that figure centrally in their lives. In its constructive dimension, ____Rhetorical__ ____Spaces__ focuses on developing productive, case-by-case analyses of knowing other people in situations where social-political inequalities (...) create asymmetrical patterns of epistemic power and privilege. (shrink)

Feminist epistemologists who attempt to refigure epistemology must wrestle with a number of dualisms. This essay examines the ways Lorraine Code, Sandra Harding, and Susan Hekman reconceptualize the relationship between self/other, nature/culture, and subject/object as they struggle to reformulate objectivity and knowledge.

I evaluate post-Quinean naturalized epistemology as a resource for postcolonial and feminist epistemology. I argue that naturalistic inquiry into material conditions and institutions of knowledge production has most to offer epistemologists committed to maintaining continuity with the knowledge production of specifically located knowers. Yet naturalistic denigrations of folk epistemic practices and stereotyped, hence often oppressive, readings of human nature challenge the naturalness of the nature they claim to study. I outline an ecologically modelled epistemology that focuses on questions of epistemic (...) responsibility and community, while refusing the reductivism of totalizing theory, and producing realistic moral-epistemic analyses of specific, local epistemic resources to ground its normative injunctions. (shrink)

Assumptions about what it is to be human are implicit in most philosophical reflections upon ethical and epistemological issues. Although such assumptions are not usually elaborated into a comprehensive theory of human nature, they are nonetheless influential in beliefs about what kinds of problem are worthy of consideration, and in judgments about the adequacy of proposed solutions. Claims to the effect that one should not be swayed by feelings and loyalties in the making of moral decisions, for example, presuppose that (...) human beings are creatures whose nature is amenable to guidance by reason rather than emotion and are creatures capable of living well when they act as impartially as possible. Analogously, claims to the effect that knowledge, to merit that title, should be acquired out of independent cognitive endeavour uncluttered by opinion and hearsay, suggest that human beings are creatures who can come to know their environment through their own unaided efforts. And claims to the effect that knowledge, once acquired, is timelessly and universally true depend upon assumptions about the constancy and uniformity of human nature across historical and cultural boundaries. (shrink)

Here I discuss some epistemological questions posed by projects of attempting to think globally, in light of the impossibility of affirming universal sameness. I illustrate one strategy for embarking on such a project, ecologically, in a reading of an essay by Chandra Talpade Mohanty. And I conclude by suggesting that the North/South border between Canada and the U.S.A. generates underacknowledged issues of cultural alterity.