In recent years, there has been a substantial amount of work in reverse mathematics concerning natural mathematical principles that are provable from RT, Ramsey's Theorem for Pairs. These principles tend to fall outside of the "big five" systems of reverse mathematics and a complicated picture of subsystems below RT has emerged. In this paper, we answer two open questions concerning these subsystems, specifically that ADS is not equivalent to CAC and that EM is not equivalent to RT.

We study theorems of ordered groups from the perspective of reverse mathematics. We show that suffices to prove Hölder's Theorem and give equivalences of both (the orderability of torsion free nilpotent groups and direct products, the classical semigroup conditions for orderability) and (the existence of induced partial orders in quotient groups, the existence of the center, and the existence of the strong divisible closure).

It is known that the spaces of orders on orderable computable fields can represent all Π10 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent Π10 classes in even a weak manner. Next, we consider presentations of ordered abelian groups, and we show that there is a computable ordered abelian group for which no computable presentation admits a computable set of representatives for its Archimedean classes.

The fundamental question in reverse mathematics is to determine which set existence axioms are required to prove particular theorems of mathematics. In addition to being interesting in their own right, answers to this question have consequences in both effective mathematics and the foundations of mathematics. Before discussing these consequences, we need to be more specific about the motivating question.Reverse mathematics is useful for studying theorems of either countable or essentially countable mathematics. Essentially countable mathematics is a vague term that is (...) best explained by an example. Complete separable metric spaces are essentially countable because, although the spaces may be uncountable, they can be understood in terms of a countable basis. Simpson gives the following list of areas which can be analyzed by reverse mathematics: number theory, geometry, calculus, differential equations, real and complex analysis, combinatorics, countable algebra, separable Banach spaces, computability theory, and the topology of complete separable metric spaces. Reverse mathematics is less suited to theorems of abstract functional analysis, abstract set theory, universal algebra, or general topology.Section 2 introduces the major subsystems of second order arithmetic used in reverse mathematics: RCA0, WKL0, ACA0, ATR0 and – CA0. Sections 3 through 7 consider various theorems of ordered group theory from the perspective of reverse mathematics. Among the results considered are theorems on ordered quotient groups, groups and semigroup conditions which imply orderability, the orderability of free groups, Hölder's Theorem, Mal'tsev's classification of the order types of countable ordered groups. (shrink)

We examine the Dual Ramsey Theorem and two related combinatorial principles VW(k,l) and OVW(k,l) from the perspectives of reverse mathematics and effective mathematics. We give a statement of the Dual Ramsey Theorem for open colorings in second order arithmetic and formalize work of Carlson and Simpson [1] to show that this statement implies ACA 0 over RCA 0 . We show that neither VW(2,2) nor OVW(2,2) is provable in WKL 0 . These results give partial answers to questions posed by (...) Friedman and Simpson [3]. (shrink)

We analyze three applications of Ramsey’s Theorem for 4-tuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramsey’s Theorem while the application in lattice theory is shown to be provable in the weaker system RCA0.

The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are independent even when restricted to groups which admit computable orders.

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {A}$$\end{document} of a computably enumerable, model complete theory, the entire elementary diagram E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E$$\end{document} must be decidable. We prove that indeed a c.e. theory T is model complete if and only if there is a (...) uniform procedure that succeeds in deciding E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E$$\end{document} from the atomic diagram Δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta $$\end{document} for all countable models A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {A}$$\end{document} of T. Moreover, if every presentation of a single isomorphism type A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {A}$$\end{document} has this property of relative decidability, then there must be a procedure with succeeds uniformly for all presentations of an expansion \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} by finitely many new constants. (shrink)

We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune free degrees, lowness for isomorphism is entirely independent of computable traceability.

We study the filter ℒ*(A) of computably enumerable supersets (modulo finite sets) of an r-maximal set A and show that, for some such set A, the property of being cofinite in ℒ*(A) is still Σ0 3-complete. This implies that for this A, there is no uniformly computably enumerable “tower” of sets exhausting exactly the coinfinite sets in ℒ*(A).

We define the notion of a completely determined Borel code in reverse mathematics, and consider the principle $CD - PB$, which states that every completely determined Borel set has the property of Baire. We show that this principle is strictly weaker than $AT{R_0}$. Any ω-model of $CD - PB$ must be closed under hyperarithmetic reduction, but $CD - PB$ is not a theory of hyperarithmetic analysis. We show that whenever $M \subseteq {2^\omega }$ is the second-order part of an ω-model (...) of $CD - PB$, then for every $Z \in M$, there is a $G \in M$ such that G is ${\rm{\Delta }}_1^1$-generic relative to Z. (shrink)

We show, for each computable ordinal α and degree $\alpha > {0^{\left( \alpha \right)}}$, the existence of a torsion-free abelian group with proper α th jump degree α.

We exploit properties of certain directed graphs, obtained from the families of sets with special effective enumeration properties, to generalize several results in computable model theory to higher levels of the hyperarithmetical hierarchy. Families of sets with such enumeration features were previously built by Selivanov, Goncharov, and Wehner. For a computable successor ordinal α, we transform a countable directed graph into a structure such that has a isomorphic copy if and only if has a computable isomorphic copy.A computable structure is (...) categorical if for all computable isomorphic copies of , there is an isomorphism from onto , which is . We prove that for every computable successor ordinal α, there is a computable, categorical structure, which is not relatively categorical. This generalizes the result of Goncharov that there is a computable, computably categorical structure, which is not relatively computably categorical.An additional relation R on the domain of a computable structure is intrinsically on if in all computable isomorphic copies of , the image of R is . We prove that for every computable successor ordinal α, there is an intrinsically relation on a computable structure, which not relatively intrinsically . This generalizes the result of Manasse that there is an intrinsically computably enumerable relation on a computable structure, which is not relatively intrinsically computably enumerable.The dimension of a structure is the number of computable isomorphic copies, up to isomorphisms. We prove that for every computable successor ordinal α and every n≥1, there is a computable structure with dimension n. This generalizes the result of Goncharov that there is a structure of computable dimension n for every n≥1.Finally, we prove that for every computable successor ordinal α, there is a countable structure with isomorphic copies in just the Turing degrees of sets X such that relative to X is not . In particular, for every finite n, there is a structure with isomorphic copies in exactly the non- Turing degrees. This generalizes the result obtained by Wehner, and independently by Slaman, that there is a structure with isomorphic copies in exactly the nonzero Turing degrees. (shrink)

We construct the set of the title, answering a question of Cholak, Jockusch, and Slaman [1], and discuss its connections with the study of the proof-theoretic strength and effective content of versions of Ramsey's Theorem. In particular, our result implies that every ω-model of RCA 0 + SRT 2 2 must contain a nonlow set.

We divide the class of infinite computable trees into three types. For the first and second types, 0' computes a nontrivial self-embedding while for the third type 0'' computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite Π01 antichain. This result is optimal and has connections (...) to the program of reverse mathematics. (shrink)

We show that if H is an effectively completely decomposable computable torsion-free abelian group, then there is a computable copy G of H such that G has computable orders but not orders of every degree.

Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite $\Pi _1^0 $ chains and antichains, in infinite computable stable and weakly stable posets. For example, we extend a result of Hirschfeldt and Shore to show that every infinite computable weakly stable poset contains either an infinite low chain or an infinite computable (...) antichain. Our hardest result is that there is an infinite computable weakly stable poset with no infinite $\Pi _1^0 $ chains or antichains. On the other hand, it is easily seen that every infinite computable stable poset contains an infinite computable chain or an infinite $\Pi _1^0 $ antichain. In Reverse Mathematics, we show that SCAC, the principle that every infinite stable poset contains an infinite chain or antichain, is equivalent over RCA₀ to WSCAC, the corresponding principle for weakly stable posets. (shrink)

In this paper, we investigate the Lindenbaum algebra ℒ of the theory T fin = Th of the class M fin of all finite models of a finite rich signature. We prove that this algebra is an atomic Boolean algebra while its Gödel numeration γ is a [Formula: see text]-numeration. Moreover, the quotient algebra /ℱ, γ/ℱ) modulo the Fréchet ideal ℱ is a [Formula: see text]-algebra, which is universal over the class of all [Formula: see text] Boolean algebras. These conditions (...) characterize uniquely the algebra ℒ; moreover, these conditions characterize up to recursive isomorphism the numerated Boolean quotient algebra /ℱ, γ/ℱ). These results extend the work of Trakhtenbrot [17] and Vaught [18] on the first order theory of the class of all finite models of a finite rich signature. (shrink)

We establish that the isomorphism problem for the classes of computable nilpotent rings, distributive lattices, nilpotent groups, and nilpotent semigroups is \-complete, which is as complicated as possible. The method we use is based on uniform effective interpretations of computable binary relations into computable structures from the corresponding algebraic classes.

We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.

We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ03-condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n≥ 1 in ω, there exists a computable tree of finite height which is δ0n+1-categorical but (...) not δ0n-categorical. (shrink)

Abstract:Should the responsibilities of business managers be understood independently of the social circumstances and “market forces” that surround them, or (in accord with empiricism and the social sciences) are agents and their choices shaped by their circumstances, free only insofar as they act in accordance with antecedently established dispositions, their “character”? Virtue ethics, of which I consider myself a proponent, shares with empiricism this emphasis on character as well as an affinity with the social sciences. But recent criticisms of both (...) empiricist and virtue ethical accounts of character deny even this apparent compromise between agency and environment. Here is an account of character that emphasizes dynamic interaction both in the formation and in the interplay between personal agency and responsibility on the one hand and social pressures and the environment on the other. (shrink)

A subtle and distinguished work by a philosopher renowned for his groundbreaking analysis of human emotions, About Love.

"In the 25 essays that comprise this grimly fascinating volume, Reed shines a light into some very dark corners. From its opening tale of South African baboons with a taste for human babies to a thoroughly icky account of a middle-aged woman's seduction of young boys, these are literary snapshots of the world at its worst."--Amazon.com.

Is business ethics a contradiction in terms? Absolutely not, says Robert Solomon. In fact, he maintains that sound ethics is a necessary precondition of any long-term business enterprise, and that excellence in business must exist on the foundation of values that most of us hold dear. Drawing on twenty years of experience consulting with major corporations on ethics, Solomon clarifies the difficult ethical choices all people in business are faced with from time to time. He takes an "Aristotelian" (...) approach to ethical questions, reminding readers that a corporation--like an individual--is embedded in a community, and that corporate values such as fairness and honesty are meaningless until transformed into action. Values--coupled with action--become virtues, and virtues make possible any good business corporate relationship. Without a base of shared values, trust and mutual benefits, today's national and international business world will fall apart. In keeping with his conviction that virtue and profit must thrive together, Solomon both examines the ways in which deficient values actually destroy businesses, and debunks the pervasive myths that encourage unethical business practices. Complete with a working catalog of virtues designed to illustrate the importance of integrity in any business situation, this compelling handbook contains a goldmine of wisdom for either the small business manager or the corporate executive struggling with ethical issues. (shrink)

Machine generated contents note: Preface; Introduction; Part I. Global Health, Definitions and Descriptions: 1. What is global health? Solly Benatar and Ross Upshur; 2. The state of global health in a radically unequal world: patterns and prospects Ron Labonte and Ted Schrecker; 3. Addressing the societal determinants of health: the key global health ethics imperative of our times Anne-Emmanuelle Birn; 4. Gender and global health: inequality and differences Lesley Doyal and Sarah Payne; 5. Heath systems and health Martin McKee; Part (...) II. Global Health Ethics, Responsibilities and Justice: Some Central Issues: 6. Is there a need for global health ethics? For and against David Hunter and Angus Dawson; 7. Justice, infectious disease and globalisation Michael Selgelid; 8. International health inequalities and global justice: toward a middle ground Norman Daniels; 9. The human right to health Jonathan Wolff; 10. Responsibility for global health? Allen Buchanan and Matt DeCamp; 11. Global health ethics: the rationale for mutual caring Solly Benatar, Abdallah Daar and Peter Singer; Part III. Analyzing Some Reasons for Poor Health: 12. Trade and health: the ethics of global rights, regulation and redistribution Meri Koivusalo; 13. Debt, structural adjustment and health Jeff Rudin and David Sanders; 14. The international arms trade and global health Salahaddin Mahmudi-Azer; 15. Allocating resources in humanitarian medicine Samia Hurst, Nathalie Mezger and Alex Mauron; 16. International aid and global health Anthony Zwi; 17. Climate change and health: risks and inequities Sharon Friel, Colin Butler and Anthony McMichael; 18. Animals, the environment and global health David Benatar; 19. The global crisis and global health Stephen Gill and Isabella Bakker; Part IV. Shaping the Future: 20. Health impact fund: how to make new medicines accessible to all Thomas Pogge; 21. Biotechnology and global health Hassan Masun, Justin Chakma and Abdallah Daar; 22. Food security and global health Lynn McIntyre and Krista Rondeau; 23. International taxation Gillian Brock; 24. Global health research: changing the agenda Tikki Pang; 25. Justice and research in developing countries Alex John London; 26. Values in global health governance Kearsley Stewart, Gerald T. Keusch and Arthur Kleinman; 27. Poverty, distance and two dimensions of ethics Jonathan Glover; 28. Teaching global health ethics James Dwyer; 29. Towards a new common sense: the need for new paradigms of global health Isabella Bakker and Stephen Gill; Index. (shrink)

The Joy of Philosophy is a return to some of the perennial questions of philosophy--questions about the meaning of life; about death and tragedy; about the respective roles of rationality and passion in the good life; about love, compassion, and revenge; about honesty, deception, and betrayal; and about who we are and how we think about who we are. Recapturing the heart-felt confusion and excitement that originally brings us all to philosophy, internationally renowned teacher and lecturer Robert C. Solomon (...) offers both a critique of contemporary philosophy and an invitation to engage in philosophy in a different way. He attempts to save philosophy from itself and its self-imposed diet of thin arguments and logical analysis to recover the richness and complexity of life in thought. Solomon defends the passionate life in contrast to the life of thoughtful contemplation idealized by so many philosophers, attempting to recapture the kind of philosophy that Nietzsche celebrated as a "joyful wisdom.". (shrink)

Philosophers since Aristotle have explored emotion, and the study of emotion has always been essential to the love of wisdom. In recent years Anglo-American philosophers have rediscovered and placed new emphasis on this very old discipline. The view that emotions are ripe for philosophical analysis has been supported by a considerable number of excellent publications. In this volume, Robert Solomon brings together some of the best Anglo-American philosophers now writing on the philosophy of emotion, with chapters from philosophers who (...) have distinguished themselves in the field of emotion research and have interdisciplinary interests, particularly in the social and biological sciences. The reader will find a lively variety of positions on topics such as the nature of emotion, the category of "emotion," the rationality of emotions, the relationship between an emotion and its expression, the relationship between emotion, motivation, and action, the biological nature versus social construction of emotion, the role of the body in emotion, the extent of freedom and our control of emotions, the relationship between emotion and value, and the very nature and warrant of theories of emotion. In addition, this book acknowledges that it is impossible to study the emotions today without engaging with contemporary psychology and the neurosciences, and moreover engages them with zeal. Thus the essays included here should appeal to a broad spectrum of emotion researchers in the various theoretical, experimental, and clinical branches of psychology, in addition to theorists in philosophy, philosophical psychology, moral psychology, and cognitive science, the social sciences, and literary theory. (shrink)

Friedrich Nietzsche is one of the most popular and controversial philosophers of the last 150 years. Narcissistic, idiosyncratic, hyperbolic, irreverent--never has a philosopher been appropriated, deconstructed, and scrutinized by such a disparate array of groups, movements, and schools of thought. Adored by many for his passionate ideas and iconoclastic style, he is also vilified for his lack of rigor, apparent cruelty, and disdain for moral decency. In Living with Nietzsche, Solomon suggests that we read Nietzsche from a very different (...) point of view, as a provocative writer who means to transform the way we view our lives. This means taking Nietzsche personally. Rather than focus on the "true" Nietzsche or trying to determine "what Nietzsche really meant" by his seemingly random and often contradictory pronouncements about "the Big Questions" of philosophy, Solomon reminds us that Nietzsche is not a philosopher of abstract ideas but rather of the dazzling personal insight, the provocative challenge, the incisive personal probe. He does not try to reveal the eternal verities but he does powerfully affect his readers, goading them to see themselves in new and different ways. It is Nietzsche's compelling invitation to self-scrutiny that fascinates us, engages us, and guides us to a "rich inner life." Ultimately, Solomon argues, Nietzsche is an example as well as a promulgator of "passionate inwardness," a life distinguished by its rich passions, exquisite taste, and a sense of personal elegance and excellence. (shrink)

Redrawing the Lines,the first book to focus on that interaction, brings together ten essays by key figures who have worked to connect literary theory and philosophy and to reassess the relationship between analytic and Continental ...

Is it possible to be spiritual and yet not believe in the supernatural? Can a person be spiritual without belonging to a religious group or organization? In Spirituality for the Skeptic, philosopher Robert Solomon explores what it means to be spiritual in today's pluralistic world. Based on Solomon's own struggles to reconcile philosophy with religion, this book offers a model of a vibrant, fulfilling spirituality that embraces the complexities of human existence and acknowledges the joys and tragedies of (...) life. Solomon has forged an enlightened new path that synthesizes spirituality with emotions, intellect, science, and common sense. His new paradigm, "naturalized" spirituality, establishes as its cornerstone the "thoughtful love of life"--a passionate concern for the here-and-now, and not the by-and-by. Being spiritual doesn't mean being holed up as a recluse, spending hours in meditation and contemplation, Solomon argues. It demands involvement and emotional engagement with others in the struggle to find meaning in our lives. As such, this modern-day spirituality encompasses a passionate enthusiasm for the world, the transformation of self, cosmic trust and rationality, coming to terms with fate, and viewing life as a gift, all of which are explored in depth throughout this book. Spirituality for the Skeptic answers the need for a non-institutional, non-dogmatic spirituality that leads to personal fulfillment and satisfaction. By examining the ideas of great thinkers from Socrates and Nietzsche to Buddha to Kafka, Solomon arrives at a practical vision of spirituality that should appeal to many seekers looking to make sense of the human condition. (shrink)

Philosophy has as much to do with feelings as it does with thoughts and thinking. Philosophy, accordingly, requires not only emotional sensitivity but an understanding of the emotions, not as curious but marginal psychological phenomena but as the very substance of life. In this, the second book in a series devoted to his work on the emotions, Robert Solomon presents a defense of the emotions and of sentimentality against the background of what he perceives as a long history of (...) abuse in philosophy and social thought and art and literary criticism. The title piece reopens a classic debate about the role of sentimentality in art and literature. In subsequent chapters, Solomon discusses not only such "moral sentiments" as sympathy and compassion but also grief, gratitude, love, horror, and even vengeance. He also defends, with appropriate caution, the "seven deadly sins." The emotions, at least some emotions--are essential to a well-lived life. They are or can be virtues, features of the human condition without which civilized life would be unimaginable. (shrink)

In this paper, we present a survey of the development of the technique of argument diagramming covering not only the fields in which it originated - informal logic, argumentation theory, evidence law and legal reasoning – but also more recent work in applying and developing it in computer science and artificial intelligence. Beginning with a simple example of an everyday argument, we present an analysis of it visualised as an argument diagram constructed using a software tool. In the context of (...) a brief history of the development of diagramming, it is then shown how argument diagrams have been used to analyze and work with argumentation in law, philosophy and artificial intelligence. (shrink)

People are unable to report how they decide whether to move backwards or forwards to catch a ball. When asked to imagine how their angle of elevation of gaze would change when they caught a ball, most people are unable to describe what happens although their interception strategy is based on controlling changes in this angle. Just after catching a ball, many people are unable to recognise a description of how their angle of gaze changed during the catch. Some people (...) confidently choose incorrect descriptions that would guarantee failure of interception demonstrating unconscious knowledge co-existing with systematically different conscious beliefs. Where simple solutions to important evolutionary problems exist, unconscious perception needs to be impervious to conscious beliefs. (shrink)

Reviews the book, Upheavals of thought: The intelligence of emotions by Martha C. Nussbaum . Drawing from an astounding array of sources, Nussbaum argues against the common understanding of emotions as irrational and animalistic impulses disconnected from our thoughts and reason. Rather, she argues that emotions are highly discriminating responses to what is of value and importance that are, therefore, suffused with intelligence and discernment. Nussbaum explores the structure of a wide range of emotions, in particular, compassion and love, in (...) order to show that there can be no adequate ethical theory without an adequate theory of emotional experience and meaning. 2012 APA, all rights reserved). (shrink)

Introduction -- What is ethics? -- Ethics and religion -- The history of ethics -- Ethical questions -- What is the good life? -- Why be good : the problem of justification -- Why be rational : the place of reason in ethics -- Which is right : ethical dilemmas -- Ethical concepts -- Universality -- Prudence and morals -- Happiness and the good -- Egoism and altruism -- Virtue and the virtues -- Facts and values -- Justice and equality (...) -- Rights and duties -- Ethical theories and approaches -- Teleology -- Utilitarianism -- Kant and deontology -- Social contract theory -- Ethical relativism -- Pluralism and history -- Feminist ethics -- Prologue : ethics and religion -- The Hebrew Bible -- The Ten commandments -- The New Testament -- The Qur'an -- Ancient Asia -- India : Hinduism and Buddhism -- Buddhism -- China : Confucianism and Taoism -- China : Taoism -- Plato -- Aristotle -- Epicurus -- Augustine -- Thomas Hobbes -- David Hume -- Immanuel Kant -- Mary Wollstonecraft -- John Stuart Mill -- Friedrich Nietzsche -- John Rawls. (shrink)