Three arguments based on the Greenberger-Horne-Zeilinger (GHZ) proof of the nonexistence of local hidden variables are presented. The first is a description of a simple game which a team that uses the GHZ method will always win. The second uses counterfactuals in an attempt to show that quantum theory is nonlocal in a stronger sense than is implied by the nonexistence of local hidden variables and the third describes peculiar features of time-symmetrized counterfactuals in quantum theory.

This paper is an answer to the preceding paper by Kastner, in which she continued the criticism of the counterfactual usage of the Aharonov-Bergman-Lebowitz rule in the framework of the time-symmetrized quantum theory, in particular, by analyzing the three-box “paradox.” It is argued that the criticism is not sound. Paradoxical features of the three-box example are discussed. It is explained that the elements of reality in the framework of time-symmetrized quantum theory are counterfactual statements, and therefore, even conflicting elements of (...) reality can be associated with a single system. It is shown how such “counterfactual” elements of reality can be useful in the analysis of a physical experiment (the three-box example). The validity of Kastner's application of the consistent histories approach to the time-symmetrized counterfactuals is questioned. (shrink)

The main focus of the book is the presentation of the 'inertial' view of population growth. This view provides a rather simple model for complex population dynamics, and is achieved at the level of the single species without invoking species interactions. An important part of this account is the maternal effect. Investment of mothers in the quality of their daughters makes the rate of reproduction of the current generation depend not only on the current environment, but also on the environment (...) experienced by the previous generation. (shrink)

Prominent thinkers such as Jurgen Habermas and Michael Sandel are warning that biomedical enhancements will undermine fundamental political values. Yet whether biomedical enhancements will undermine such values depends on how biomedical enhancements will function, how they will be administered and to whom. Since only few enhancements are obtainable, it is difficult to tell whether these predictions are sound. Nevertheless, such warnings are extremely valuable. As a society we must, at the very least, be aware of developments that could have harmful (...) consequences. Indeed, if important values were to be jeopardized, we should take appropriate measures to protect them. This paper focuses on four central values: solidarity, personal responsibility, equality and autonomy. It delineates the conditions under which biomedical enhancements would undermine these values. It also details the circumstances under which these values would be unaffected by enhancements as well as those under which they would be promoted. Specifying these conditions is valuable; it would enable society to prepare appropriate ethical guidelines and policy responses in advance. (shrink)

The first volume in the new critical edition of Lev Shestov's work in English, which I have been asked to coordinate. The volume includes my preface and annotations.

Historically, appearance of the quantum theory led to a prevailing view that Nature is indeterministic. The arguments for the indeterminism and proposals for indeterministic and deterministic approaches are reviewed. These include collapse theories, Bohmian Mechanics and the many-worlds interpretation. It is argued that ontic interpretations of the quantum wave function provide simpler and clearer physical explanation and that the many-worlds interpretation is the most attractive since it provides a deterministic and local theory for our physical Universe explaining the illusion of (...) randomness and nonlocality in the world we experience. (shrink)

The Many-Worlds Interpretation (MWI) is an approach to quantum mechanics according to which, in addition to the world we are aware of directly, there are many other similar worlds which exist in parallel at the same space and time. The existence of the other worlds makes it possible to remove randomness and action at a distance from quantum theory and thus from all physics.

It is argued that, although in the Many-Worlds Interpretation of quantum mechanics there is no ``probability'' for an outcome of a quantum experiment in the usual sense, we can understand why we have an illusion of probability. The explanation involves: a). A ``sleeping pill'' gedanken experiment which makes correspondence between an illegitimate question: ``What is the probability of an outcome of a quantum measurement?'' with a legitimate question: ``What is the probability that ``I'' am in the world corresponding to that (...) outcome?''; b). A gedanken experiment which splits the world into several worlds which are identical according to some symmetry condition; and c). Relativistic causality, which together with explain the Born rule of standard quantum mechanics. The Quantum Sleeping Beauty controversy and ``caring measure'' replacing probability measure are discussed. (shrink)

This is a philosophical paper in favor of the many-worlds interpretation of quantum theory. The necessity of introducing many worlds is explained by analyzing a neutron interference experiment. The concept of the “measure of existence of a world” is introduced and some difficulties with the issue of probability in the framework of the MWI are resolved.

Śiḥot maran ha-Mashgiaḥ Mohari Leṿinshṭain, zatsal -- Ḥidushe torato ʻa. Mas. B.ḳ. ṿe-liḳuṭim -- Leḳeṭ mi-maʼamraṿ mi-moreshet Daṿid Heber ṿe-ʻinyene ha-shaʻah.

It is argued that the many-worlds interpretation is by far the best interpretation of quantum mechanics. The key points of this view are viewing the wave functions of worlds in three dimensions and understanding probability through self-locating uncertainty.

Several situations, in which an empty wave causes an observable effect, are reviewed. They include an experiment showing ‘‘surrealistic trajectories’’ proposed by Englert et al. and protective measurement of the density of the quantum state. Conditions for observable effects due to empty waves are derived. The possibility (in spite of the existence of these examples) of minimalistic interpretation of Bohmian quantum mechanics in which only Bohmian positions supervene on our experience is discussed.

What is the most important reason for using Computer Vision methods in humanities research? In this article, I argue that the use of numerical representation and data analysis methods offers a new language for describing cultural artifacts, experiences and dynamics. The human languages such as English or Russian that developed rather recently in human evolution are not good at capturing analog properties of human sensorial and cultural experiences. These limitations become particularly worrying if we want to compare thousands, millions or (...) billions of artifacts—i.e. to study contemporary media and cultures at their new twenty-first century scale. When we instead use numerical measurements of image properties standard in Computer Vision, we can better capture details of a single artifact as well as visual differences between a number of artifacts–even if they are very small. The examples of visual dimensions that numbers can capture better then languages include color, shape, texture, contours, composition, and visual characteristics of represented faces, bodies and objects. The methods of finding structures and relationships in large numerical datasets developed in statistics and machine learning allow us to extend this analysis to very big datasets of cultural objects. Equally importantly, numerical image features used in Computer Vision also give us a new language to represent gradual and continuous temporal changes—something which natural languages are also bad at. This applies to both single artworks such as a film or a dance piece and also to changes in visual characteristics in millions of artifacts over decades or centuries. (shrink)

It is argued that the lesson we should learn from Bell's inequalities is not that quantum mechanics requires some kind of action at a distance, but that it leads us to believe in parallel worlds.

Argument of this text is that: to develop aesthetics of sport, we should not begin with aesthetics as philosophy of art but with aesthetics of everyday life; to start with aesthetics of sport, we should not begin with beautiful of ‘pure aesthetics’ but with the dramatic; to analyze the dramatic in sport, we should not open the analysis with analogy between theater and sport, but with sport as a sort of performance; to get at the meaning of sport as a (...) drama, we have to discuss different meanings ‘drama’ has in theory and everyday communication; to map the dramatic in sport as performance, we have to discuss some features of sport which determine its dramatics first, and its potential as spectacle later. To proceed with the argument, we have to take into account contemporary state of aesthetics, recent development of aesthetics of everyday life, and theory of performance, together with Bernard Suits’ definition of game, Gadamer’s idea of play, and Lévy-Strauss’ account on conjunctive and disjunctive ritual. (shrink)

The paper aims to provide precise proof theoretic characterizations of Myhill–Friedman-style “weak” constructive extensional set theories and Aczel–Rathjen analogous constructive set theories both enriched by Mostowski-style collapsing axioms and/or related anti-foundation axioms. The main results include full intuitionistic conservations over the corresponding purely arithmetical formalisms that are well known in the reverse mathematics – which strengthens analogous results obtained by the author in the 80s. The present research was inspired by the more recent Sato-style “weak weak” classical extensional set theories (...) whose proof theoretic strengths are shown to strongly exceed the ones of the intuitionistic counterparts in the presence of the collapsing axioms. (shrink)

We introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment (...) of GLP Λ. (shrink)

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant ‘true’ by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform reflection schemata in arithmetic, possibly of unrestricted logical complexity. We formulate an arithmetically complete calculus with modalities labeled by natural numbers and ω, where ω corresponds to the full uniform reflection schema, whereas n<ω corresponds to its restriction to arithmetical Πn+1-formulas. This (...) calculus is shown to be complete w.r.t. a suitable class of finite Kripke models and to be decidable in polynomial time. (shrink)

By a result of Paris and Friedman, the collection axiom schema for $\Sigma_{n+1}$ formulas, $B\Sigma_{n+1}$ , is $\Pi_{n+2}$ conservative over $I\Sigma_n$ . We give a new proof-theoretic proof of this theorem, which is based on a reduction of $B\Sigma_n$ to a version of collection rule and a subsequent analysis of this rule via Herbrand's theorem. A generalization of this method allows us to improve known results on reflection principles for $B\Sigma_n$ and to answer some technical questions left open by Sieg (...) [23] and Hájek [9]. We also give a new proof of independence of $B\Sigma_{n+1}$ over $I\Sigma_n$ by a direct recursion-theoretic argument and answer an open problem formulated by Gaifman and Dimitracopoulos [8]. (shrink)

Progressions of iterated reflection principles can be used as a tool for the ordinal analysis of formal systems. We discuss various notions of proof-theoretic ordinals and compare the information obtained by means of the reflection principles with the results obtained by the more usual proof-theoretic techniques. In some cases we obtain sharper results, e.g., we define proof-theoretic ordinals relevant to logical complexity Π1 0 and, similarly, for any class Π n 0 . We provide a more general version of the (...) fine structure relationships for iterated reflection principles (due to U. Schmerl [25]). This allows us, in a uniform manner, to analyze main fragments of arithmetic axiomatized by restricted forms of induction, including IΣ n , IΣ n − , IΠ n − and their combinations. We also obtain new conservation results relating the hierarchies of uniform and local reflection principles. In particular, we show that (for a sufficiently broad class of theories T) the uniform Σ1-reflection principle for T is Σ2-conservative over the corresponding local reflection principle. This bears some corollaries on the hierarchies of restricted induction schemata in arithmetic and provides a key tool for our generalization of Schmerl's theorem. (shrink)

A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for k < ω, k (...) times iterated ∑n reflection principle over EA precisely corresponds to the extension of EA by k nested applications of ∑n induction rule.The above relationship holds in greater generality than just stated. In fact, we give general formulas characterizing in terms of iterated reflection principles the extension of any given theory by k nested applications of ∑n or Πn induction rules. In particular, the closure of a theory T under just one application of ∑1 induction rule is equivalent to T together with ∑1 reflection principle for each finite Π2 axiomatized subtheory of T.These results have closely parallel ones in the theory of subrecursive function classes. The rules under study correspond, in a canonical way, to natural closure operators on the classes of provably recursive functions. Thus, ∑1 induction rule precisely corresponds to the primitive recursive closure operator, and ∑1 collection rule, introduced below, corresponds to the elementary closure operator. (shrink)

Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces are called GLP-spaces whenever they satisfy all the axioms of GLP. We develop some constructions to build nontrivial GLP-spaces and show that GLP is complete w.r.t. the class of all GLP-spaces.

We suggest an algebraic approach to proof-theoretic analysis based on the notion of graded provability algebra, that is, Lindenbaum boolean algebra of a theory enriched by additional operators which allow for the structure to capture proof-theoretic information. We use this method to analyze Peano arithmetic and show how an ordinal notation system up to 0 can be recovered from the corresponding algebra in a canonical way. This method also establishes links between proof-theoretic ordinal analysis and the work which has been (...) done in the last two decades on provability logic and reflection principles. Because of its abstract algebraic nature, we hope that it will also be of interest for non-prooftheorists. (shrink)

We elaborate Weiermann-style phase transitions for well-partial-orderings (wpo) determined by iterated finite sequences under Higman-Friedman style embedding with Gordeev’s symmetric gap condition. For every d-times iterated wpo \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}\right)}$$\end{document} in question, d > 1, we fix a natural extension of Peano Arithmetic, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T \supseteq \sf{PA}}$$\end{document}, that proves the corresponding second-order sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{WPO}\left({\rm (...) S}{\textsc{eq}}^{d}, \trianglelefteq _{d}\right) }$$\end{document}. Having this we consider the following parametrized first-order slow well-partial-ordering sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}, r\right):}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \forall K > 0 \right) \left( \exists M > 0\right) \left( \forall x_{0},\ldots,x_{M}\in {\rm S}\text{\textsc{eq}}^{d}\right)$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \left( \forall i\leq M\right) \left( \left| x_{i}\right| 1}$$\end{document} then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d},r \right) }$$\end{document} is not provable in T.Moreover, by the well-known proof theoretic equivalences we can just as well replace T by PA or ACA0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta _{1}^{1}\sf{CA}}$$\end{document}, if d = 2 and d = 3, respectively.In the limit case d → ∞ we replaceEFA-provably computable reals r by EFA-provably computable functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f: \mathbb{N} \rightarrow \mathbb{R}_{+}}$$\end{document} and prove analogous theorems. (In the sequel we denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{R}_{+}}$$\end{document} the set of EFA-provably computable positive reals). In the basic case T = PA we strengthen the basic phase transition result by adding the following static threshold clause\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1\right)}$$\end{document} is still provable in T = PA (actually in EFA). Furthermore we prove the following dynamic threshold clauses which, loosely speaking are obtained by replacing the static threshold t by slowly growing functions 1α given by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${1_{\alpha }\left( i\right)\,{:=}\,1+\frac{1}{H_{\alpha }^{-1}\left(i\right) }, H_{\alpha}}$$\end{document} being the familiar fast growing Hardy function and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H_{\alpha }^{-1}\left( i\right)\,{:=}\,\rm min \left\{ j \mid H_{\alpha } \left ( j\right) \geq i \right\}}$$\end{document} the corresponding slowly growing inversion. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha < \varepsilon _{0}}$$\end{document}, then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1_{\alpha}\right)}$$\end{document} is provable in T = PA. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left( {\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2},1_{\varepsilon _{0}}\right)}$$\end{document} is not provable in T = PA. We conjecture that this pattern is characteristic for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T\supseteq \sf{PA}}$$\end{document} under consideration and their proof-theoretical ordinals o (T ), instead of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon _{0}}$$\end{document}. (shrink)

Two recently proposed quantum experiments are analyzed. The first allows to find an object without "touching" it. The second allows to teleport quantum states, transmitting a very small amount of information. It is shown that in the standard approach these experiments are in conflict with the intuitive notions of causality and locality. It is argued that the situation is less paradoxical in the framework of the many-worlds interpretation of quantum theory.

For “natural enough” systems of ordinal notation we show that α times iterated local reflection schema over a sufficiently strong arithmetic T proves the same Π 1 0 -sentences as ω α times iterated consistency. A corollary is that the two hierarchies catch up modulo relative interpretability exactly at ε-numbers. We also derive the following more general “mixed” formulas estimating the consistency strength of iterated local reflection: for all ordinals α ⩾ 1 and all β, β ≡ Π 1 0 (...) T ω α · , α ≡ Π 1 0 T β + ω α . Here T α stands for α times iterated local reflection over T , T β stands for β times iterated consistency, and ≡ Π 1 0 denotes mutual Π 1 0 -conservativity. In an appendix to this paper we develop our notion of “natural enough” system of ordinal notation and show that such systems do exist for every recursive ordinal. (shrink)

Recently, the variety of the financial frauds have increased, while the number of victims became difficult to estimate. The purpose of this paper is to present the main profiles of financial frauds’ victims using a reviewing method. The analysis captures the main theoretical and empirical background regarding the motives and circumstances of becoming a victim, the dynamics of several social and demographical characteristics of this type of victims, as well as a sample of relevant case studies from some developing countries. (...) The main finding is that, in literature, most of the victims are male people of different ages, employed, married or single, regardless the level of education. For developing countries such as China, India and Nigeria, the majority of victims act out of naivety and desire to escape from poverty, while some victims from Latin America, China and Nigeria are influenced by greed and lack of empathy, without thinking of further consequences for their families and friends involved. Moreover, most of the victims are convinced to invest in financial schemes by family members, friends, or acquaintances. (shrink)

A well-known polymodal provability logic inlMMLBox due to Japaridze is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic. This system plays an important role in some recent applications of provability algebras in proof theory. However, an obstacle in the study of inlMMLBox is that it is incomplete w.r.t. any class of Kripke frames. In this paper we provide a complete Kripke semantics for inlMMLBox . First, we isolate a certain subsystem inlMMLBox (...) of inlMMLBox that is sound and complete w.r.t. a nice class of finite frames. Second, appropriate models for inlMMLBox are defined as the limits of chains of finite expansions of models for inlMMLBox . The techniques involves unions of n -elementary chains and inverse limits of Kripke models. All the results are obtained by purely modal-logical methods formalizable in elementary arithmetic. (shrink)

University of Pennsylvania, USA, el322{at}nyu.edu ' + u + '@' + d + ' '//--> One of the most consistent findings in experimental studies of social dilemmas is the positive influence of face-to-face communication on cooperation. The face-to-face `communication effect' has been recently explained in terms of a `focus theory of norms': successful communication focuses agents on pro-social norms, and induces preferences and expectations conducive to cooperation. 1 Many of the studies that point to a communication effect, however, do not (...) further explore whether and to what extent the communication medium affects cooperative behavior. In this article, we ask if pro-social behavior can emerge and survive in computer-mediated environments. We show that, like face-to-face communication, computer-mediated communication also positively affects cooperation in social dilemmas, but cooperation is more difficult to establish and maintain. We argue that the discrepancy between the computer-mediated and the face-to-face communication effects is a consequence of the distinct capabilities of different media to focus agents on pro-social norms and to allow them to develop mutual expectations about future behavior. Key Words: social dilemmas • laboratory experiments • communication • social norms • cooperation • computer-mediated communication. (shrink)

At IAPS Ljubljana conference (September 2007) Dag Vidar Hanstad and Sigmund Loland presented a paper on elite-level athletes' duty to provide information on their whereabouts, to decide between two opposing positions: is this WADA demand justifiable anti-doping work or an indefensible surveillance regime? They concluded that on moral grounds this regime is conditionally acceptable, the condition being the acceptability of a general framework and objectives embodied in anti-doping global legislative foundations (the World Anti-Doping Code). But, as they said, principled objections (...) against the system have more universal relevance, which has to be taken seriously . To take this ambiguous and intriguing conclusion a step further, I propose a legal rather than ethical approach, from the aspect of constitutional and international human rights law, and the possible clash of two legally acknowledged values - the concept of elite sport without doping, and the concept of individual human rights. This conflict between ideological or moral values and the legality of individual rights is not a novelty. This paper presents three instances of this conflict: Bernard de Mandeville's differentiation between public and private values; Eug ne Sue's parallel legal and civil morals; and the contemporary moralisation of law which conflates legality into morality. The subordination of legality to morality has potentially dangerous consequences: here, Agamben's 'state of exception' comes to mind, with his analysis of potestas and auctoritas. However, in the case of sport and the war against doping, the origin of power is not in the nation state; it originates in civil society's non-governmental national and international bodies recognised as autonomous sources of legal order. (shrink)

A recent claim by Meehan that quantum mechanics has a new “control problem” that puts limits on our ability to prepare quantum states and revises our understanding of the no-cloning theorem is examined. We identify flaws in Meehan’s analysis and argue that such a problem does not exist.

A brief review of the attempts to define “elements of reality” in the framework of quantum theory is presented. It is noted that most definitions of elements of reality have in common the feature to be a definite outcome of some measurement. Elements of reality are extended to pre- and post- selected systems and to measurements which fulfill certain criteria of weakness of the coupling. Some features of the newly introduced concepts are discussed.