Contemporary argumentation theory or informal logic is the appropriate logical basis of qualitative inquiry. The communicative principles of cooperation and charity are essential within argumentation theory. An optimal observance of these principles, for strategical reasons for example, is of methodological relevance to qualitative research. In addition, an ethically motivated optimalization of the observance may also enhance methodological quality, especially dialogical intersubjectivity or openness. Moreover, this ethically motivated observance may be supported by a philosophy of life, which may stimulate opting for (...) qualitative inquiry and promote its methodological quality. (shrink)

School quality care has become important in many Western countries. Expectations are high, but little is known about the nature and extent of the use of self?evaluation instruments within schools. From this longitudinal study into the use of a Dutch school self?evaluation instrument, it became clear that schools vary in the extent to which they are able to make use of self?evaluation results. A minority of schools in this study were able to use the self?evaluation results for developing measures at (...) the school and classroom level to improve the quality of education. Potential causes for the findings and alternatives for promoting the utilisation of school self?evaluation instruments are discussed. (shrink)

The question may be asked why many workers are still being paid below subsistence wages and I believe the answer can be found in the confusion over what exactly constitutes a “living wage” and who has the duty to pay these wages. This article therefore clarifies what a living wage is and gives a concrete example of how a living wage can be calculated. To understand who has the obligation to pay living wages I look to the theory of Alan (...) Gewirth on individual and institutional responsibility and the account of Robert Mayer on structural exploitation to argue that all parts of the supply chain have the duty. The final part of this paper willoutline the inclusion of a living wage calculation into corporate codes of conduct to ensure that workers at the end of the supply chain receive living wages. (shrink)

A diagnosis of dementia often comes with difficulties in understanding a conversational context and expressing how one feels. So far, research on how to facilitate advance care planning for people with dementia focused on defining relevant themes and topics for conversations, or on how to formalize decisions made by surrogate decision makers, e.g., family members. The aim of this review is to provide a better scope of the existing research on practical communication aspects related to dementia in ACP conversations. In (...) November 2020, seven databases were searched to select papers for inclusion. This search was updated in December 2021. The search strategy consisted of three tiers, intersected by using the Boolean term “AND,” and resulted in 787 studies. Two researchers followed explicit criteria for two sequential levels of screening, based on titles and abstracts and full papers. A total of 22 studies were included for data analysis. Seven topics emerged clustered around two themes. This scoping review provides practical suggestions for healthcare professionals to improve ACP communication and uncovered gaps in research on communication aspects related to dementia in ACP conversations, such as non-verbal behavior, timing and implementation, and personal preferences. (shrink)

We explain the general significance of integer-based descriptors for natural shapes and show that the evolution of two such descriptors, called mechanical descriptors (the number _N_(_t_) of static balance points and the Morse–Smale graph associated with the scalar distance function measured from the center of mass) appear to capture (unlike classical geophysical shape descriptors) one of our most fundamental intuitions about natural abrasion: shapes get monotonically _simplified_ in this process. Thus mechanical descriptors help to establish a correlation between subjective and (...) objective descriptors of perceived objects. (shrink)

1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article refers of course (...) to Alan Turing, famous for his explication of the notion of mechanical computation on discrete data such as the integers. The ‘Newton’ there has to do to with the well known numerical method due to Isaac Newton for approximating the zeros of continuous functions under suitable conditions that is taken to be a paradigm of scientific computing. Finally, the meaning of “Turing meets Newton” in the title of Blum’s article has another, more particular aspect: in connection with the problem of controlling errors in the numerical solution of linear equations and inversion of matrices,Turing (1948) defined a notion of condition for the relation of changes in the output of a computation due to small changes in the input that is analogous to Newton’s definition of the derivative. The thrust of Blum’s 2004 article was that the BSS model of computation on the reals is the appropriate foundation for scientific computing in general. By way of response, two years later another very interesting and equally readable article appeared in the Notices, this time by Mark Braverman and Stephen Cook (2006) entitled “Computing over the reals: Foundations for scientific computing,” in which the authors argued that the requisite foundation is provided by a quite different “bit computation” model, that is in fact prima facie incompatible with the BSS model. The bit computation model goes back to ideas due to Stefan Banach and Stanislaw Mazur in the latter part of the 1930s, but the first publication was not made until Mazur (1963).. (shrink)

According to Kant, the axioms of intuition, i.e. space and time, must provide an organization of the sensory experience. However, this first orderliness of empirical sensations seems to depend on a kind of faculty pertaining to subjectivity, rather than to the encounter of these same intuitions with the real properties of phenomena. Starting from an analysis of some very significant developments in mathematical and theoretical physics in the last decades, in which intuition played an important role, we argue that nevertheless (...) intuition comes into play in a fundamentally different way to that which Kant had foreseen: in the form of a formal or “categorical” yet not sensible intuition. We show further that the statement that our space is mathematically three-dimensional and locally Euclidean by no means follows from a supposed a priori nature of the sensible or subjective space as Kant claimed. In fact, the three-dimensional space can bear many different geometrical and topological structures, as particularly the mathematical results of Milnor, Smale, Thurston and Donaldson demonstrated. On the other hand, it has been stressed that even the phenomenological or perceptual space, and especially the visual system, carries a very rich geometrical organization whose structure is essentially non-Euclidean. Finally, we argue that in order to grasp the meaning of abstract geometric objects, as n-dimensional spaces, connections on a manifold, fiber spaces, module spaces, knotted spaces and so forth, where sensible intuition is essentially lacking and where therefore another type of mathematical idealization intervenes, we need to develop a new form of intuition. (shrink)

We reduce to a standard circuit-size complexity problem a relativisation of the $P = NP$ question that we believe to be connected with the same question in the model for computation over the reals defined by L. Blum, M. Shub, and S. Smale. On this occasion, we set the foundations of a general theory for computation over an arbitrary structure, extending what these three authors did in the case of rings.

This paper was motivated by the following two questions which arise in the theory of complexity for computation over ordered rings in the now famous computational model introduced by Blum, Shub and Smale: 1. is the answer to the question P = ?NP the same in every real-closed field?2. if P ≠ NP for , does there exist a problem of which is NP but neither P nor NP-complete ?Some unclassical complexity classes arise naturally in the study of these questions. (...) They are still open, but we could obtain unconditional results of independent interest.Michaux introduced/const complexity classes in an effort to attack question . We show that , answering a question of his. Here A is the class of real problems which are algorithmic in bounded time. We also prove the stronger result: , where PAR stands for parallel polynomial time. In our terminology, we say that is A-saturated and PAR-saturated. We also prove, at the nonuniform level, the above results for every real-closed field. It is not known whether is P-saturated. In the case of the reals with addition and order we obtain P-saturation ). More generally, we show that an ordered -vector space is P-saturated at the nonuniform level ).We also study a stronger notion that we call P-stability. Blum, Cucker, Shub and Smale have shown that fields of characteristic 0 are P-stable. We show that the reals with addition and order are P-stable, but real-closed fields are not.Questions and and the/const complexity classes have some model theoretic flavor. This leads to the theory of complexity over “arbitrary” structures as introduced by Poizat. We give a summary of this theory with a special emphasis on the connections with model theory and we study/const complexity classes from this point of view. Note also that our proof of the PAR-saturation of shows that an o-minimal structure which admits quantifier elimination is A-saturated at the nonuniform level. (shrink)

The selective synthesis and manipulation of chiral molecules is a major part of stereochemistry. Interactions involving components with “handedness” also occur in nuclear and particle physics. Both fields employ phenomenologies based on group theoretical classifications and symmetry constraints such as the conservation or violation of parity. Smale's discovery of a sphere eversion—homotopic to a central inversion—evades the parity dichotomy by allowing states of opposite chirality to be connected by smooth maps. This transformation demonstrates that parity changes can, in principle, result (...) from the action of sufficiently complex processes, and do not necessarily have to be interpreted as violations of a symmetry. (shrink)

I denne artikkelen drøfter jeg bruk av biomedisinsk teknologi i prestasjonsfremmende hensikt i konkurranseidrett. Mer presist utforsker jeg mulighetene for å skille mellom etisk akseptabel og etisk uakseptabel bruk. Jeg kritiserer WADAs normative grunnlag for å forby visse biomedisinske midler og metoder, og argumenterer for at eventuelle forbud må bygge på tydeligere verdisyn på idrett. Jeg undersøker to idealtypiske syn og deres teknologiske implikasjoner. Det smale synet er liberalt og avviser begrensninger i bruk av biomedisinske midler og metoder blant voksne (...) idrettsutøvere som dårlig begrunnet paternalisme. Det brede synet innebærer en mer restriktiv holdning og aksepterer en viss regulering av trening og prestasjonsutvikling også utenfor konkurransene. I en avsluttende del veier jeg det smale og det brede synet mot hverandre og reflekterer over hvilket syn som vil dominere framtidens idrett.Nøkkelord: etikk, idrett, biomedisinsk teknologi, dopingEnglish summary: The use of biomedical technology in sport: Are there any limits?In the article I examine the use of biomedical technology to enhance performance in competitive sport. More specifically I examine the possibilities for distinguishing between ethically acceptable and ethically unacceptable use of such technology. I criticize the World Antidoping Agency's normative criterion for banning certain technologies as it is vague and unclear. I argue that any ban by WADA has to build on a clear and operational normative view of sport. Two relevant ideal-typical views are examined together with their technological implications. The narrow view is liberal and rejects restrictions on the use of biomedical technology among professional athletes as unjustifiable paternalism. The wider view implies a more restrictive approach and accepts certain regulations of performance-enhancing means and methods outside of competitions. In the conclusion, I compare the narrow and the wider views and reflect upon their possible status in competitive sport in the future. (shrink)

In this paper we deal with the logical description of complexity classes arising in the real number model of computation introduced by Blum, Shub, and Smale [4]. We adapt the approach of descriptive complexity theory for this model developped in [14] and extend it to capture some further complexity classes over the reals by logical means. Among the latter we find NC R , PAR R , EXP R and some others more.

Malebranche and the Search after Lost Identity. Legacy and Uncertainty of His Philosophy between the Eighteenth and Twentieth Centuries. Starting from the Œuvres complètes edited by Robinet, the article summarizes the vicissitudes through which the French historical scholarship with its leading figure Victor Cousin have restored the imagine and the correspondence of Malebranche, beginning with the dissemination of the original documents, conserved throughout the eighteenth century by P. Lelong, P. André, and finally P. Adry. In spite of his great historical (...) contribution, the French scholarship generally stressed an inadequate assessment of this philosophy, sharply suspected of spinozism, a judgment inherited by the handbooks of the history of philosophy edited between the XIX and the XX Century, as proved by the case of Grundriss der Geschichte der Philosophie by Überweg. The article concludes with three minimalist but creative readings of Malebranche by Proust, Heisenberg, Dalì. (shrink)

Let f be a function from N to N that can not be computed in polynomial time, and let a be an element of a differential field K of characteristic 0. The problem of large powers is the set of tuples x̄ = (x 1 ,..., x n ) of K so that x 1 = a f(n) , and the problem of large roots is the set of tuples x̄ of K so that x f(n) 1 = a. These (...) are two examples of problems that the use of derivation does not allow to solve quicker. We show that the problem of large roots is not polynomial for the differential field K, even if we use a polynomial number of parameters, and that the problem of large powers is not polynomial for the differential field K, even for non-uniform complexity. The proofs use the polynomial stability (i.e., the elimination of parameters) of field of characteristic 0, shown by L. Blum. F. Cucker. M. Shub and S. Smale, and the reduction lemma, that transforms a differential polynomial in variables x̄ into a polynomial in variables x̄. and their derivatives. (shrink)

Robert L. Smale’s work looks in detail at the origins of Bolivia’s labour movement in the tin mines of the early 20th century. This provides a good starting point for an account of the rapid rise of Trotskyism in the period leading up to the national revolution of 1952, a phenomenon described in detail in S. Sándor John’s book. Sándor John’s work in particular is important in understanding both the strengths and limitations of the Trotskyist POR, which was not able (...) to displace rival nationalist organisations to achieve political hegemony in the struggles of the second half of the 20th century. (shrink)

We present a model of computation for string functions over single-sorted, total algebraic structures and study some basic features of a general theory of computability within this framework. Our concept generalizes the Blum-Shub-Smale setting of computability over the reals and other rings. By dealing with strings of arbitrary length instead of tuples of fixed length, some suppositions of deeper results within former approaches to generalized recursion theory become superfluous. Moreover, this gives the basis for introducing computational complexity in a BSS-like (...) manner. Relationships both to classical computability and to Friedman's concept of eds computability are established. Two kinds of nondeterminism as well as several variants of recognizability are investigated with respect to interdependencies on each other and on properties of the underlying structures. For structures of finite signatures, there are universal programs with the usual characteristics. For the general case of not necessarily finite signature, this subject will be studied in a separate, forthcoming paper. (shrink)

Continuing the paper [7], in which the Blum-Shub-Smale approach to computability over the reals has been generalized to arbitrary algebraic structures, this paper deals with computability and recognizability over structures of infinite signature. It begins with discussing related properties of the linear and scalar real structures and of their discrete counterparts over the natural numbers. Then the existence of universal functions is shown to be equivalent to the effective encodability of the underlying structure. Such structures even have universal functions satisfying (...) the s-m-n theorem and related features. The real and discrete examples are discussed with respect to effective encodability. Megiddo structures and computational extensions of effectively encodable structures are encodable, too. As further variants of universality, universal functions with enumerable sets of program codes and such ones with constructible codes are investigated. Finally, the existence of m-complete sets is shown to be independent of the effective encodability of structures, and the linear and scalar structures are discussed once more, under this aspect. (shrink)

Nicolas Malebranche was born in Paris on August 6, 1638, and died there on October 13, 1715. According to Fontenelle he was a tenth, according to André a thirteenth child, and his “machine” was persistently refractory. He was tall—about six feet—but something misshapen from rickets or some other such cause. His spine, according to the unprofessional P. Adry, was “tortueuse dans toute sa longueur,” his clavicles too large, while his arms “n'étaient point attachés à l'ordinaire.” Besides he had “all the (...) maladies known in his time,” including severe acidity of the stomach from the age of twenty-five onwards. Nevertheless, he used to chew tobacco and was one of the earliest Parisians to become a coffee-drinker. For the most part, however, he tried to “manage his machine” by drinking water copiously. His portraits show him to have been strange, gaunt, intense, high-browed, and small-chinned. (shrink)

Nicolas Malebranche was born in Paris on August 6, 1638, and died there on October 13, 1715. According to Fontenelle he was a tenth, according to André a thirteenth child, and his “machine” was persistently refractory. He was tall—about six feet—but something misshapen from rickets or some other such cause. His spine, according to the unprofessional P. Adry, was “tortueuse dans toute sa longueur,” his clavicles too large, while his arms “n'étaient point attachés à l'ordinaire.” Besides he had “all the (...) maladies known in his time,” including severe acidity of the stomach from the age of twenty-five onwards . Nevertheless, he used to chew tobacco and was one of the earliest Parisians to become a coffee-drinker. For the most part, however, he tried to “manage his machine” by drinking water copiously. His portraits show him to have been strange, gaunt, intense, high-browed, and small-chinned. (shrink)

Based on the computation mode introduced in [13], we deal with the time complexity of computations over arbitrary first-order structures.The main emphasis is on parameter-free computations. Some transfer results for solutions of P versus NP problems as well as relationships to quantifier elimination are discussed. By computation tree analysis using first-order formulas, it follows that P versus NP solutions and other results of structural complexity theory are invariant under elementary equivalence of structures.