This text addresses the profound human questions of love and work. Beginning with a historical introduction, the author progresses through adaptive problems that humans face, and concludes by showing how evolutionary psychology encompasses all branches of psychology.

Contemporary mate preferences can provide important clues to human reproductive history. Little is known about which characteristics people value in potential mates. Five predictions were made about sex differences in human mate preferences based on evolutionary conceptions of parental investment, sexual selection, human reproductive capacity, and sexual asymmetries regarding certainty of paternity versus maternity. The predictions centered on how each sex valued earning capacity, ambition— industriousness, youth, physical attractiveness, and chastity. Predictions were tested in data from 37 samples drawn from (...) 33 countries located on six continents and five islands. For 27 countries, demographic data on actual age at marriage provided a validity check on questionnaire data. Females were found to value cues toresource acquisitionin potential mates more highly than males. Characteristics signalingreproductive capacitywere valued more by males than by females. These sex differences may reflect different evolutionary selection pressures on human males and females; they provide powerful cross-cultural evidence of current sex differences in reproductive strategies. Discussion focuses on proximate mechanisms underlying mate preferences, consequences for human intrasexual competition, and the limitations of this study. (shrink)

To be autonomous is to be a law to oneself; autonomous agents are self-governing agents. Most of us want to be autonomous because we want to be accountable for what we do, and because it seems that if we are not the ones calling the shots, then we cannot be accountable. More importantly, perhaps, the value of autonomy is tied to the value of self-integration. We don't want to be alien to, or at war with, ourselves; and it seems that (...) when our intentions are not under our own control, we suffer from self-alienation. What conditions must be satisfied in order to ensure that we govern ourselves when we act? Philosophers have offered a wide range of competing answers to this question. (shrink)

This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth. The chapters are arranged so that the two introductory articles come first; (...) these are then followed by articles from core classical areas of proof theory; the handbook concludes with articles that deal with topics closely related to computer science. (shrink)

We believe we owe one another respect. We believe we ought to pay what we owe by treating one another ‘with respect.’ If we could understand these beliefs we would be well on the way to understanding morality itself. If we could justify these beliefs we could vindicate a central part of our moral experience.Respect comes in many varieties. We respect some people for their upright character, others for their exceptional achievements. There are people we respect as forces of nature: (...) we go to great lengths to accommodate their moods, wiles, and demands. Finally, most of us seem to respect people simply because they are people. This is the sort of respect of special interest to moral theory.In order to be worthy of this last sort of respect, it is not only sufficient but necessary that one be a person. We can, of course, take a similar attitude towardnonpersons. (shrink)

In this influential work, first published in English in 1963, Durkheim and Mauss claim that the individual mind is capable of classification and they seek the origin of the ‘classificatory function’ in society. On the basis of an intensive examination of forms and principles of symbolic classification reported from the Australian aborigines, the Zuñi and traditional China, they try to establish a formal correspondence between social and symbolic classification. From this they argue that the mode of classification is determined by (...) the form of society and that the notions of space, time, hierarchy, number, class and other such cognitive categories are products of society. Dr Needham’s introduction assesses the validity of Durkhiem and Mauss’s argument, traces its continued influence in various disciplines, and indicates its analytical value for future researches in social anthropology. (shrink)

Cook and Reckhow defined a propositional formulation of the pigeonhole principle. This paper shows that there are Frege proofs of this propositional pigeonhole principle of polynomial size. This together with a result of Haken gives another proof of Urquhart's theorem that Frege systems have an exponential speedup over resolution. We also discuss connections to provability in theories of bounded arithmetic.

I wish more books of philosophy were like this one. It is elegantly written. It is filled with provocative claims and ingenious arguments. It is a really good read, even while it forces us to rethink many of our assumptions about practical reason and practical reasoning, morality and agency.

My chief aim is to explain how someone can act freely against her own best judgment. But I also have a second aim: to defend a conception of practical rationality according to which someone cannot do something freely if she believes it would be better to do something else. These aims may appear incompatible. But I argue that practical reason has the capacity to undermine itself in such a way that it produces reasons for behaving irrationally. Weakness of will is (...) possible because it is possible to conclude that one has sufficient reason to reject the verdicts of one's own reason. (shrink)

Let T be a first-order theory. A T-normal Kripke structure is one in which every world is a classical model of T. This paper gives a characterization of the intuitionistic theory T of sentences intuitionistically valid in all T-normal Kripke structures and proves the corresponding soundness and completeness theorems. For Peano arithmetic , the theory PA is a proper subtheory of Heyting arithmetic , so HA is complete but not sound for PA-normal Kripke structures.

The bounded arithmetic theory S2 is finitely axiomatized if and only if the polynomial hierarchy provably collapses. If T2i equals S2i + 1 then T2i is equal to S2 and proves that the polynomial time hierarchy collapses to ∑i + 3p, and, in fact, to the Boolean hierarchy over ∑i + 2p and to ∑i + 1p/poly.

This paper discusses lower bounds for proof length, especially as measured by number of steps (inferences). We give the first publicly known proof of Gödel's claim that there is superrecursive (in fact. unbounded) proof speedup of (i + 1)st-order arithmetic over ith-order arithmetic, where arithmetic is formalized in Hilbert-style calculi with + and · as function symbols or with the language of PRA. The same results are established for any weakly schematic formalization of higher-order logic: this allows all tautologies as (...) axioms and allows all generalizations of axioms as axioms. Our first proof of Gödel's claim is based on self-referential sentences: we give a second proof that avoids the use of self-reference based loosely on a method of Statman. (shrink)

One of the most significant shifts in current thinking on war and gender is the recognition that rape in wartime is not a simple by-product of war, but often a planned and targeted policy. For many feminists ‘rape as a weapon of war’ provides a way to articulate the systematic, pervasive, and orchestrated nature of wartime sexual violence that marks it as integral rather than incidental to war. This recognition of rape as a weapon of war has taken on legal (...) significance at the Rwandan and Yugoslav Tribunals where rape has been prosecuted as a crime against humanity and genocide. In this paper, I examine how the Rwanda Tribunal’s record of judgments conceives of rape enacted as an instrument of the genocide. I consider in particular how the Tribunal’s conception of ‘rape as a weapon of war’ shapes what can be known about sexual violence and gender in the Rwandan genocide and what cannot, the categories of victims legally recognised and those that are not, and the questions pursued, and those foreclosed, about the patterns of violence before and during the genocide. (shrink)

BACKGROUND: The availability of costly safety measures against transfusion-transmissible infections forces Western countries to confront difficult ethical questions. How to decide about implementing such measures? When are such decisions justified? As a preliminary to addressing these questions, we assessed which concerns shape actual donor blood safety policymaking in five Western countries. STUDY DESIGN AND METHODS: Our qualitative study involved determining which issues had been discussed in advisory committee meetings and capturing these issues in general categories. Appropriate documents were identified in (...) collaboration with local decision-making experts in Canada, Germany, the Netherlands, the United States, and the United Kingdom. The introduction of hepatitis B virus nucleic acid testing and selected measures against variant Creutzfeldt-Jakob disease, West Nile virus, and Q-fever were chosen as cases representing decision-making on safety measures with high costs and low or uncertain added safety. RESULTS: A broad inventory of concerns was established, including: 1) nine categories of advantages and disadvantages of candidate safety policies; 2) six kinds of difficulties in assessing risks and forecasting the effects of safety policies; 3) 13 decision-making principles; and 4) six kinds of practical barriers hampering the translation of candidate policies into decisions. CONCLUSION: Blood safety policymaking involves a wide variety of competing concerns, and approaches to reconcile these considerations are themselves contested. Developing a systematic decision-making approach requires ethical reflection on, among others, reasonable costs of safety and the value of transparency in public policy. (shrink)

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.

We study the long-standing open problem of giving$\forall {\rm{\Sigma }}_1^b$separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the$\forall {\rm{\Sigma }}_1^b$Herbrandized ordering principle is unprovable in a fragment of bounded arithmetic that includes the injective weak pigeonhole principle for polynomial time functions, and also in a fragment that includes the surjective weak pigeonhole (...) principle for FPNPfunctions. We further give new propositional translations, in terms of random resolution refutations, for the consequences of$T_2^1$augmented with the surjective weak pigeonhole principle for polynomial time functions. (shrink)

The paper proves refined feasibility properties for the disjunction property of intuitionistic propositional logic. We prove that it is possible to eliminate all cuts from an intuitionistic proof, propositional or first-order, without increasing the Horn closure of the proof. We obtain a polynomial time, interactive, realizability algorithm for propositional intuitionistic proofs. The feasibility of the disjunction property is proved for sequents containing Harrop formulas. Under hardness assumptions for NP and for factoring, it is shown that the intuitionistic propositional calculus does (...) not always have polynomial size proofs and that the classical propositional calculus provides a superpolynomial speedup over the intuitionistic propositional calculus. The disjunction property for intuitionistic propositional logic is proved to be P-hard by a reduction to the circuit value problem. (shrink)

This paper considers the computational complexity of the disjunction and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A v B, a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunction property, namely, there is a superexponential lower bound on the time required, given a proof of A v B, to (...) produce one of A and B which is true. In addition, there is superexponential lower bound on the size of terms which fulfill the existential property of intuitionistic predicate logic. There are superexponential upper bounds for these problems, so the lower bounds are essentially optimal. (shrink)

Contemporary mate preferences can provide important clues to human reproductive history. Little is known about which characteristics people value in potential mates. Five predictions were made about sex differences in human mate preferences based on evolutionary conceptions of parental investment, sexual selection, human reproductive capacity, and sexual asymmetries regarding certainty of paternity versus maternity. The predictions centered on how each sex valued earning capacity, ambition— industriousness, youth, physical attractiveness, and chastity. Predictions were tested in data from 37 samples drawn from (...) 33 countries located on six continents and five islands. For 27 countries, demographic data on actual age at marriage provided a validity check on questionnaire data. Females were found to value cues toresource acquisitionin potential mates more highly than males. Characteristics signalingreproductive capacitywere valued more by males than by females. These sex differences may reflect different evolutionary selection pressures on human males and females; they provide powerful cross-cultural evidence of current sex differences in reproductive strategies. Discussion focuses on proximate mechanisms underlying mate preferences, consequences for human intrasexual competition, and the limitations of this study. (shrink)

In the context of a largely exploratory inquiry, I warn against oversimplifying the relationships among intuitions, emotions, principle-governed reasoning, and responsiveness to reasons. I point out that one cannot determine the normative status of some fact without determining whether a case can be made for this status. But I also note that, though reason is thus autonomous, every episode of reasoning depends causally on the way things nonnormatively are, and this makes it possible for any reasoner to challenge even her (...) most basic normative assumptions. (shrink)

Griffiths et al. have proposed a quantitative measure of causal specificity and used it to assess various attempts to single out genetic causes as being causally more specific than other cellular mechanisms, for example, alternative splicing. Focusing in particular on developmental processes, they have identified a number of important challenges for this project. In this discussion note, I would like to show how these challenges can be met.

We survey the best known lower bounds on symbols and lines in Frege and extended Frege proofs. We prove that in minimum length sequent calculus proofs, no formula is generated twice or used twice on any single branch of the proof. We prove that the number of distinct subformulas in a minimum length Frege proof is linearly bounded by the number of lines. Depthd Frege proofs ofm lines can be transformed into depthd proofs ofO(m d+1) symbols. We show that renaming (...) Frege proof systems are p-equivalent to extended Frege systems. Some open problems in propositional proof length and in logical flow graphs are discussed. (shrink)

We give a uniform proof of the theorems of Yao and Beigel–Tarui representing ACC predicates as constant depth circuits with MODm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {MOD}_{m}$$\end{document} gates and a symmetric gate. The proof is based on a relativized, generalized form of Toda’s theorem expressed in terms of closure properties of formulas under bounded universal, existential and modular counting quantifiers. This allows the main proofs to be expressed in terms of formula classes instead of Boolean circuits. (...) The uniform version of the Beigel–Tarui theorem is then obtained automatically via the Furst–Saxe–Sipser and Paris–Wilkie translations. As a special case, we obtain a uniform version of Razborov and Smolensky’s representation of AC0[p]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {AC}^{0}[p]$$\end{document} circuits. The paper is partly expository, but is also motivated by the desire to recast Toda’s theorem, the Beigel–Tarui theorem, and their proofs into the language of bounded arithmetic. However, no knowledge of bounded arithmetic is needed. (shrink)

We give a combinatorial analysis (using edge expansion) of a variant of the iterative expander construction due to Reingold, Vadhan, and Wigderson [44], and show that this analysis can be formalized in the bounded arithmetic system VNC^1 (corresponding to the “NC^1 reasoning”). As a corollary, we prove the assumption made by Jeřábek [28] that a construction of certain bipartite expander graphs can be formalized in VNC^1 . This in turn implies that every proof in Gentzen's sequent calculus LK of a (...) monotone sequent can be simulated in the monotone version of LK (MLK) with only polynomial blowup in proof size, strengthening the quasipolynomial simulation result of Atserias, Galesi, and Pudlák [9]. (shrink)

The study explains the perception of the nation in the political thinking of Svetozár Hurban Vajanský, which is founded on primordialist starting points and has a holistic character. In this context, the relationship between the nationally conscious elite and the people is analysed in more detail. The ambivalence of Vajanský’s political thinking is evident in the fact that, in many ways, he formally promotes Ľudovít Štúr’s original idea of unity, but, within Slovak political discourse, he promotes the idea of programme (...) uniformity. Subsequently, this becomes a source of cultural and political isolationism. This fact is complemented in parallel by reflecting the primary acculturation importance of the national elite in developing the national consciousness of the population. Vajanský also incorporated the idea of Slavic mutuality into the national emancipation concept of developing Slovak national identity. Its content is in line with Štúr’s ethnic romanticism. The historicist concept of the development of Slavs under Russian protection also appears in his thinking. Vajanský’s Russophilism was, thus, loosely tied to the ideas of Russian Slavophiles and the idealising perspective of the Slavs’ civilisational mission, who were to form a new, more spiritual and culturally advanced, civilisation circle compared with the morally declining nations of the West. (shrink)

An original and insightful account of nature and our place in it from one of France’s preeminent historians of philosophy. One of France’s preeminent historians of philosophy, Marcel Conche has written and translated more than thirty-five books and is recognized for his groundbreaking and authoritative work in Greek philosophy, as well as on Montaigne. In Philosophizing ad Infinitum, one of his most remarkable and daring books, Conche articulates a unique and powerful understanding of nature, inclusive of humanity, as infinite (...) in time and space—ever self-renewing, eternal, and beyond complete understanding or control. In today’s world the notion of infinity is at the core of the crisis humanity faces understanding nature. For the last two hundred years economies have been running at full speed, fueled by the implicit belief that natural resources are infinite; however, it is clear that they are not and that humanity needs to radically rethink the foundations of environmental and economic systems. Conche seeks to begin this rethinking, illustrating along the way insightful and sometimes unorthodox ideas about Plato, Aristotle, Epicurus, Montaigne, Nietzsche, Bergson, and others. “Philosophizing ad Infinitum: this book paints a perfect picture of the life of Marcel Conche, a natural-born philosopher. His aptitude to question absolutely everything drove him to the pre-Socratics, even at an early age, in his relentless quest for the truth. With Montaigne, the thinker to whom he feels most akin, Marcel Conche stands tall as an exceptional figure in contemporary French philosophy, renewing and enriching a great philosophical tradition.” — Françoise Dastur, University of Nice Sophia Antipolis. (shrink)

Originating from work in operations research the cutting plane refutation systemCP is an extension of resolution, where unsatisfiable propositional logic formulas in conjunctive normal form are recognized by showing the non-existence of boolean solutions to associated families of linear inequalities. Polynomial sizeCP proofs are given for the undirecteds-t connectivity principle. The subsystemsCP q ofCP, forq≥2, are shown to be polynomially equivalent toCP, thus answering problem 19 from the list of open problems of [8]. We present a normal form theorem forCP (...) 2-proofs and thereby for arbitraryCP-proofs. As a corollary, we show that the coefficients and constant terms in arbitrary cutting plane proofs may be exponentially bounded by the number of steps in the proof, at the cost of an at most polynomial increase in the number of steps in the proof. The extensionCPLE +, introduced in [9] and there shown top-simulate Frege systems, is proved to be polynomially equivalent to Frege systems. Lastly, since linear inequalities are related to threshold gates, we introduce a new threshold logic and prove a completeness theorem. (shrink)

We give the first systematic study of strong isomorphism reductions, a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n in both (...) classes. Furthermore, in a more general setting we address the question of the existence of a maximal element in the partial ordering of the degrees. (shrink)

We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems, and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in Frege proof systems compared to lengths in these new systems. As applications we give near-linear simulations of the propositional Gentzen sequent calculus and the natural deduction calculus by Frege proofs. The length of a proof is the number of lines (...) in the proof. A general deduction Frege proof system provides at most quadratic speedup over Frege proof systems. A nested deduction Frege proof system provides at most a nearly linear speedup over Frege system where by "nearly linear" is meant the ratio of proof lengths is O) where α is the inverse Ackermann function. A nested deduction Frege system can linearly simulate the propositional sequent calculus, the tree-like general deduction Frege calculus, and the natural deduction calculus. Hence a Frege proof system can simulate all those proof systems with proof lengths bounded by O). Also we show that a Frege proof of n lines can be transformed into a tree-like Frege proof of O lines and of height O. As a corollary of this fact we can prove that natural deduction and sequent calculus tree-like systems simulate Frege systems with proof lengths bounded by O. (shrink)

Several authors have used the notion of causal specificity in order to defend non-parity about genetic causes (Waters 2007, Woodward 2010, Weber 2017, forthcoming). Non-parity in this context is the idea that DNA and some other biomolecules that are often described as information-bearers by biologists play a unique role in life processes, an idea that has been challenged by Developmental Systems Theory (e.g., Oyama 2000). Indeed, it has proven to be quite difficult to state clearly what the alleged special role (...) of genetic causes consists in. In this paper, I show that the set of biomolecules that are normally considered to be information-bearers (DNA, mRNA) can be shown to be the most specific causes of protein primary structure, provided that causal specificity is measured over a relevant space of biological possibilities, disregarding physical as well as logically possible states of the causal variables. (shrink)

Saving the phenomena is shaping the phenomena: recognising that a specific phenomenon exists implies the existence of a mechanism that gives rise to the phenomenon and that the phenomenon has a shape. These two aspects are inextricably connected: determining the best shape is determining the mechanism that produces it. What is best then depends on evaluating the nature of the simplicity of the mechanism.