According to Frege's principle the denotation of a sentence coincides with its truth-value. The principle is investigated within the context of abstract algebraic logic, and it is shown that taken together with the deduction theorem it characterizes intuitionistic logic in a certain strong sense.A 2nd-order matrix is an algebra together with an algebraic closed set system on its universe. A deductive system is a second-order matrix over the formula algebra of some fixed but arbitrary language. A second-order matrix A is (...) Fregean if, for any subset X of A, the set of all pairs a,b such that X{a} and X{b} have the same closure is a congruence relation on A. Hence a deductive system is Fregean if interderivability is compositional. The logics intermediate between the classical and intuitionistic propositional calculi are the paradigms for Fregean logics. Normal modal logics are non-Fregean while quasi-normal modal logics are generally Fregean.The main results of the paper: Fregean deductive systems that either have the deduction theorem, or are protoalgebraic and have conjunction, are completely characterized. They are essentially the intermediate logics, possibly with additional connectives. All the full matrix models of a protoalgebraic Fregean deductive system are Fregean, and, conversely, the deductive system determined by any class of Fregean second-order matrices is Fregean. The latter result is used to construct an example of a protoalgebraic Fregean deductive system that is not strongly algebraizable. (shrink)

A deductive system (in the sense of Tarski) is Fregean if the relation of interderivability, relative to any given theory T, i.e., the binary relation between formulas.

A deductive system \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathcal{S}$$ \end{document} (in the sense of Tarski) is Fregean if the relation of interderivability, relative to any given theory T, i.e., the binary relation between formulas\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\{ \left\langle {\alpha,\beta } \right\rangle :T,\alpha \vdash s \beta and T,\beta \vdash s \alpha \},$$ \end{document}is a congruence relation on the formula algebra. The multiterm deduction-detachment theorem is a natural generalization of the (...) deduction theorem of the classical and intuitionistic propositional calculi (IPC) in which a finite system of possibly compound formulas collectively plays the role of the implication connective of IPC. We investigate the deductive structure of Fregean deductive systems with the multiterm deduction-detachment theorem within the framework of abstract algebraic logic. It is shown that each deductive system of this kind has a deductive structure very close to that of the implicational fragment of IPC. Moreover, it is algebraizable and the algebraic structure of its equivalent quasivariety is very close to that of the variety of Hilbert algebras. The equivalent quasivariety is however not in general a variety. This gives an example of a relatively point-regular, congruence-orderable, and congruence-distributive quasivariety that fails to be a variety, and provides what apparently is the first evidence of a significant difference between the multiterm deduction-detachment theorem and the more familiar form of the theorem where there is a single implication connective. (shrink)

Theabstract variable binding calculus (VB-calculus) provides a formal frame-work encompassing such diverse variable-binding phenomena as lambda abstraction, Riemann integration, existential and universal quantification (in both classical and nonclassical logic), and various notions of generalized quantification that have been studied in abstract model theory. All axioms of the VB-calculus are in the form of equations, but like the lambda calculus it is not a true equational theory since substitution of terms for variables is restricted. A similar problem with the standard formalism (...) of the first-order predicate logic led to the development of the theory of cylindric and polyadic Boolean algebras. We take the same course here and introduce the variety of polyadic VB-algebras as a pure equational form of the VB-calculus. In one of the main results of the paper we show that every locally finite polyadic VB-algebra of infinite dimension is isomorphic to a functional polyadic VB-algebra that is obtained from a model of the VB-calculus by a natural coordinatization process. This theorem is a generalization of the functional representation theorem for polyadic Boolean algebras given by P. Halmos. As an application of this theorem we present a strong completeness theorem for the VB-calculus. More precisely, we prove that, for every VB-theory T that is obtained by adjoining new equations to the axioms of the VB-calculus, there exists a model D such that T s=t iff D s=t. This result specializes to a completeness theorem for a number of familiar systems that can be formalized as VB-calculi. For example, the lambda calculus, the classical first-order predicate calculus, the theory of the generalized quantifierexists uncountably many and a fragment of Riemann integration. (shrink)

Relatively congruence regular quasivarieties and quasivarieties of logic have noticeable similarities. The paper provides a unifying framework for them which extends the Blok-Pigozzi theory of elementarily algebraizable (and protoalgebraic) deductive systems. In this extension there are two parameters: a set of terms and a variable. When the former is empty or consists of theorems, the Blok-Pigozzi theory is recovered, and the variable is redundant. On the other hand, a class of membership logics is obtained when the variable is (...) the only element of the set of terms. For these systems the appropriate variant of equivalent algebraic semantics encompasses the relatively congruence regular quasivarieties. (shrink)

The aggregation of individual judgments on logically interconnected propositions into a collective decision on the same propositions is called judgment aggregation. Literature in social choice and political theory has claimed that judgment aggregation raises serious concerns. For example, consider a set of premises and a conclusion where the latter is logically equivalent to the former. When majority voting is applied to some propositions (the premises) it may give a different outcome than majority voting applied to another set of propositions (the (...) conclusion). This problem is known as the discursive dilemma (or paradox). The discursive dilemma is a serious problem since it is not clear whether a collective outcome exists in these cases, and if it does, what it is like. Moreover, the two suggested escape-routes from the paradox—the so-called premise-based procedure and the conclusion-based procedure—are not, as I will show, satisfactory methods for group decision-making. In this paper I introduce a new aggregation procedure inspired by an operator defined in artificial intelligence in order to merge belief bases. The result is that we do not need to worry about paradoxical outcomes, since these arise only when inconsistent collective judgments are not ruled out from the set of possible solutions. (shrink)

There exist important deductive systems, such as the non-normal modal logics, that are not proper subjects of classical algebraic logic in the sense that their metatheory cannot be reduced to the equational metatheory of any particular class of algebras. Nevertheless, most of these systems are amenable to the methods of universal algebra when applied to the matrix models of the system. In the present paper we consider a wide class of deductive systems of this kind called protoalgebraic logics. These include (...) almost all (non-pathological) systems of prepositional logic that have occurred in the literature. The relationship between the metatheory of a protoalgebraic logic and its matrix models is studied. The following results are obtained for any finite matrix model U of a filter-distributive protoalgebraic logic : (I) The extension U of is finitely axiomatized (provided has only finitely many inference rules); (II) U has only finitely many extensions. (shrink)

The paper discusses ten philosophical problems in deontic logic: how to formally represent norms, when a set of norms may be termed ‘coherent’, how to deal with normative conflicts, how contraryto-duty obligations can be appropriately modeled, how dyadic deontic operators may be redefined to relate to sets of norms instead of preference relations between possible worlds, how various concepts of permission can be accommodated, how meaning postulates and counts-as conditionals can be taken into account, and how sets of norms may (...) be revised and merged. The problems are discussed from the viewpoint of input/output logic as developed by van der Torre & Makinson. We argue that norms, not ideality, should take the central position in deontic semantics, and that a semantics that represents norms, as input/output logic does, provides helpful tools for analyzing, clarifying and solving the problems of deontic logic. (shrink)

The aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn much attention. Seemingly reasonable aggregation procedures, such as propositionwise majority voting, cannot ensure an equally consistent collective conclusion. The literature on judgment aggregation refers to such a problem as the \textit{discursive dilemma}. In this paper we assume that the decision which the group is trying to reach is factually right or wrong. Hence, we address the question of how good (...) the various approaches are at selecting the right conclusion. We focus on two approaches: distance-based procedures and a Bayesian analysis. They correspond to group-internal and group-external decision-making, respectively. We compare those methods in a probabilistic model, demonstrate the robustness of our results over various generalizations and discuss their applicability in different situations. The findings vindicate (i) that in judgment aggregation problems, reasons should carry higher weight than conclusions and (ii) that considering members of an advisory board to be highly competent is a better strategy than to underestimate their advice.". (shrink)

The Ostrogorski paradox and the discursive dilemma are seemingly unrelated paradoxes of aggregation. The former is discussed in traditional social choice theory, while the latter is at the core of the new literature on judgment aggregation. Both paradoxes arise when, in a group, each individual consistently makes a judgment, or expresses a preference, (in the form of yes or no) over specific propositions, and the collective outcome is in some respect inconsistent. While the result is logically inconsistent in the case (...) of the discursive paradox, it is not stable with respect to the level of aggregation in the case of the Ostrogorski paradox. In the following I argue that, despite these differences, the two problems have a similar structure. My conclusion will be twofold: on the one hand, the similarities between the paradoxes support the claim that these problems should be tackled using the same aggregation procedure; on the other hand, applying the same procedure to these paradoxes will help clarify the strengths and weaknesses of the aggregation method itself. More specifically, I will show that an operator defined in artificial intelligence to merge belief bases can deal with both paradoxes. (shrink)

This paper provides algorithmic options for belief revision of a database receiving an infinite stream of inputs. At stage , the database is ¡£¢ , receiving the input ¤ ¢ . The revision algorithms for moving to the new database ¡ ¢¦¥¨§© ¡ ¢ ¤ ¢ take into account the history of previous revisions actually executed as well as possible revision options which were discarded at the time but may now be pursued. The appropriate methodology for carrying this out is (...) Labelled Deductive Systems. (shrink)

This study described the relationships between academic class and student moral sensitivity and reasoning and between curriculum design components for ethics education and student moral sensitivity and reasoning. The data were collected from freshman (n = 506) and senior students (n = 440) in eight baccalaureate nursing programs in South Korea by survey; the survey consisted of the Korean Moral Sensitivity Questionnaire and the Korean Defining Issues Test. The results showed that moral sensitivity scores in patient-oriented care and conflict were (...) higher in senior students than in freshman students. Furthermore, more hours of ethics content were associated with higher principled thinking scores of senior students. Nursing education in South Korea may have an impact on developing student moral sensitivity. Planned ethics content in nursing curricula is necessary to improve moral sensitivity and moral reasoning of students. (shrink)

Judgment aggregation studies how individual opinions on a given set of propositions can be aggregated to form a consistent group judgment on the same propositions. Despite the simplicity of the problem, seemingly natural aggregation procedures fail to return consistent collective outcomes, leading to what is now known as the doctrinal paradox. The first occurrences of the paradox were discovered in the legal realm. However, the interest of judgment aggregation is much broader and extends to political philosophy, epistemology, social choice theory, (...) and computer science. The aim of this paper is to provide a concise survey of the discipline and to outline some of the most pressing questions and future lines of research. (shrink)

ment on the same propositions, and is plagued by impossibility re- 2. What is the role of independence in judgment aggregation sults. In this paper we study the central notion of independence in..

Formal arguments are often represented by pairs, but in this paper we consider normative arguments represented by sequences of triples, where constitutive norms derive institutional facts from brute facts, and regulative norms derive deontic facts like obligations and permissions from institutional facts. The institutional facts may be seen as the reasons explaining or warranting the deontic obligations and permissions, and therefore they can be attacked by other normative arguments too. We represent different aspects of normative reasoning by different kinds of (...) consistency checks among these triples, and we use formal argumentation theory to resolve conflicts among such normative arguments. In particular, we introduce various requirements for arguing about norms concerning violations, contrary-to-duty obligations, dilemmas, conflict resolution and different kinds of norms, and we introduce a formal argumentation theory satisfying the requirements. In order to illustrate our framework, we introduce a running example based on university regulations for prospective and actual students. (shrink)

The combination of individual judgments on logically interconnected propositions into a collective decision on the same propositions is called judgment aggregation. Literature in social choice and political theory has claimed that judgment aggregation raises serious concerns. For example, consider a set of premises and a conclusion in which the latter is logically equivalent to the former. When majority voting is applied to some propositions (the premises) it may give a different outcome than majority voting applied to another set of propositions (...) (the conclusion). This problem is known as the doctrinal paradox. The doctrinal paradox is a serious problem since it is not clear whether a collective outcome exists in these cases, and if it does, what it is like. Moreover, the two suggested escape-routes from the paradox - the so-called premise-based procedure and the conclusion-based procedure - are not, as I will show, satisfactory methods for group decision-making. In this paper I introduce a new aggregation procedure inspired by an operator defined in artificial intelligence in order to merge knowledge bases. The result is that we do not need to worry about paradoxical outcomes, since these arise only when inconsistent collective judgments are not ruled out from the set of possible solutions. (shrink)

In this paper we explore the relation between three areas: judgment aggregation, belief merging and social choice theory. Judgment aggregation studies how to aggregate individual judgments on logically interconnected propositions into a collective decision on the same propositions. When majority voting is applied to some propositions it may however give a different outcome than majority voting applied to another set of propositions. Starting from this so-called doctrinal paradox, the paper surveys the literature on judgment aggregation, and shows that the application (...) of a well known belief merging operator can dissolve the paradox. Finally, the use of distances is shown to establish a link between belief merging and preference aggregation in social choice theory. (shrink)

This paper presents and discusses a novel approach to indeterministic belief revision. An indeterministic belief revision operator assumes that, when an agent is confronted with a new piece of information, it can revise its belief sets in more than one way. We define a rational agent not only in terms of what it believes but also of what it desires and wants to achieve. Hence, we propose that the agent’s goals play a role in the choice of (possibly) one of (...) the several available revision options. Properties of the new belief revision mechanism are also investigated. (shrink)

Lewis’ Principal Principle (PP) aims at clarifying the connection between chance (i.e. objective probability) and credence (i.e. subjective probability). It is generally assumed that the chance that an event will occur does not depend on our credence in the occurrence of that event. Nevertheless, chances constrain our credence, and Lewis’ PP is an attempt to capture this connection.

The problem of the aggregation of inputs coming from different sources arises in several contexts. Examples are the combination of individual preferences (studied in social choice theory), opinions (judgment aggregation), and data (artificial intelligence). While a number of results are available in each of these disciplines, a question that has been addressed only recently is how similar these aggregation problems are, despite the different types of inputs they try to combine.

One of the major problems that artificial intelligence needs to tackle is the combination of different and potentially conflicting sources of information. Examples are multi-sensor fusion, database integration and expert systems development. In this paper we are interested in the aggregation of propositional logic-based information, a problem recently addressed in the literature on information fusion. It has applications in multi-agent systems that aim at aggregating the distributed agent-based knowledge into an (ideally) unique set of propositions. We consider a group of (...) autonomous agents who individually hold a logically consistent set of propositions. Each set of propositions represents an agent’s beliefs on issues on which the group has to make a collective decision. To make the collective decision, several aggregation procedures have been proposed in the literature. Assuming that all propositions in question are factually right or wrong, we ask how good belief fusion is as a truth tracker. Will it single out the true set of propositions? And how does information fusion compare with other aggregation procedures? We address these questions in a probabilistic framework and show that information fusion does especially well for agents with a middling competence of hitting the truth of an individual proposition. (shrink)

The problem of the aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn much attention. The dificulty lies in the fact that a seemingly reasonable aggregation procedure, such as propositionwise majority voting, cannot ensure an equally consistent collective outcome. The literature on judgment aggregation refers to such dilemmas as the discursive paradox. So far, three procedures have been proposed to overcome the paradox: the premise-based and conclusion-based procedures on the (...) one hand, and the merging approach on the other hand. In this paper we assume that the decision which the group is trying to reach is factually right or wrong. Hence, the question is how good the merging approach is in tracking the truth, and how it compares with the premise-based and conclusion-based procedures. (shrink)

In this essay we discuss Tarski's work on what he calledthe methodology of the deductive sciences, or more briefly, borrowing the terminology of Hilbert,metamathematics, The clearest statement of Tarski's views on this subject can be found in his textbookIntroduction to logic[41m].1Here he describes the tasks of metamathematics as “the detailed analysis and critical evaluation of the fundamental principles that are applied in the construction of logic and mathematics”. He goes on to describe what these fundamental principles are: All the expressions (...) of the discipline under consideration must be defined in terms of a small group of primitive expressions that seem immediately understandable. Furthermore, only those statements of the discipline are accepted as valid that can be deduced by precisely defined and universally accepted means from a small set of axioms whose validity seems evident. The method of constructing a discipline in strict accordance with these principles is known as thedeductive method, and the disciplines constructed in this manner are calleddeductive systems. Since contemporary mathematical logic is one of those disciplines that are subject to these principles, it itself is a deductive science. Tarski then goes on to say:“The view has become more and more common that the deductive method is the only essential feature by means of which the mathematical disciplines can be distinguished from all other sciences; not only is every mathematical discipline a deductive theory, but also, conversely, every deductive theory is a mathematical discipline”.This identification of mathematics with the deductive sciences is in our view one of the distinctive aspects of Tarski's work. Another characteristic feature is his broad view of what constitutes the domain of metamathematical investigations. A clue to this aspect of his work can also be found in Chapter 6 ofIntroduction to logic. After a discussion of the notions of completeness and consistency, he remarks that the investigations concerning these topics were among the most important factors contributing to a considerable extension of the domain of methodological studies, and caused even a fundamental change in the whole character of the methodology of deductive sciences. (shrink)

In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to (...) rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research. (shrink)

This work presents the concepts of translation and conservative translation between logics. By using algebraic semantics we introduce several conservative translations involving the classical propositional calculus and the many-valued calculi of Post and Lukasiewicz.

A record of the words and teachings of Confucius, _The Analects_ is considered the most reliable expression of Confucian thought. However, the original meaning of Confucius's teachings have been filtered and interpreted by the commentaries of Confucianists of later ages, particularly the Neo-Confucianists of the Song dynasty, not altogether without distortion.In this monumental translation by Professor D. C. Lau, an attempt has been made to interpret the sayings as they stand. The corpus of the sayings is taken as an organic (...) whole and the final test of the interpretation rests on the internal consistency it exhibits. In other words, _The Analects_ is read in the light of _The Analects._This results in a truer understanding of Confucius' thought than the traditional interpretation and paves the way for a re-assessment of its importance in the history of Chinese thought and its relevance to the present day world.This volume also contains an introduction to the life and teachings of Confucius, and three appendices on the events in the life of Confucius, on his disciples, and on the composition of _The Analects._. (shrink)

RésuméLa croyance que l'on est (ou pas) dans un état de douleur est singulière en ceci qu'elle semble pouvoir être qualifiée d'infaillibilité ou d'incorrigibilité logique, de même que le cogito. Mais comment se peut-il que l'existence d'une croyance (vraie) et l'existence du fait qui est l'objet de cette croyance puisssent constituer la même existence? Je propose ici une réponse à cette question. Parfois, une croyance peut être un désir.

We propose a kernel method for using combinations of features across example pairs in learning pairwise classifiers. Pairwise classifiers, which identify whether two examples belong to the same class or not, are important components in duplicate detection, entity matching, and other clustering applications. Existing methods for learning pairwise classifiers from labeled training data are based on string edit distance or common features between two examples. However, if two examples from the same class have few common features, these methods have difficulties (...) in finding these pairs and achieving high recall. One typical example is to check whether two abbreviated author names in different citations refer to the same person or not. Since similarities between examples from the same class become close to zero, classifiers fail to distinguish positive pairs from negative pairs. One approach to avoiding the problem of zero similarities is using conjunctions of different features across examples, but implementing this idea straightforwardly makes the computational cost prohibitive for practical problems. Using a kernel on pair instances, our method can use feature conjunctions across examples without actually doing feature mappings, which are computationally expensive. The kernel is a tensor product of two inner products on the original feature space. The corresponding feature mapping generates conjunctions of features only across the two different examples while that of the conventional polynomial kernel also generates conjunctions of features from the same example, which are irrelevant to pairwise classification and cause deterioration of accuracy. Our experiments on the author matching problem show that this method can give a precision 4 to 8 times higher than that of previous methods at medium recall levels. (shrink)

This is a study of a crucial and controversial topic in metaphysics and the philosophy of science: the status of the laws of nature. D. M. Armstrong works out clearly and in comprehensive detail a largely original view that laws are relations between properties or universals. The theory is continuous with the views on universals and more generally with the scientific realism that Professor Armstrong has advanced in earlier publications. He begins here by mounting an attack on the orthodox and (...) sceptical view deriving from Hume that laws assert no more than a regularity of coincidence between instances of properties. In doing so he presents what may become the definitive statement of the case against this position. Professor Armstrong then goes on to establish his own theory in a systematic manner defending it against the most likely objections, and extending both it and the related theory of universals to cover functional and statistical laws. This treatment of the subject is refreshingly concise and vivid: it will both stimulate vigorous professional debate and make an excellent student text. (shrink)

Engaging Polanyi’s embeddedness–disembeddedness framework, this study explored the work experiences of Bhil children employed in Indian Bt cottonseed GPNs. The innovative visual technique of drawings followed by interviews was used. Migrant children, working under debt bondage, underwent greater exploitation and perennial and severe depersonalized bullying, indicative of commodification of labour and disembeddedness. In contrast, children working in their home villages were not under debt bondage and underwent less exploitation and occasional and mild depersonalized bullying, indicative of how civil society organizations, (...) along with the state, attempt to re-embed economic activities in the social context. Polanyi’s double movement was evident. ‘Place’ emerged as the pivotal factor determining children’s experiences. A ‘protective alliance’ of community controls and social power, associated with in-group affiliations and cohesive ties, stemming from a common village and tribal identity, aided children working at home for Bhil farmers. ‘Asymmetric intergroup inequality’ due to pronounced social identity and class differences, coupled with locational constraints and developmental disadvantage, made migrant children vulnerable targets. Social embeddedness influences how child workers are treated because it forces employers to be ethical and not engage in bullying. However, by shifting production to children’s home villages, there is an attempt to obscure the difference between child labour and child work. Thus, the seeds of disembeddedness are sown through the very act of re-embeddeding, potentially hampering future interventions. (shrink)