"We often find that the state of not-knowing can be a precursor to moments of rich discovery which possess a dynamic, transformative power that exceeds any prior expectation." From the Introduction In daily life, when we see, hear or touch something that we don't recognise, we are instantly at our most alert. In that condition of 'not-knowing' we are in a state of alive, lithe awareness: asking questions, inviting input, open to learning, looking for significance and meaning... These essays, most (...) by practising psychotherapists, some of them Buddhists, take as their starting point the idea that not-knowing is fundamental to conscious reflection and the desire to know must always arise in the first instance from the self-awareness of not-knowing. Read in any order, on waking, before sleeping or when in doubt... they will be of interest to anyone who has ever sat in either chair in a psychotherapist's or counsellor's room - as well as anyone troubled or intrigued by what it takes to live comfortably and well in a condition of not knowing all (or even any) of the answers. (shrink)

The purpose of this paper is to discuss Miller’s recent claim that 1) the ideal of value-freedom is implausible because evidence from experimental psychology reveals how scientific reasoning is val...

Here we prove that if T and T′ are strongly minimal theories, where T′ satisfies a certain property related to triviality and T does not, and T′ is model complete, then there is no computable embedding of Mod(T) into Mod(T′). Using this, we answer a question from [4], showing that there is no computable embedding of VS into ZS, where VS is the class of infinite vector spaces over Q, and ZS is the class of models of Th(Z, S). Similarly, (...) we show that there is no computable embedding of ACF into ZS, where ACF is the class of algebraically closed fields of characteristic 0. (shrink)

A linear order is -decidable if its universe is and the relations defined by formulas are uniformly computable. This means that there is a computable procedure which, when applied to a formula and a sequence of elements of the linear order, will determine whether or not is true in the structure. A linear order is decidable if the relations defined by all formulas are uniformly computable. These definitions suggest two questions. Are there, for each , -decidable linear orders that are (...) not -decidable? Are there linear orders that are -decidable for all but not decidable? The former was answered in the positive by Moses in 1993. Here we answer the latter, also positively. (shrink)