This book contains new essays in honor of Melvin J. Lerner, a pioneer in the psychological study of justice. The contributors to this volume are internationally renowned scholars from psychology, business, and law. They examine the role of justice motivation in a wide variety of contexts, including workplace violence, affirmative action programs, helping or harming innocent victims and how people react to their own fate. Contributors explore fundamental issues such as whether people's interest in justice is motivated by self-interest (...) or a genuine concern for the welfare of others, when and why people feel a need to punish transgressors, how a concern for justice emerges during the development of societies and individuals, and the relation of justice motivation to moral motivation. How an understanding of justice motivation can contribute to the amelioration of major social problems is also examined. (shrink)

The revival of interest in pragmatism and its practical relevance for democracy has prompted a reconsideration of John Dewey’s political philosophy. Dewey’s _The Public and Its Problems _ constitutes his richest and most systematic meditation on the future of democracy in an age of mass communication, governmental bureaucracy, social complexity, and pluralism. Drawing on his previous writings and prefiguring his later thinking, Dewey argues for the importance of civic participation and clarifies the meaning and role of the state, the proper (...) relationship between the public and experts, and the source of democracy’s legitimacy. These themes remain as important today as they were when Dewey first engaged them, and this is the work to which scholars consistently turn when assessing Dewey’s conception of democracy and what might be imagined for democracy in our own time. In this carefully annotated edition, Melvin L. Rogers provides an introductory essay that elucidates the philosophical and historical background of _The Public and Its Problems_ while explaining the key ideas of the book. He also provides a biographical outline of Dewey’s life and bibliographical notes to assist student and scholar alike. (shrink)

In this paper, I will identify two problems of trust in an AI-relevant context: a theoretical problem and a practical one. I will identify and address a number of skeptical challenges to an AI-relevant theory of trust. In addition, I will identify what I shall term the ‘scope challenge’, which I take to hold for any AI-relevant theory of trust that purports to be representationally adequate to the multifarious forms of trust and AI. Thereafter, I will suggest how trust-engineering, a (...) position that is intermediate between the modified pure rational-choice account and an account that gives rise to trustworthy AI, might allow us to address the practical problem of trust, before identifying and critically evaluating two candidate trust-engineering approaches. (shrink)

Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is presented, so the paper is relatively self-contained.

This is a thorough treatment of first-order modal logic. The book covers such issues as quantification, equality (including a treatment of Frege's morning star/evening star puzzle), the notion of existence, non-rigid constants and function symbols, predicate abstraction, the distinction between nonexistence and nondesignation, and definite descriptions, borrowing from both Fregean and Russellian paradigms.

The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the inherent non-monotonicity of its negation, something that does not have close parallels with the machinery of other programming paradigms. Nonetheless, much of the work on logic programming semantics seems to exist side by side with similar work done for imperative and functional programming, with relatively minimal contact (...) between communities. In this paper we summarize one variety of approaches to the semantics of logic programs: that based on fixpoint theory. We do not attempt to cover much beyond this single area, which is already remarkably fruitful. We hope readers will see parallels with, and the divergences from the better known fixpoint treatments developed for other programming methodologies. (shrink)

Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.

“The primary purpose of this book has been to provide a single source of containing the basic information about systematic and theoretical psychology which any student of psychology should have. It is mainly directed at the senior undergraduate major and the beginning of the graduate student.”-Publisher.

Few thinkers exerted a greater influence upon British thought and public policy between 1880 and 1914 than T. H. Green. In his appraisal Richter applies to Green, usually studied as a philosopher, the techniques of analysis taken from sociology and the history of ideas. The result is important both as a study of a man who considerably affected the thought of his time and also as a contribution to the social and intellectual history of Victorian England. The chapter headings include: (...) Idealism and the Crisis of the Evangelical Conscience; Metaphysical Foundations; the Principles of Political Obligation; From the Old Liberalism to the New: Private Property, Capitalism and State Intervention; and the Life of Citizenship. (shrink)

Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap’s four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical two-valued setting, but the result provides (...) a natural semantics for distributed logic programs, including those involving confidence factors. The classical two-valued and the Kripke/Kleene three-valued semantics become special cases, since the logics involved are natural sublogics of Belnap’s logic, the logic given by the simplest bilattice. (shrink)

A well-known problem with Hintikka-style logics of knowledge is that of logical omniscience. One knows too much. This breaks down into two subproblems: one knows all tautologies, and one’s knowledge is closed under consequence. A way of addressing the second of these is to move from knowledge simpliciter, to knowledge for a reason. Then, as consequences become ‘further away’ from one’s basic knowledge, reasons for them become more complex, thus providing a kind of resource measurement. One kind of reason is (...) a formal proof. Sergei Artemov has introduced a logic of explicit proofs, LP. I present a semantics for this, based on the idea that it is a logic of knowledge with explicit reasons. A number of fundamental facts about LP can be established using this semantics. But it is equally important to realize that it provides a natural logic of more general applicability than its original provenance, arithmetic provability. (shrink)

Among non-monotonic systems of reasoning, non-monotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been established concerning these logics. In this paper we introduce non-monotonic modal logics based on many-valued logics, rather than on classical logic. This extends earlier work of ours on many-valued modal logics. Intended applications are to situations involving several reasoners, not just one (...) as in the standard development. (shrink)

A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the semantics: true, false, neither, both. Inconsistent programs are allowed, but inconsistencies remain localized. The four-valued logic is a well-known one, due to Belnap, and is the simplest example of Ginsberg’s bilattice notion. An efficient implementation based on semantic tableaux is sketched; it reduces to SLD resolution when negations are not involved. The resulting system (...) can give reasonable answers to queries that involve both negation and free variables. Also it gives the same results as Prolog when there are no negations. Finally, an implementation in Prolog is given. (shrink)

A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of leanTAP as a sequent calculus provides a new perspective on it and, in some ways, makes it easier to understand. It is also easier to verify correctness and completeness of the Prolog implementation. In addition, it suggests extensions to other logics, some of which are considered here.

This vibrant collection of papers by an interdisciplinary group of authors -- psychologists, theologians, and social scientists -- presents brilliant new perspectives on spirituality, ethics, and relationship. In their diversity of views, their Intellectual and spiritual dynamism, the authors bring power and hope to this subject so central to the human experience.

After publishing the first part of Democracy in America, Tocqueville travelled through England and Ireland. With his impressions of the early industrial revolution still fresh, he read and annotated Machiavelli's Florentine Histories. Tocqueville's interest was present-minded: could Florence be used 'as an argument for or against democracy in our time?' Rejecting charges that modern democracies share the defects that bought down the Florentine Republic, Tocqueville contrasted late medieval and modern republicanisms; direct and representative democracies; the politics of city states to (...) those of larger modern nations with substantial urban and rural populations. Comparing renaissance Florence to industrial revolution Manchester and Birmingham led Tocqueville to consider redefining equality in economic rather than purely social terms. These notes suggest that in 1836, he held a view of the relationships between manufacturers and workers different from that of his later chapter 'How Industry could Give Rise to Aristocracy' in the 1840 Democracy. (shrink)

First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, as well as the well-known problems with equality, non-rigid designators, definite descriptions, and nondesignating terms. We show how all these problems disappear when modal language is made more expressive in a simple, natural way. We present a semantic tableaux system for the enhanced logic, and (very) briefly discuss implementation issues.

The family of all stable models for a logic program has a surprisingly simple overall structure, once two naturally occurring orderings are made explicit. In a so-called knowledge ordering based on degree of definedness, every logic program P has a smallest stable model, sk P — it is the well-founded model. There is also a dual largest stable model, S k P, which has not been considered before. There is another ordering based on degree of truth. Taking the meet and (...) the join, in the truth ordering, of the two extreme stable models sk P and S.. (shrink)

This is an expository paper in which the basic ideas of a family of Justification Logics are presented. Justification Logics evolved from a logic called LP, introduced by Sergei Artemov [1, 3], which formed the central part of a project to provide an arithmetic semantics for propositional intuitionistic logic. The project was successful, but there was a considerable bonus: LP came to be understood as a logic of knowledge with explicit justifications and, as such, was capable of addressing in a (...) natural way long-standing problems of logical omniscience. Since then, LP has become one member of a family of related logics, all logics of knowledge with explicit knowledge terms. In this paper the original problem of intuitionistic foundations is discussed only briefly. We concentrate entirely on issues of reasoning about knowledge. (shrink)

One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if terms are allowed to be non-rigid, a scoping mechanism (usually written using lambda abstraction) must also be introduced to avoid ambiguity. Since quantifiers are not present, this is not really a first-order logic, but it is not exactly propositional either. For propositional logics such as K, T and D, adding such machinery produces (...) a decidable logic, but adding it to S5 produces an undecidable one. Further, if an equality symbol is in the language, and interpreted by the equality relation, logics from K4 to S5 yield undecidable versions. (Thus transitivity is the villain here.) The proof of undecidability consists in showing that classical first-order logic can be embedded. (shrink)

First we have individual variables, as usual in first-order logics. (We do not have individual constants, but this is a minor point.) The propositional logic LP has justification constants, but in FOLP these are generalized to allow individual variables as arguments. Thus we have as justification constants c, c(x), c(x, y), . . . . Similarly LP has justification variables, but in FOLP these can be parametrized with individual variables p, p(x), p(x, y), . . . . To keep terminology (...) in line with past papers, we will still refer to things as justification constants and justification variables, even though they have structure to them. As in LP, justification terms are built up from justification constants and justification variables using ·, +, ! as usual. In addition there is a new constructor, genx, introduced by Artemov, and there is one further new constructor, exsx, introduced in this paper. If t is a justification term and x is an individual variable, genxt and exsxt are justification terms. An individual variable x is free in a justification term unless it is bound by genx or exsx. More specifically, the free variables of p(x, y, . . .) and of c(x, y, . . .) are {x, y, . . .}, the free variables of s · t and of s + t are the free variables of s together with the free variables of t, the free variables of !s are the free variables of s, and the free variables of genxt and of exsxt are the free variables of t except for x. Formulas are built up from atomic formulas, including ⊥, in the way standard in first-order logic, together with the additional formation rule: t:X is a formula provided t is a justification term, X is a formula, and all free variables of X occur in t. We assume ⊃, ⊥, and ∀ are basic, with other connectives and quantifier defined. The axiomatization used here is a combination of an LP axiomatization and a standard axiomatization of first-order logic, together with a version of the Barcan formula, and one additional axiom that corresponds to the converse Barcan formula.. (shrink)

The purpose of this essay is to both discuss commands as a species of speech act and to discuss commands within the broader framework of how they are used and ...

One approach to the paradoxes of self-referential languages is to allow some sentences to lack a truth value (or to have more than one). Then assigning truth values where possible becomes a fixpoint construction and, following Kripke, this is usually carried out over a partially ordered family of three-valued truth-value assignments. Some years ago Matt Ginsberg introduced the notion of bilattice, with applications to artificial intelligence in mind. Bilattices generalize the structure Kripke used in a very natural way, while making (...) the mathematical machinery simpler and more perspicuous. In addition, work such as that of Yablo fits naturally into the bilattice setting. What I do here is present the general background of bilattices, discuss why they are natural, and show how fixpoint approaches to truth in languages that allow self-reference can be applied. This is not new work, but rather is a summary of research I have done over many years. (shrink)

Justification logics are logics of knowledge in which explicit reasons are formally represented. Standard logics of knowledge have justification logic analogs. Connecting justification logics and logics of knowledge are Realization Theorems. In this paper we give a new, constructive proof of the Realization Theorem connecting S5 and its justification analog, JS5. This proof is, I believe, the simplest in the literature.

_The Undiscovered Dewey_ explores the profound influence of evolution and its corresponding ideas of contingency and uncertainty on John Dewey's philosophy of action, particularly its argument that inquiry proceeds from the uncertainty of human activity. Dewey separated the meaningfulness of inquiry from a larger metaphysical story concerning the certainty of human progress. He then connected this thread to the way in which our reflective capacities aid us in improving our lives. Dewey therefore launched a new understanding of the modern self (...) that encouraged intervention in social and natural environments but which nonetheless demanded courage and humility because of the intimate relationship between action and uncertainty. Melvin L. Rogers explicitly connects Dewey's theory of inquiry to his religious, moral, and political philosophy. He argues that, contrary to common belief, Dewey sought a place for religious commitment within a democratic society sensitive to modern pluralism. Against those who regard Dewey as indifferent to moral conflict, Rogers points to Dewey's appreciation for the incommensurability of our ethical commitments. His deep respect for modern pluralism, argues Rogers, led Dewey to articulate a negotiation between experts and the public so that power did not lapse into domination. Exhibiting an abiding faith in the reflective and contestable character of inquiry, Dewey strongly engaged with the complexity of our religious, moral, and political lives. (shrink)

An interpolation theorem holds for many standard modal logics, but first order $S5$ is a prominent example of a logic for which it fails. In this paper it is shown that a first order $S5$ interpolation theorem can be proved provided the logic is extended to contain propositional quantifiers. A proper statement of the result involves some subtleties, but this is the essence of it.

£ The existence of a model for a logic program is generally established by lattice-theoretic arguments. We present three examples to show that metric methods can often be used instead, generally in a direct, straightforward way. One example is a game program, which is not stratified or locally stratified, but which has a unique supported model whose existence is easily established using metric methods. The second example is a program without a unique supported model, but having a part that is (...) ‘well-behaved.’ The third example is a program in which one part depends on another, illustrating how modularity might be treated metrically. Finally we use ideas from this third example to prove a general result from [3]. The intention in presenting these examples and the theorem is to stimulate interest in.. (shrink)

The long-tailed macaque (Macaca fascicularis fascicularis) is a non-human primate species that is native to Singapore. From mid-2020, the Nanyang Technological University campus witnessed a sharp increase in the number of human–macaque encounters. In this article, we will first identify a set of technological tools that we have developed to guide decision- and policy-making on the wildlife management front and mitigate human–macaque conflict. Thereafter, we will describe how we applied these tools to the activity log cataloguing the macaque activity on (...) campus and offer an analysis of the trends in macaque behaviour that may be shared with members of the public and affected residents. Among the results that will be discussed are the following: a significant decline in the number of macaque sightings at Student Residences over the weekend, a majority of the reported macaque sightings occurring in the early evening, no significant difference in the damage and proximity scores over time, and a trend in observed macaque activity at critical sleep-relevant time intervals and areas on campus. We hope that our approach will promote, through an improved and data-driven understanding of macaque behavioural trends, technology-assisted decision-making and a more harmonious co-existence between humans and macaques on campus and in Singapore. Last but not least, we anticipate further extensions of our approach with respect to other forms of wildlife. (shrink)

We present non-clausal resolution systems for propositional modal logics whose Kripke models do not involve symmetry, and for first order versions whose Kripke models do not involve constant domains. We give systems for K, T , K4 and S4; other logics are also possible. Our systems do not require preliminary reduction to a normal form and, in the first order case, intermingle resolution steps with Skolemization steps.

Guiding you through the topics that shape aesthetics, this introduction explores the truth, meaning, taste, aesthetic merit and the role of perception. Each chapter offers a wealth of examples from Asia, including Sonny Liew's The Art of Charlie Chan Hock Chye, Tan Tai Yong, Kueh Appreciation Day and dragon kiln pottery. They deal with controversies and address central questions, such as: When are artworks considered dangerous? Why does Socrates recommend the banishment of the poets? What are the problems and challenges (...) posed by forgery? Here is a creative and accessible introduction that inspires a love for art and aesthetics. (shrink)