This paper is dedicated to Prof. Dr. Günter Asser, whose work in founding this journal and maintaining it over many difficult years has been a major contribution to the activities of the mathematical logic community.At first sight it appears highly unlikely that Urysohn's Lemma has any significant constructive content. However, working in the context of an apartness space and using functions whose values are a generalisation of the reals, rather than real numbers, enables us to produce a significant (...) constructive version of that lemma. (shrink)

The exponential rise in transgender self-identification invites consideration of what constitutes an ethical response to transgender individuals’ claims about how best to promote their well-being. In this paper, we argue that ‘accepting’ a claim to medical transitioning in order to promote well-being would be in the person’s best interests iff at the point of request the individual is correct in their self-diagnosis as transgender (i.e., the distress felt to reside in the body does not result from another psychological and/or societal (...) problem) such that the medical interventions they are seeking will help them to realise their preferences. If we cannot assume this—and we suggest that we have reasonable grounds to question an unqualified acceptance in some cases—then ‘acceptance’ potentially works against best interests. We propose a distinction between ‘acceptance’ and respectful, in-depth exploration of an individual’s claims about what promotes their well-being. We discuss the ethical relevance of the unconscious mind to considerations of autonomy and consent in working with transgender individuals. An inquisitive stance, we suggest, supports autonomous choice about how to realise an embodied form that sustains well-being by allowing the individual to consider both conscious and unconscious factors shaping wishes and values, hence choices. (shrink)

Notini et al 1 offer a timely addition in the wake of a significant increase in young people identifying as transgender and gender diverse. The authors focus specifically on the case of 18-year-old Phoenix’s request for ongoing puberty suppression to affirm a non-binary gender identity. A central issue raised by Phoenix’s predicament, and that I suggest we can extend to ethical consideration of requests for other types of medical intervention by binary and non-binary TGD individuals, is whether we should ‘affirm’ (...) the claims made by TGD young people about what promotes their well-being. As a clinician working with TGD young people who have undergone a range of medical interventions to align their bodies with their gender identity, my starting presumption is that it is important to respect what people think will help them: there are some TGD young people for whom, all things considered, medical interventions to affirm gender identity promote their well-being. Well-being has become an important conceptual currency in ethical debates and lies at the core of the authors’ analysis of Phoenix’s case. While the authors do not ground their argument in favour of OPS in a specific theory of well-being, welfarist considerations 2 appear to underpin …. (shrink)

Notini _et al_ 1 offer a timely addition in the wake of a significant increase in young people identifying as transgender and gender diverse. The authors focus specifically on the case of 18-year-old Phoenix’s request for ongoing puberty suppression to affirm a non-binary gender identity. A central issue raised by Phoenix’s predicament, and that I suggest we can extend to ethical consideration of requests for other types of medical intervention by binary and non-binary TGD individuals, is whether we should ‘affirm’ (...) the claims made by TGD young people about what promotes their well-being. As a clinician working with TGD young people who have undergone a range of medical interventions to align their bodies with their gender identity, my starting presumption is that it is important to respect what people think will help them: there are some TGD... (shrink)

_Alessandra Lemma - Winner of the Levy-Goldfarb Award for Child Psychoanalysis!_ The contemporary relevance of psychoanalysis is being increasingly questioned; _Off the Couch_ challenges this view, demonstrating that psychoanalytic thinking and its applications are both innovative and relevant, in particular to the management and treatment of more disturbed and difficult to engage patient groups. Chapters address: clinical applications in diverse settings across the age range the relevance of psychoanalytic thinking to the practice of CBT, psychosomatics and general psychiatry the (...) contribution of psychoanalytic thinking to mental health policy and the politics of conflict and mediation. This book suggests that psychoanalysis has a vital position within the public health sector and discusses how it can be better utilised in the treatment of a range of mental health problems. It also highlights the role of empirical research in providing a robust evidence base. _Off the Couch_ will be essential reading for those practicing in the field of mental health and will also be useful for anyone involved in the development of mental health and public policies. It will ensure that practitioners and supervisors have a clear insight into how psychoanalysis can be applied in general healthcare. (shrink)

The focus of this paper is the incomputability of some topological functions using the tools of Borel computability theory, as introduced by V. Brattka in [3] and [4]. First, we analyze some basic topological functions on closed subsets of ℝn, like closure, border, intersection, and derivative, and we prove for such functions results of Σ02-completeness and Σ03-completeness in the effective Borel hierarchy. Then, following [13], we re-consider two well-known topological results: the lemmas of Urysohn and Urysohn-Tietze for generic (...) metric spaces . Both lemmas define Σ02-computable functions which in some cases are even Σ02-complete. (shrink)

Every second-countable regular topological space X is metrizable. For a given “computable” topological space satisfying an axiom of computable regularity M. Schröder [10] has constructed a computable metric. In this article we study whether this metric space can be considered computationally as a subspace of some computable metric space [15]. While Schröder's construction is “pointless”, i. e., only sets of a countable base but no concrete points are known, for a computable metric space a concrete dense set of computable points (...) is needed. But there may be no computable points in X. By converging sequences of basis sets instead of Cauchy sequences of points we construct a metric completion of a space together with a canonical representation equation image, equation image. We show that there is a computable embedding of in with computable inverse. Finally, we construct a notation of a dense set of points in with computable mutual distances and prove that the Cauchy representation of the resulting computable metric space is equivalent to equation image. Therefore, every computably regular space has a computable homeomorphic embedding in a computable metric space, which topologically is its completion. By the way we prove a computable Urysohn lemma. (shrink)

We investigate the set theoretical strength of some properties of normality, including Urysohn's Lemma, Tietze-Urysohn Extension Theorem, normality of disjoint unions of normal spaces, and normality of Fσ subsets of normal spaces.

Reverse mathematics is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, that is, non-set-theoretic, mathematics. As suggested by the title, this paper deals with the study of the topological notions of dimension and paracompactness, inside Kohlenbach’s higher-order RM. As to splittings, there are some examples in RM of theorems A, B, C such that A (...) ↔, that is, A can be split into two independent parts B and C, and the aforementioned topological notions give rise to a number of splittings involving highly natural A, B, C. Nonetheless, the higher-order picture is markedly different from the second-one: in terms of comprehension axioms, the proof in higher-order RM of, for example, the paracompactness of the unit interval requires full second-order arithmetic, while the second-order/countable version of paracompactness of the unit interval is provable in the base theory RCA 0. We obtain similarly “exceptional” results for the Urysohn identity, the Lindelöf lemma, and partitions of unity. We show that our results exhibit a certain robustness, in that they do not depend on the exact definition of cover, even in the absence of the axiom of choice. (shrink)

Lexicalized theories of syntax often assume that verb-structure regularities are mediated by lemmas, which abstract over variation in verb tense and aspect. German syntax seems to challenge this assumption, because verb position depends on tense and aspect. To examine how German speakers link these elements, a structural priming study was performed which varied syntactic structure, verb position, and verb overlap.structural priming was found, both within and across verb position, but priming was larger when the verb position was the same between (...) prime and target. Priming was boosted by verb overlap, but there was no interaction with verb position. The results can be explained by a lemma model where tense and aspect are linked to structural choices in German. Since the architecture of this lemma model is not consistent with results from English, a connectionist model was developed which could explain the cross-linguistic variation in the production system. Together, these findings support the view that language learning plays an important role in determining the nature of structural priming in different languages. (shrink)

We show that there is a limit lemma for enumeration reducibility to 0 e ', analogous to the Shoenfield Limit Lemma in the Turing degrees, which relativises for total enumeration degrees. Using this and `good approximations' we prove a jump inversion result: for any set W with a good approximation and any set X< e W such that W≤ e X' there is a set A such that X≤ e A< e W and A'=W'. (All jumps are enumeration (...) degree jumps.) The degrees of sets with good approximations include the Σ0 2 degrees and the n-CEA degrees. (shrink)

We study the Rudin–Keisler pre-order on Fréchet–Urysohn ideals on $\omega $. We solve three open questions posed by S. García-Ferreira and J. E. Rivera-Gómez in the articles [5] and [6] by establishing the following results: •For every AD family $\mathcal {A},$ there is an AD family $\mathcal {B}$ such that $\mathcal {A}^{\perp } <_{{\textsf {RK}}}\mathcal {B}^{\perp }.$ •If $\mathcal {A}$ is a nowhere MAD family of size $\mathfrak {c}$ then there is a nowhere MAD family $\mathcal {B}$ such that (...) $\mathcal {I}\left $ and $\mathcal {I}\left $ are Rudin–Keisler incomparable.•There is a family $\left \{ \mathcal {B}_{\alpha }\mid \alpha \in \mathfrak {c}\right \} $ of nowhere MAD families such that if $\alpha \neq \beta $, then $\mathcal {I}\left $ and $\mathcal {I}\left $ are Rudin–Keisler incomparable.Here $\mathcal {I}$ denotes the ideal generated by an AD family $\mathcal {A}$.In the context of hyperspaces with the Vietoris topology, for a Fréchet–Urysohn-filter $\mathcal {F}$ we let $\mathcal {S}_{c}\left \right ) $ be the hyperspace of nontrivial convergent sequences of the space consisting of $\omega $ as discrete subset and only one accumulation point $\mathcal {F}$ whose neighborhoods are the elements of $\mathcal {F}$ together with the singleton $\{\mathcal {F}\}$. For a FU-filter $\mathcal {F}$ we show that the following are equivalent: • $\mathcal {F}$ is a FUF-filter.• $\mathcal {S}_{c}\left \right ) $ is Baire. (shrink)

Jensen's celebrated Covering Lemma states that if 0# does not exist, then for any uncountable set of ordinals X, there is a Y∈L such that X⊆Y and |X| = |Y|. Working in ZF + AD alone, we establish the following analog: If ℝ# does not exist, then L(ℝ) and V have exactly the same sets of reals and for any set of ordinals X with |X| ≥ΘL(ℝ), there is a Y∈L(ℝ) such that X⊆Y and |X| = |Y|. Here ℝ (...) is the set of reals and Θ is the supremum of the ordinals which are the surjective image of ℝ. (shrink)

Classically, weak König's lemma and Brouwer's fan theorem for detachable bars are equivalent. We give a direct constructive proof that the former implies the latter.

Ehrenfeucht’s lemma asserts that whenever one element of a model of Peano arithmetic is definable from another, they satisfy different types. We consider here the analogue of Ehrenfeucht’s lemma for models of set theory. The original argument applies directly to the ordinal-definable elements of any model of set theory, and, in particular, Ehrenfeucht’s lemma holds fully for models of set theory satisfying V=HOD. We show that the lemma fails in the forcing extension of the universe by (...) adding a Cohen real. We go on to formulate a scheme of natural parametric generalizations of Ehrenfeucht’s lemma, namely, the principles of the form EL, which asserts that P-definability from A implies Q-discernibility. We also consider various analogues of Ehrenfeucht’s lemma obtained by using algebraicity in place of definability, where a set b is algebraic in a if it is a member of a finite set definable from a. Ehrenfeucht’s lemma holds for the ordinal-algebraic sets, we prove, if and only if the ordinal-algebraic and ordinal-definable sets coincide. Using a similar analysis, we answer two open questions posed earlier by the third author and C. Leahy, showing that algebraicity and definability need not coincide in models of set theory and the internal and external notions of being ordinal algebraic need not coincide. (shrink)

We analyze Zorn's Lemma and some of its consequences for Boolean algebras in a constructive setting. We show that Zorn's Lemma is persistent in the sense that, if it holds in the underlying set theory, in a properly stated form it continues to hold in all intuitionistic type theories of a certain natural kind. We also establish the persistence of some familiar results in the theory of Boolean algebras--notably, the proposition that every complete Boolean algebra is an absolute (...) subretract. This resolves a question of Banaschewski and Bhutani as to whether the Sikorski extension theorem for Boolean algebras is persistent. (shrink)

We analyze Zorn's Lemma and some of its consequences for Boolean algebras in a constructive setting. We show that Zorn's Lemma is persistent in the sense that, if it holds in the underlying set theory, in a properly stated form it continues to hold in all intuitionistic type theories of a certain natural kind. (Observe that the axiom of choice cannot be persistent in this sense since it implies the law of excluded middle.) We also establish the persistence (...) of some familiar results in the theory of (complete) Boolean algebras--notably, the proposition that every complete Boolean algebra is an absolute subretract. This (almost) resolves a question of Banaschewski and Bhutani as to whether the Sikorski extension theorem for Boolean algebras is persistent. (shrink)

Recent aphasiological findings, not mentioned in the target article, have been accounted for by Levelt et al.'s theory and have, in turn, provided it with empirical support and new leads. This interaction is especially promising in the domain of complex word retrieval. Examples of particular categories of compounds are discussed.

Examples cited by Feldman, Lehrer and others of true beliefs that are justified, but not by false lemmas, turn out under scrutiny to involve false lemmas after all. In each case there is an EG inference whose conclusion is unwarranted unless its base instance is false. A shift to non-deductive justification does not avert the difficulty. The relation of this result to non-inferential Gettier cases is suggested.

This paper uses cases involving empty singular terms (on the one hand, cases of what I call “accidental aboutness-failure”; on the other, cases involving proper names occurring in fictions) to argue for a claim about the goal of ordinary belief-forming activity, and shows how this claim generates new foundations for the theory of reference.

A treeable ergodic equivalence relation of integer cost is generated by a free action of the free group on the corresponding number of generators. Every countable treeable ergodic equivalence relation is induced by the free action of some countable group.

This is a completely informal presentation of the ideas behind the diagonal lemma. One really can't see this important result from too many different angles. This one aims at getting the main idea across. (For the cognoscenti, it is in the spirit of Quine's treatment in terms of "appended to its own quotation".).

In this paper we analyse in the framework of constructive mathematics (BISH) the validity of Farkas' lemma and related propositions, namely the Fredholm alternative for solvability of systems of linear equations, optimality criteria in linear programming, Stiemke's lemma and the Superhedging Duality from mathematical finance, and von Neumann's minimax theorem with application to constructive game theory.

We provide a fine‐grained analysis on the relation between König's lemma, weak König's lemma, and the decidable fan theorem in the context of constructive reverse mathematics. In particular, we show that double negated variants of König's lemma and weak König's lemma are equivalent to double negated variants of the general decidable fan theorem and the binary decidable fan theorem, respectively, over a nearly intuitionistic system containing a weak countable choice only. This implies that the general decidable (...) fan theorem is not equivalent to the binary decidable fan theorem in the absence of a strong countable choice. In addition, we introduce a principle which fills the gap between König's lemma and weak König's lemma, and show that König's lemma is equivalent to weak König's lemma plus this principle. We also solve several problems arising from the investigation. (shrink)

A cornerstone of modern mathematical logic is the diagonal lemma of Gödel and Carnap. It is used in e.g. the classical proofs of the theorems of Gödel, Rosser and Tarski. From its first explication in 1934, just essentially one proof has appeared for the diagonal lemma in the literature; a proof that is so tricky and hard to relate that many authors have tried to avoid the lemma altogether. As a result, some so called diagonal-free proofs have (...) been given for the above mentioned fundamental theorems of logic. In this paper, we provide new proofs for the semantic formulation of the diagonal lemma, and for a weak version of the syntactic formulation of it. (shrink)

We explore the connections between Dickson’s lemma and weak Ramsey theory. We show that a weak version of the Paris–Harrington principle for pairs in c colors and miniaturized Dickson’s lemma for c-tuples are equivalent over \. Furthermore, we look at a cascade of consequences for several variants of weak Ramsey’s theorem.

The deductive strengths of three variations of Rado's selection lemma are studied in set theory without the axiom of choice. Two are shown to be equivalent to Rado's lemma and the third to the Boolean prime ideal theorem. MSC: 03E25, 04A25, 06E05.

I derive a Gleason-type contradiction from assumptions weaker than those needed to reach a Bell inequality. By establishing the inconsistency between local realism and QM's perfect EPR-type anticorrelations, the proof fills in a gap left open by Bell arguments.

We show how to interpret weak Kőnig's lemma in some recently defined theories of nonstandard arithmetic in all finite types. Two types of interpretations are described, with very different verifications. The celebrated conservation result of Friedman's about weak Kőnig's lemma can be proved using these interpretations. We also address some issues concerning the collecting of witnesses in herbrandized functional interpretations.

König, D. [1926. ‘Sur les correspondances multivoques des ensembles’, Fundamenta Mathematica, 8, 114–34] includes a result subsequently called König's Infinity Lemma. Konig, D. [1927. ‘Über eine Schlussweise aus dem Endlichen ins Unendliche’, Acta Litterarum ac Scientiarum, Szeged, 3, 121–30] includes a graph theoretic formulation: an infinite, locally finite and connected graph includes an infinite path. Contemporary applications of the infinity lemma in logic frequently refer to a consequence of the infinity lemma: an infinite, locally finite tree with (...) a root has a infinite branch. This tree lemma can be traced to [Beth, E. W. 1955. ‘Semantic entailment and formal derivability’, Mededelingen der Kon. Ned. Akad. v. Wet., new series 18, 13, 309–42]. It is argued that Beth independently discovered the tree lemma in the early 1950s and that it was later recognized among logicians that Beth's result was a consequence of the infinity lemma. The equivalence of these lemmas is an easy consequence of a well known result in graph theory: every connected, locally finite graph has among its partial subgraphs a spanning tree. (shrink)

We prove constructively that the weak König lemma and quantifier-free number-number choice imply that every pointwise continuous function from Cantor space into Baire space has a modulus of uniform continuity.

We construct various isometry groups of the Urysohn space , including abelian groups which act transitively, and free groups which are dense in the full isometry group.