ABSTRACT In the work of Ernesto Laclau, populism is treated as a hegemonic challenge. Hegemony describes the usurpation of the image of society as a totality by a particular and underdetermined social imaginary. Seen through the lens of what Johann P. Arnason terms “post-transcendental phenomenology”, this concerns the way in which a society sees and experiences both itself and the world it inhabits. This article suggests that hegemonic social imaginaries are built into a society’s public spaces, and are in turn (...) experienced by citizens moving through these spaces, meaning that the built environment is central to the development of populist imaginaries. The article discusses how the neoliberal city exemplifies the way social imaginaries are inscribed into the physical landscape by highlighting three moments in the city; the institution of a certain imaginary as dominant; its sedimentation within the urban fabric over time; and finally, the re-activation of the original moment of institution, which opens up the possibility for new beginnings to overwrite the imaginaries encoded in the city. These three moments describe how physical, built spaces make concrete the power relations and horizons of possibility of the hegemonic imaginary—making possible and encouraging certain ways of being while discouraging (and hiding) others. This hegemonic logic of occupying a public space in the name of a particular subset of the population is a not only parallel to the form of populist politics, but populist sentiment is—at least in part—provoked by the experiences of inhabiting these spaces. (shrink)

We study the connection between factors of the Medvedev lattice and constructive logic. The algebraic properties of these factors determine logics lying in between intuitionistic propositional logic and the logic of the weak law of the excluded middle (also known as De Morgan, or Jankov, logic). We discuss the relation between the weak law of the excluded middle and the algebraic notion of join-reducibility. Finally we discuss autoreducible degrees.

We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite Boolean algebra, or contains an antichain of size $2^{2^{\aleph }0}$ , the size of the lattice itself. We also prove that it is consistent with ZFC that the lattice has chains of size $2^{2^{\aleph }0}$ , and in fact these big chains occur in every infinite interval. We also (...) study embeddings of lattices and algebras. We show that large Boolean algebras can be embedded into the Medvedev lattice as upper semilattices, but that a Boolean algebra can be embedded as a lattice only if it is countable. Finally we discuss which of these results hold for the closely related Muchnik lattice. (shrink)

We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0'. This contrasts with a result of Kučera and Terwijn [5] on sets that are low for the class of Martin-Löf random reals.

In this study, we examine the influence of senior leadership on firms’ corporate social responsibility. We integrate upper echelons research that has investigated either the influence of the CEO or the top management team on CSR. We contend that functional experience complementarity between CEOs and TMTs in formulating and implementing CSR strategy may underlie differentiated strategies in CSR. We find that when CEOs who have predominant experience in output functions are complemented by TMTs with a lower proportion of members who (...) have experience in output functions, there is a pronounced effect on the community, product, and diversity dimensions of CSR. In turn, when output-oriented CEOs are complemented by output-oriented TMTs, we observe an effect on the employee relations dimension of CSR. Interestingly, we find no influence of CEO-TMT complementarity on the environment dimension of CSR. In general, our empirical results support the relevance of the interaction between CEOs and their TMTs in defining their firms’ CSR profile. (shrink)

Simpson introduced the lattice of Π0 1 classes under Medvedev reducibility. Questions regarding completeness in are related to questions about measure and randomness. We present a solution to a question of Simpson about Medvedev degrees of Π0 1 classes of positive measure that was independently solved by Simpson and Slaman. We then proceed to discuss connections to constructive logic. In particular we show that the dual of does not allow an implication operator (i.e. that is not a Heyting algebra). We (...) also discuss properties of the class of PA-complete sets that are relevant in this context. (shrink)

In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness criterion also holds for every precomplete numbering, and we discuss the relation with Visser's ADN theorem, as well as the uniformity or nonuniformity of the various fixed point theorems. Finally, we base numberings on partial combinatory algebras and prove a generalization of Ershov's theorem in this context.

Model transfer refers to the observation that particular model structures are used across multiple distinct scientific domains. This paper puts forward an account to explain the inter-domain transfer of model structures. Central in the account is the role of validation criteria in determining whether a model is considered to be useful by practitioners. Validation criteria are points of reference to which model correctness for a particular purpose is assessed. I argue that validation criteria can be categorized as being mathematical, theoretical (...) or phenomenological in nature. Model transfer is explained by overlap in validation criteria between scientific domains. Particular emphasis is placed on overlap between phenomenological criteria. Overlap in phenomenological criteria can be explained through the notion of universal patterns. Universal patterns are abstract structures that can be made to refer to multiple distinct phenomena when coupled with phenomena-specific empirical content. I present the case study of the Yule Process, in which universal patterns play a crucial role in explaining model transfer. This paper provides an account of model transfer that stays close to modelling practice and expands existing accounts by introducing the notion of universal patterns. (shrink)

This chapter sets the scene for the subsequent philosophical discussions by surveying a number of biological interventions that have been used, or might in the future be used, for the purposes of crime prevention. These interventions are pharmaceutical interventions intended to suppress libido, treat substance abuse or attention deficit-hyperactivity disorder (ADHD), or modulate serotonin activity; nutritional interventions; and electrical and magnetic brain stimulation. Where applicable, we briefly comment on the historical use of these interventions, and in each case we discuss (...) the evidence that they are effective, or might become so with further refinement. The chapter concludes with a comment on some potentially significant differences between the varieties of intervention that we canvass. (shrink)

We investigate the initial segments of the Medvedev lattice as Brouwer algebras, and study the propositional logics connected to them.

We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while the new semantics is still complete, it gives a simple and direct correspondence between Kripke models and algebraic structures such as factors of the Medvedev lattice.

In this study, we examine the influence of senior leadership on firms’ corporate social responsibility. We integrate upper echelons research that has investigated either the influence of the CEO or the top management team on CSR. We contend that functional experience complementarity between CEOs and TMTs in formulating and implementing CSR strategy may underlie differentiated strategies in CSR. We find that when CEOs who have predominant experience in output functions are complemented by TMTs with a lower proportion of members who (...) have experience in output functions, there is a pronounced effect on the community, product, and diversity dimensions of CSR. In turn, when output-oriented CEOs are complemented by output-oriented TMTs, we observe an effect on the employee relations dimension of CSR. Interestingly, we find no influence of CEO-TMT complementarity on the environment dimension of CSR. In general, our empirical results support the relevance of the interaction between CEOs and their TMTs in defining their firms’ CSR profile. (shrink)

The Novelty-Seeking Model can explain incubation's effect on creativity by assuming an adaptive decision threshold. During an impasse, the threshold for novelty becomes too high and biased to previous neural activity, hindering progress. Incubation “resets” this threshold through attentional decoupling, allowing for spontaneous ideas to emerge from subsequent mind wandering or other activities that attract attention, facilitating progress.

We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of measure 0 set as considered before by Martin-Löf, Schnorr, and others. We prove that the class of sets constructible by r.e.-constructors, a direct analogue of the classes Lutz devised his resource bounded measures for in [10], is not equal to RE, the class of r.e. sets, and we locate this class exactly in terms of the common recursion-theoretic reducibilities below K. We note that (...) the class of sets that bounded truth-table reduce to K has r.e.-measure 0, and show that this cannot be improved to truth-table. For Δ2-measure the borderline between measure zero and measure nonzero lies between weak truth-table reducibility and Turing reducibility to K. It follows that there exists a Martin-Löf random set that is tt-reducible to K, and that no such set is btt-reducible to K. In fact, by a result of Kautz, a much more general result holds. (shrink)

We prove a number of elementary facts about computability in partial combinatory algebras. We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca’s. We then discuss separability and elements without total extensions. We relate this to Ershov’s notion of precompleteness, and we show that precomplete numberings are not 1–1 in general.

We discuss the effectivity of Arslanov’s completeness criterion. In particular, we show that a parameterized version, similar to the recursion theorem with parameters, fails. We also discuss the effectivity of another extension of the recursion theorem, namely Visser’s ADN theorem, as well as that of a joint generalization of the ADN theorem and Arslanov’s completeness criterion.

A positive answer to a question of M. van Lambalgen and D. Zambella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Here a set A is low for the class RAND of random sets if RAND = RAND A.

Partial combinatory algebras (pcas) are algebraic structures that serve as generalized models of computation. In this article, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene’s models, of van Oosten’s sequential computation model, and of Scott’s graph model, showing that an embedding between two relativized models exists if and only if there exists a particular reduction between the oracles. We obtain a similar result for the lambda calculus, showing in particular that it cannot be (...) embedded in Kleene’s first model. (shrink)

Name der Zeitschrift: Wittgenstein-Studien Jahrgang: 5 Heft: 1 Seiten: 57-88.

This book is the first part of a comprehensive study of Wittgenstein's conception of language description. Describing language was no pastime occupation for the philosopher. It was hard work and it meant struggle. It made for a philosophy that required Wittgenstein's full attention and half his life. His approach had always been working on himself, on how he saw things. The central claim of this book is that nothing will come of our exegetical efforts to see what Wittgenstein's later philosophy (...) amounts to if his work on describing language is not given the place and concern it deserves. The book shows what his philosophy might begin to look like in the light of critical questions around his interest to see the end of the day with descriptions, and these things only. (shrink)

For every partial combinatory algebra, we define a hierarchy of extensionality relations using ordinals. We investigate the closure ordinals of pca’s, i.e., the smallest ordinals where these relations become equal. We show that the closure ordinal of Kleene’s first model is ${\omega _1^{\textit {CK}}}$ and that the closure ordinal of Kleene’s second model is $\omega _1$. We calculate the exact complexities of the extensionality relations in Kleene’s first model, showing that they exhaust the hyperarithmetical hierarchy. We also discuss embeddings of (...) pca’s. (shrink)

This paper addresses the problem of ‘ignorance’ in philosophy and science, particularly with respect to the conceptualization, study and solution of environmental problems. We begin by distinguishing between ‘risk’, ‘uncertainty’ and ‘ignorance’. We then offer a categorization of ignorance, and use these categories to assess the role of science as a means of reducing ignorance. We note that to proceed with science, several 'acts of faith' are necessary. We conclude with a discussion of the importance of an attitude of openness (...) in science and philosophy, especially regarding environmental problems. Throughout, we illustrate our discussion of ignorance, and the problems involved in its reduction, by reference to environmental issues. (shrink)

We study a class of formulas generalizing the weak law of the excluded middle and provide a characterization of these formulas in terms of Kripke frames and Brouwer algebras. We use these formulas to separate logics corresponding to factors of the Medvedev lattice.

In this narrative, the author, a physician, recounts her mother's courageous, controversial final decisions and the interior struggles that subsequently confront the daughter-doctor. Family dynamics are outlined in this journalistic format, and tensions including the daughter's commitment to defending her mother's choice and the daughter's own grief, are presented.

We study the model-theoretic aspects of a probability logic suited for talking about measure spaces. This nonclassical logic has a model theory rather different from that of classical predicate logic. In general, not every satisfiable set of sentences has a countable model, but we show that one can always build a model on the unit interval. Also, the probability logic under consideration is not compact. However, using ultraproducts we can prove a compactness theorem for a certain class of weak models.

Identifying, classifying, and analyzing arguments in legal discourse has been a prominent area of research since the inception of the argument mining field. However, there has been a major discrepancy between the way natural language processing (NLP) researchers model and annotate arguments in court decisions and the way legal experts understand and analyze legal argumentation. While computational approaches typically simplify arguments into generic premises and claims, arguments in legal research usually exhibit a rich typology that is important for gaining insights (...) into the particular case and applications of law in general. We address this problem and make several substantial contributions to move the field forward. First, we design a new annotation scheme for legal arguments in proceedings of the European Court of Human Rights (ECHR) that is deeply rooted in the theory and practice of legal argumentation research. Second, we compile and annotate a large corpus of 373 court decisions (2.3M tokens and 15k annotated argument spans). Finally, we train an argument mining model that outperforms state-of-the-art models in the legal NLP domain and provide a thorough expert-based evaluation. All datasets and source codes are available under open lincenses at https://github.com/trusthlt/mining-legal-arguments. (shrink)

Can the straight line be analysed mathematically such that it does not fall apart into a set of discrete points, as is usually done but through which its fundamental continuity is lost? And are there objects of pure mathematics that can change through time? Mathematician and philosopher L.E.J. Brouwer argued that the two questions are closely related and that the answer to both is "yes''. To this end he introduced a new kind of object into mathematics, the choice sequence. But (...) other mathematicians and philosophers have been voicing objections to choice sequences from the start. This book aims to provide a sound philosophical basis for Brouwer's choice sequences by subjecting them to a phenomenological critique in the style of the later Husserl. (shrink)

This article presents a systematic literature review documenting how technical investigations have been adapted in value sensitive design (VSD) studies from 1996 to 2023. We present a systematic review, including theoretical and applied studies that either discuss or conduct technical investigations in VSD. This systematic review contributes to the VSD community when seeking to further refine the methodological framework for carrying out technical investigations in VSD.

We ask why pharmacological cognitive enhancement (PCE) is generally deemed morally unacceptable by lay people. Our approach to this question has two core elements. First, we employ an interdisciplinary perspective, using philosophical rationales as base for generating psychological models. Second, by testing these models we investigate how different normative judgments on PCE are related to each other. Based on an analysis of the relevant philosophical literature, we derive two psychological models that can potentially explain the judgment that PCE is unacceptable: (...) the “Unfairness-Undeservingness Model” and the “Hollowness-Undeservingness Model.” The Unfairness-Undeservingness Model holds that people judge PCE to be unacceptable because they take it to produce unfairness and to undermine the degree to which PCE-users deserve reward. The Hollowness-Undeservingness Model assumes that people judge PCE to be unacceptable because they find achievements realized while using PCE hollow and undeserved. We empirically test both models against each other using a regression-based approach. When trying to predict judgments regarding the unacceptability of PCE using judgments regarding unfairness, hollowness, and undeservingness, we found that unfairness judgments were the only significant predictor of the perceived unacceptability of PCE, explaining about 36% of variance. As neither hollowness nor undeservingness had explanatory power above and beyond unfairness, the Unfairness-Undeservingness Model proved superior to the Hollowness-Undeservingness Model. This finding also has implications for the Unfairness-Undeservingness Model itself: either a more parsimonious single-factor “Fairness Model” should replace the Unfairness-Undeservingness-Model or fairness fully mediates the relationship between undeservingness and unacceptability. Both explanations imply that participants deemed PCE unacceptable because they judged it to be unfair. We conclude that concerns about unfairness play a crucial role in the subjective unacceptability of PCE and discuss the implications of our approach for the further investigation of the psychology of PCE. (shrink)

Zusammenfassung Die rasanten Entwicklungen im Bereich der Künstlichen Intelligenz und Robotik stellen nicht nur die Ethik, sondern auch das Recht vor neue Herausforderungen, gerade im Bereich der Medizin und Pflege. Grundsätzlich hat der Einsatz von KI dabei das Potenzial, sowohl die Heilbehandlungen als auch den adäquaten Umgang im Rahmen der Pflege zu erleichtern, wenn nicht sogar zu verbessern. Verwaltungsaufgaben, die Überwachung von Vitalfunktionen und deren Parameter sowie die Untersuchung von Gewebeproben etwa könnten autonom ablaufen. In Diagnostik und Therapie können Systeme (...) die behandelnde Ärztin unterstützen. Intelligente Betten ermöglichen eine Frühmobilisierung der Patient:innen bei gleichzeitig geringerem Personalaufwand. Gleichwohl birgt der Einsatz der Systeme rechtliche Herausforderungen. So besteht das Risiko einer Verletzung der beteiligten Personen. Im Gegensatz zu herkömmlichen Technologien „leidet“ KI unter der „Black-Box-Problematik“: Die von den Systemen generierten Ergebnisse sind nicht mehr vollständig vorhersehbar und nachvollziehbar. Der Einsatz birgt unbekannte und unkalkulierbare Risiken, was sich insbesondere auf die zivilrechtliche Haftung und strafrechtliche Verantwortung auswirkt. Wem die Entscheidungen der Systeme normativ zuzurechnen sind, ist eine Kernfrage des juristischen Diskurses. Die aus praktikabilitätsgründen naheliegende Wahl, dem letztentscheidenden Menschen das Verhalten eines KI-Systems zuzurechnen, überzeugt nicht in allen Fällen, sondern degradiert ihn häufig zum symbolischen Haftungsknecht und legt ihm einseitig die Risiken der Technologien auf. Weiterhin ergeben sich im Bereich der Medizin und Pflege Fragen hinsichtlich der Zulassung von KI-Systemen, da die Maschinen während der Nutzung weiterlernen und so ihren strukturellen Aufbau kontinuierlich verändern. Es ist daher angebracht, sich frühzeitig mit dem Konfliktpotential aus ethischer und rechtlicher Sicht auseinander zu setzen, um einer potenziellen gesellschaftlichen Angst vor derartigen Systemen vorzubeugen und einen praxisgerechten Handlungsrahmen zu schaffen. (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)

This article analyses the nature of mental imagery in metaphoric thought as envisaged by the contemporary theory of metaphor in Cognitive Linguistics (Lakoff, Cambridge University Press, 1993). Our study of metaphor in the field of marine biology draws on two crucial aspects of mental imagery, namely dynamicity and pervasiveness. Image metaphors and behaviour-based metaphors have generally been regarded as two different types of resemblance metaphor. In our view, the dynamicity of certain mental images highlights inherent similarities between these two types (...) of metaphor, and makes the differences between them more apparent than real. For this reason, we propose a more refined description of resemblance metaphors in terms of the static or dynamic nature of the mental images underlying them. Our study also underlines the fact that mental images permeate all classes of metaphor, and that the pervasiveness and dynamicity of mental images affords insights into both resemblance metaphors and non-resemblance metaphors. (shrink)