It was proved recently that Telgársky’s conjecture, which concerns partial information strategies in the Banach–Mazur game, fails in models of \. The proof introduces a combinatorial principle that is shown to follow from \, namely: \::Every separative poset \ with the \-cc contains a dense sub-poset \ such that \ for every \. We prove this principle is independent of \ and \, in the sense that \ does not imply \, and \ does not imply \ assuming (...) the consistency of a huge cardinal. We also consider the more specific question of whether \ holds with \ equal to the weight-\ measure algebra. We prove, again assuming the consistency of a huge cardinal, that the answer to this question is independent of \. (shrink)

Let S be the set of those α ∈ ω₂ that have cofinality ω₁. It is consistent relative to a measurable that the nonempty player wins the pressing down game of length ω₁, but not the Banach-Mazur game of length ω + 1 (both games starting with S).

The title question of the paper has its empirical origin in the form of an individual’s existential experience arising from the personal use of a computer, which we attempt to describe in the first section. The rest of the entire paper can be understood as a philosophical essay answering the question posed. First the connection between the main problem of the article and its “premonition” by mankind, which was expressed in the form of ancient myths and legends, is briefly suggested. (...) After shortly discussing the problems that early considerations of AI focused on, i.e. whether machines can think at all, we move on to reformulate our title question, about the possibility of outsmarting AI. This outsmarting will be understood by us in a rather limited way as to prevent a machine from completing its implemented task. To achieve this objective, after softly clarifying the basic terms, an analogy is built between the “outsmarting” of a machine by a human (the target domain) and the playing of a mathematical game between two players (the base domain), where this outsmarting is assigned a “winning strategy” in the certain game. This mathematical model is formed by games similar to Banach-Mazur games. The strict theorems of such games are then proved and applied to the target of the analogy. We then draw conclusions and look for counter-examples to our findings. The answer to the title question posed is negative, and it is not clear how far it should be taken seriously. (shrink)

This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions with a size notion, by introducing Lp-computable Baire categories. We show that Lp-computable Baire categories satisfy the following three basic properties. Singleton sets {f } are meager, suitable infinite unions of meager sets are meager, and the whole space of Lp-computable functions is not meager. We give an alternative characterization of meager sets via Banach-Mazur (...) games. We study the convergence of Fourier series for Lp-computable functions and show that whereas for every p > 1, the Fourier series of every Lp-computable function f converges to f in the Lp norm, the set of L1-computable functions whose Fourier series does not diverge almost everywhere is meager. (shrink)

When two people engage in a conversation, knowingly or unknowingly, they are playing a game. Players of such games have diverse objectives, or winning conditions: an applicant trying to convince her potential employer of her eligibility over that of a competitor, a prosecutor trying to convict a defendant, a politician trying to convince an electorate in a political debate, and so on. We argue that infinitary games offer a natural model for many structural characteristics of such conversations. We (...) call such games message exchange games, and we compare them to existing game theoretic frameworks used in linguistics—for example, signaling games—and show that message exchange games are needed to handle non-cooperative conversation. In this paper, we concentrate on conversational games where players’ interests are opposed. We provide a taxonomy of conversations based on their winning conditions, and we investigate some essential features of winning conditions like consistency and what we call rhetorical cooperativity. We show that these features make our games decomposition sensitive, a property we define formally in the paper. We show that this property has far-reaching implications for the existence of winning strategies and their complexity. There is a class of winning conditions for which message exchange games are equivalent to Banach- Mazur games, which have been extensively studied and enjoy nice topological results. But decomposition sensitive goals are much more the norm and much more interesting linguistically and philosophically. (shrink)

The general aim of this paper is to introduce some ideas of the theory of infinite topological games into the philosophical debate on supertasks. First, we discuss the elementary aspects of some infinite topological games, among them the Banach-Mazur game.Then it is shown that the Banach-Mazur game may be conceived as a Newtonian supertask.In section 4 we propose to conceive physical experiments as infinite games. This leads to the distinction between determined and undetermined (...) experiments and the problem of how it is related to that between determinism and indeter-minism. Finally the role of the Axiom of Choice as a source of indetermi-nacy of supertasks is discussed. (shrink)

We investigate the pressing down game and its relation to the Banach Mazur game. In particular we show: consistently, there is a nowhere precipitous normal ideal I on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\aleph_2}$$\end{document} such that player nonempty wins the pressing down game of length \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\aleph_1}$$\end{document} on I even if player empty starts.

It is well known that if the nonempty player of the Banach–Mazur game has a winning strategy on a space, then that space is Baire in all powers even in the box product topology. The converse of this implication may also be true: We know of no consistency result to the contrary. In this paper we establish the consistency of the converse relative to the consistency of the existence of a proper class of measurable cardinals.

We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity, strategic closure, and precipitousness.

In this paper we show that the Proper Forcing Axiom is preserved under forcing over any poset PP with the following property: In the generalized Banach–Mazur game over PP of length , Player II has a winning strategy which depends only on the current position and the ordinal indicating the number of moves made so far. By the current position we mean: The move just made by Player I for a successor stage, or the infimum of all the (...) moves made so far for a limit stage. As a consequence of this theorem, we introduce a weak form of the square principle and show that it is consistent with PFA. (shrink)

A notion of resource-bounded Baire category is developed for the class PC[0,1] of all polynomial-time computable real-valued functions on the unit interval. The meager subsets of PC[0,1] are characterized in terms of resource-bounded Banach-Mazur games. This characterization is used to prove that, in the sense of Baire category, almost every function in PC[0,1] is nowhere differentiable. This is a complexity-theoretic extension of the analogous classical result that Banach proved for the class C[0, 1] in 1931.

A notion of resource‐bounded Baire category is developed for the classPC[0,1]of all polynomial‐time computable real‐valued functions on the unit interval. The meager subsets ofPC[0,1]are characterized in terms of resource‐bounded Banach‐Mazur games. This characterization is used to prove that, in the sense of Baire category, almost every function inPC[0,1]is nowhere differentiable. This is a complexity‐theoretic extension of the analogous classical result that Banach proved for the classC[0, 1] in 1931. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, (...) Weinheim). (shrink)

We show that large fragments of MM, e. g. the tree property and stationary reflection, are preserved by strongly -game-closed forcings. PFA can be destroyed by a strongly -game-closed forcing but not by an ω2-closed.

Schervish (1985b) showed that every forecasting system is noncalibrated for uncountably many data sequences that it might see. This result is strengthened here: from a topological point of view, failure of calibration is typical and calibration rare. Meanwhile, Bayesian forecasters are certain that they are calibrated---this invites worries about the connection between Bayesianism and rationality.

We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach‐Mazur Boolean game. A σ‐short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ‐short Boolean algebras and study properties of σ‐short Boolean algebras. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim).

We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach-Mazur Boolean game. A σ-short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ-short Boolean algebras and study properties of σ-short Boolean algebras.

We consider two classical computability notions for functions mapping all computable real numbers to computable real numbers. It is clear that any function that is computable in the sense of Markov, i.e., computable with respect to a standard Gödel numbering of the computable real numbers, is computable in the sense of Banach and Mazur, i.e., it maps any computable sequence of real numbers to a computable sequence of real numbers. We show that the converse is not true. This (...) solves a long-standing open problem posed by Kushner. (shrink)

R. M. Friedberg demonstrated the existence of a recursive functional that agrees with no Banach-Mazur functional on the class of recursive functions. In this paper Friedberg's result is generalized to both α-recursive functionals and weak α-recursive functionals for all admissible ordinals α such that $\lambda , where α * is the Σ 1 -projectum of α and λ is the Σ 2 -cofinality of α. The theorem is also established for the metarecursive case, α = ω 1 , (...) where α * = λ = ω. (shrink)

We prove two embedding and extension theorems in the context of the constructive theory of metric spaces. The first states that Cantor space embeds in any inhabited complete separable metric space without isolated points, X, in such a way that every sequentially continuous function from Cantor space to ℤ extends to a sequentially continuous function from X to ℝ. The second asserts an analogous property for Baire space relative to any inhabited locally non-compact CSM. Both results rely on having careful (...) constructive formulations of the concepts involved.As a first application, we derive new relationships between “continuity principles” asserting that all functions between specified metric spaces are pointwise continuous. In particular, we give conditions that imply the failure of the continuity principle “all functions from X to ℝ are continuous”, when X is an inhabited CSM without isolated points, and when X is an inhabited locally non-compact CSM. One situation in which the latter case applies is in models based on “domain realizability”, in which the failure of the continuity principle for any inhabited locally non-compact CSM, X, generalizes a result previously obtained by Escardó and Streicher in the special case X = C[0, 1].As a second application, we show that, when the notion of inhabited complete separable metric space without isolated points is interpreted in a recursion-theoretic setting, then, for any such space X, there exists a Banach-Mazur computable function from X to the computable real numbers that is not Markov computable. This generalizes a result obtained by Hertling in the special case that X is the space of computable real numbers. (shrink)

We prove two embedding and extension theorems in the context of the constructive theory of metric spaces. The first states that Cantor space embeds in any inhabited complete separable metric space (CSM) without isolated points, X, in such a way that every sequentially continuous function from Cantor space to ℤ extends to a sequentially continuous function from X to ℝ. The second asserts an analogous property for Baire space relative to any inhabited locally non‐compact CSM. Both results rely on having (...) careful constructive formulations of the concepts involved.As a first application, we derive new relationships between “continuity principles” asserting that all functions between specified metric spaces are pointwise continuous. In particular, we give conditions that imply the failure of the continuity principle “all functions from X to ℝ are continuous”, when X is an inhabited CSM without isolated points, and when X is an inhabited locally non‐compact CSM. One situation in which the latter case applies is in models based on “domain realizability”, in which the failure of the continuity principle for any inhabited locally non‐compact CSM, X, generalizes a result previously obtained by Escardó and Streicher in the special case X = C[0, 1].As a second application, we show that, when the notion of inhabited complete separable metric space without isolated points is interpreted in a recursion‐theoretic setting, then, for any such space X, there exists a Banach‐Mazur computable function from X to the computable real numbers that is not Markov computable. This generalizes a result obtained by Hertling in the special case that X is the space of computable real numbers. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

Banach introduced the following two-person, perfect information, infinite game on the real numbers and asked the question: For which sets $A \subseteq \mathbf{R}$ is the game determined????? Rules: The two players alternate moves starting with player I. Each move a n is legal iff it is a real number and $0 , and for $n > 1, a_n . The first player to make an illegal move loses. Otherwise all moves are legal and I wins iff ∑ a n (...) exists and ∑ a n ∈ A. We will look at this game and some variations of it, called Banach games. In each case we attempt to find the relationship between Banach determinancy and the determinancy of other well-known and much-studied games. (shrink)

In this paper we give an axiomatisation of the concept of a computability structure with partial sequences on a many‐sorted metric partial algebra, thus extending the axiomatisation given by Pour‐El and Richards in [9] for Banach spaces. We show that every Banach‐Mazur computable partial function from an effectively separable computable metric partial Σ‐algebraAto a computable metric partial Σ‐algebraBmust be continuous, and conversely, that every effectively continuous partial function with semidecidable domain and which preserves the computability of a (...) computably enumerable dense set must be computable. Finally, as an application of these results we give an alternative proof of the first main theorem for Banach spaces first proved by Pour‐El and Richards. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

This article presents a relatively straightforward theoretical framework about distributive justice with applications. It draws on a few key concepts of Sociological Game Theory. SGT is presented briefly in section 2. Section 3 provides a spectrum of distributive cases concerning principles of equality, differentiation among recipients according to performance or contribution, status or authority, or need. Two general types of social organization of distributive judgment are distinguished and judgment procedures or algorithms are modeled in each type of social organization. Section (...) 4 discusses briefly the larger moral landscapes of human judgment – how distribution may typically be combined with other value into consideration. The article suggests that Rawls, Elster, and Machado point in this direction. Finally, it is suggested that the SGT framework presented provides a useful point of departure to systematically link it and compare the Warsaw School of Fair Division, Rawls, and Elster, among others. (shrink)

We study theorems from Functional Analysis with regard to their relationship with various weak choice principles and prove several results about them: “Every infinite‐dimensional Banach space has a well‐orderable Hamel basis” is equivalent to ; “ can be well‐ordered” implies “no infinite‐dimensional Banach space has a Hamel basis of cardinality ”, thus the latter statement is true in every Fraenkel‐Mostowski model of ; “No infinite‐dimensional Banach space has a Hamel basis of cardinality ” is not provable in (...) ; “No infinite‐dimensional Banach space has a well‐orderable Hamel basis of cardinality ” is provable in ; (the Axiom of Choice for denumerable families of non‐empty finite sets) is equivalent to “no infinite‐dimensional Banach space has a Hamel basis which can be written as a denumerable union of finite sets”; Mazur's Lemma (“If X is an infinite‐dimensional Banach space, Y is a finite‐dimensional vector subspace of X, and, then there is a unit vector such that for all and all scalars α”) is provable in ; “A real normed vector space X is finite‐dimensional if and only if its closed unit ball is compact” is provable in ; (Principle of Dependent Choices) + “ can be well‐ordered” does not imply the Hahn‐Banach Theorem () in ; and “no infinite‐dimensional Banach space has a Hamel basis of cardinality ” are independent from each other in ; “No infinite‐dimensional Banach space can be written as a denumerable union of finite‐dimensional subspaces” lies in strength between (the Axiom of Countable Choice) and ; implies “No infinite‐dimensional Banach space can be written as a denumerable union of closed proper subspaces” which in turn implies ; “Every infinite‐dimensional Banach space has a denumerable linearly independent subset” is a theorem of, but not a theorem of ; and “Every infinite‐dimensional Banach space has a linearly independent subset of cardinality ” implies “every Dedekind‐finite set is finite”. (shrink)

In this paper we give an axiomatisation of the concept of a computability structure with partial sequences on a many-sorted metric partial algebra, thus extending the axiomatisation given by Pour-El and Richards in [9] for Banach spaces. We show that every Banach-Mazur computable partial function from an effectively separable computable metric partial Σ-algebra A to a computable metric partial Σ-algebra B must be continuous, and conversely, that every effectively continuous partial function with semidecidable domain and which preserves (...) the computability of a computably enumerable dense set must be computable. Finally, as an application of these results we give an alternative proof of the first main theorem for Banach spaces first proved by Pour-El and Richards. (shrink)

We present the notion of finite high-order Gowers games, and prove a statement parallel to Gowers's Combinatorial Lemma for these games. We derive ‘quantitative’ versions of the original Gowers Combinatorial Lemma and of Gowers's Dichotomy, which place them in the context of the recently introduced infinite dimensional asymptotic theory for Banach spaces.

We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov [2] and by Ben Yaacov, Doucha, Nies, and Tsankov [6], which are largely incompatible. With this we explicitly exhibit Scott sentences for the perturbation systems of the former paper, such as the Banach‐Mazur distance and the Lipschitz distance between metric spaces. Our formalism is simultaneously characterized syntactically by a mild generalization of perturbation systems and semantically by certain elementary classes (...) of two‐sorted structures that witness approximate isomorphism. As an application, we show that the theory of any ‐tree or ultrametric space of finite radius is stable, improving a result of Carlisle and Henson [8]. (shrink)

We prove two embedding and extension theorems in the context of the constructive theory of metric spaces. The first states that Cantor space embeds in any inhabited complete separable metric space (CSM) without isolated points, X, in such a way that every sequentially continuous function from Cantor space to ℤ extends to a sequentially continuous function from X to ℝ. The second asserts an analogous property for Baire space relative to any inhabited locally non‐compact CSM. Both results rely on having (...) careful constructive formulations of the concepts involved.As a first application, we derive new relationships between “continuity principles” asserting that all functions between specified metric spaces are pointwise continuous. In particular, we give conditions that imply the failure of the continuity principle “all functions from X to ℝ are continuous”, when X is an inhabited CSM without isolated points, and when X is an inhabited locally non‐compact CSM. One situation in which the latter case applies is in models based on “domain realizability”, in which the failure of the continuity principle for any inhabited locally non‐compact CSM, X, generalizes a result previously obtained by Escardó and Streicher in the special case X = C[0, 1].As a second application, we show that, when the notion of inhabited complete separable metric space without isolated points is interpreted in a recursion‐theoretic setting, then, for any such space X, there exists a Banach‐Mazur computable function from X to the computable real numbers that is not Markov computable. This generalizes a result obtained by Hertling in the special case that X is the space of computable real numbers. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We point out how the "Fundamental Theorem of Stability Theory", namely the equivalence between the "non order property" and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck's "Criteres de compacite" from 1952. The familiar forms for the defining formulae then follow using Mazur's Lemma regarding weak convergence in Banach spaces.

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)

In this paper, we investigate the logical strength of two types of fixed point theorems in the context of reverse mathematics. One is concerned with extensions of the Banach contraction principle. Among theorems in this type, we mainly show that the Caristi fixed point theorem is equivalent to math formula over math formula. The other is dedicated to topological fixed point theorems such as the Brouwer fixed point theorem. We introduce some variants of the Fan-Browder fixed point theorem and (...) the Kakutani fixed point theorem, which we call math formula and math formula, respectively. Then we show that math formula is equivalent to math formula and math formula is equivalent to math formula, over math formula. In addition, we also study the application of the Fan-Browder fixed point theorem to game systems. (shrink)

In November of 1997, a letter from my professor AM came to my name. Hoodies from Ternopil Medical Academy named after. V.Ya. Gorbachevsky The letter mentioned that Arsen Richinsky was born in Kremenets'kyi, therefore the Department of Religious Studies at the Institute of Philosophy named after GS Pots of the National Academy of Sciences of Ukraine want to hold a scientific conference, whose participants should be taken immediately. [Mazur P., The immortalism of Arsen Rychinsky's memory on his native land (...) // Arsen Rychinsky - prominent Ukrainian public figure and scholar and religious scholar. Science collection. - Kyiv-Kremenets, 2007. - P. 27-32]. Motivating that the conference should be carefully prepared, we agreed with scientists of the National Academy of Sciences of Ukraine to hold the first Rychinsky readings on the basis of the school in the spring of 1998. (shrink)

Sur la décomposition des ensembles de points en parties respectivement congruentes.

In several iterations of the Gnostic ontogenetic myth, we find variations on an intriguing notion: namely, that the first rupture in the otherwise eternal and continuous procession of ‘aeons’ in the divine ‘pleroma’ is caused by a cognitive overreach and failure (the “fall of Sophia”). As much as it might contain a distant echo of certain myths concerning hubris in the classical tradition or in biblical literature, this general schema of cognitive overreach—cognitive failure—fall has no obvious parallel in Greek philosophy (...) prior to Plotinus, in some of whose more pessimistic accounts of hypostatic procession we find a similar schema, in which the generation of each ontological stratum occurs as the result of a cognitive failure on the superjacent level. If Plotinus borrowed this schema from the Gnostics, one might ask how the latter came up with it in the first place. In response, this paper makes the following three points. [1] Gnostic thinkers ultimately derived this schema from a particular juxtaposition of two profoundly aporetic Platonic passages referring to the travails of the individual soul, one certainly genuine (the description of the unexplained but catastrophic fall of the soul that fails to follow the heavenly train of the gods through the intelligible realm at Phaedrus 248c2-d3), the other quite possibly spurious (the claim that the cause of all evils is the desire, and the failure, of the soul to understand the nature of the notoriously enigmatic ‘King,’ ‘Second,’ and ‘Third,’ at 2nd Letter 312e1-313a6). [2] The Platonizing Sethian Gnostics closest to Plotinus also employed this latter source text to justify their conception of the individual soul, whose vicissitudes were understood to parallel those of Sophia. [3] This hypothesis is confirmed by evidence of tacit anti-Gnostic argumentation alluding to the 2nd Letter throughout Plotinus’ oeuvre. (shrink)

The aim of the article is to present the application of the lean management method as appropriate for the management of the organizational system of psychiatric care in the Zealand region of Denmark. The organizational solutions of the Danish psychiatric care system presented in this paper are individualized and adapted to the regional needs of the residents. In Denmark, there are five administrative regions, in which each independently organizes its own system of medical (psychiatric) care. This means that the regions (...) have considerable independence in choosing the acceptable and necessary methods of management, including – as is clear from the conducted research – the use of methods put-upon other areas of economy. Although the national laws in Denmark define certain conditions and guidelines for the functioning of psychiatric care (e.g. regarding the use of direct coercion/restrains for patients treated in the centres), there is a distinct separation of structures and methods of functioning throughout the whole country, which constitutes unique observation material – from the cognitive point of view. The authors of this paper conduct extensive research and analyse the systems of psychiatric care organizations in various countries (including Spain, Italy and Japan) and, as a result, the obtained results may lead to the selection of the best models from other systems (good organizational practices and management, the management methods in use), which can be applied in the currently reorganised system of the Polish psychiatric care. The choice of Denmark for the observational study is not accidental and is related not only to the fact that there is a large degree of systemic identity within the country and between the regions, but also because the country applies solutions addressed to patients with very different cultural conditions and needs, resulting from their descent, religion, and (world)-views. Denmark is one of those European countries that express a significant acceptance of diversity and tolerance, which is why communities with very different imponderables, denominations, and worldviews co-exist. In the area related to the organization of the psychiatric system, these conditions are of key importance. In the period from January 2015 to December 2017 the authors participated in study visits in Denmark, conducting research aimed at identifying the key success factors of the psychiatric care organization system in the country. The conducted analysis is also based on the analysis of literature and own and participant observations. The conclusions concerning this subject are also the result of interviews conducted with employees of the visited hospitals and system users, both professionals and patients. As the search for an optimal organizational model of psychiatric care is currently an ongoing concern in Poland, it seems justified to review the existing solutions in Europe and perform their critical analysis. A comparison of the adopted solutions was performed, in the context of, above all, the improvement of the quality of these services, their availability, and the satisfaction of patients and their families from the proposed organizational changes. The economic benefits of these solutions are also significant. (shrink)

Hans Morgenthau was a founder of the modern discipline of International Relations, and his Politics among Nations was for decades the dominant textbook in the field. The character of his Realism has frequently been discussed in debates on methodology and the nature of theory in International Relations. Almost all of this discussion has mischaracterized his views. The clues given in his writings, as well as his biography, point directly to Max Weber’s methodological writings. Morgenthau, it is argued, was a sophisticated (...) user of Weber’s views who self-consciously applied them in the sphere of International Relations in such a way that Realism provided an ideal-typical model of the rational and responsible statesman. This interpretation both explains Morgenthau’s views and shows them to be a serious, complex, and compelling response to the issues which have animated the controversies over International Relations theory after Waltz’s presentation of the methodological basis for his neo-Realism. (shrink)

In men, high levels of endogenous testosterone (T) seem to encourage behavior intended to dominate other people. Sometimes dominant behavior is aggressive, its apparent intent being to inflict harm on another person, but often dominance is expressed nonaggressively. Sometimes dominant behavior takes the form of antisocial behavior, including rebellion against authority and law breaking. Measurement of T at a single point in time, presumably indicative of a man's basal T level, predicts many of these dominant or antisocial behaviors. T not (...) only affects behavior but also responds to it. The act of competing for dominant status affects male T levels in two ways. First, T rises in the face of a challenge, as if it were an anticipatory response to impending competition. Second, after the competition, T rises in winners and declines in losers. Thus, there is a reciprocity between T and dominance behavior, each affecting the other. We contrast a reciprocal model, in which T level is variable, acting as both a cause and effect of behavior, with a basal model, in which T level is assumed to be a persistent trait that influences behavior. An unusual data set on Air Force veterans, in which data were collected four times over a decade, enables us to compare the basal and reciprocal models as explanations for the relationship between T and divorce. We discuss sociological implications of these models. (shrink)

We demonstrate that social capital is associated with positive food security outcomes, using survey data from 378 households in rural Uganda. We measured food security with the Household Food Insecurity Access Scale. For social capital, we measured cognitive and structural indicators, with principal components analysis used to identify key factors of the concept for logistic regression analysis. Households with bridging and linking social capital, characterized by membership in groups, access to information from external institutions, and observance of norms in groups, (...) tended to be more food secure. Households with cognitive social capital, characterized by observance of generalized norms and mutual trust, were also more food secure than others. However, we established that social capital is, by itself, insufficient. It needs to be complemented with human capital enhancement. We recommend that development interventions which focus on strengthening community associations and networks to enhance food security should support activities which enhance cognitive social capital and human capital skills. Such activities include mutual goal setting, trust building and clear communication among actors. Education efforts for community members, both formal and non-formal, should also be supported such that they potentially strengthen social capital to improve food security in rural Uganda. (shrink)

This article argues that we could improve the design of research protocols by developing an awareness of and a responsiveness to the social contexts of all the actors in the research enterprise, including subjects, investigators, sponsors, and members of the community in which the research will be conducted. ?Social context? refers to the settings in which the actors are situated, including, but not limited to, their social, economic, political, cultural, and technological features. The utility of thinking about social contexts is (...) introduced and exemplified by the presentation of a hypothetical case in which one central issue is limitation of the probability of injury to subjects by selection of individuals who are not expected to live long enough for the known risks of the study to become manifest as harms. Benefits of such considerations may include enhanced subject satisfaction and cooperation, community acceptance, and improved data quality, among other desirable consequences. (shrink)

An alternative proof is given that to each LLM proof net there corresponds at least one LLM sequent proof. The construction is inspired by the sweepline technique from computational geometry and includes a treatment of the multiplicative constants and of proof boxes.

Biomedical research on humans is an important part of medical progress. But, when lives are at risk, safety and ethical practices need to be the top priority. The need for the committees that regulate and oversee such research -- institutional review boards, or IRBs -- is growing. IRB members face difficult decisions every day. Evaluating the Science and Ethics of Research on Humans is a guide for new and veteran members of IRBs that will help them better understand the issues (...) involved and the tasks they will be required to perform. The most important purpose of an IRB is to protect the lives of human participants. For three major research areas -- drugs, medical devices, and genetic information -- Dennis J. Mazur shares the methods he has found useful in protecting human participants through the systematic review of scientific protocols and informed consent forms and through adherence to the federal regulations that apply. New members will gain understanding of how proposed research projects are to be reviewed from both scientific and ethical dimensions, how and when to ask key questions of principal investigators, how to work with principal investigators and research teams to ensure the best protection of human participants, and why to schedule regularly spaced reviews of a project that may have adverse outcomes. Based on Mazur's thirty years of research experience, this accessible and informative guide will give all IRB members the tools they need to protect human lives and facilitate the research process. (shrink)