Cn-Definitions of Propositional Connectives

We attempt to define the classical propositional logic by use of appropriate derivability conditions called Cn-definitions. The conditions characterize basic properties of propositional connectives.     

时间距离提高伦理判断

本文从识解水平理论角度研究问题表征对伦理判断的影响。本文推断,事件的时间距离使得人们更容易形成高识解表征,能更好地辨别决策困境中的伦理原则;未来结果考虑特征高的管理者更关注决策的长期后果,也倾向于维护伦理原则。研究用两个实验递进验证了假设。139位大学生被试参加了实验1,结果支持了假设;实验2采用92位MBA学生的样本重复检验结论,并进一步验证未来结果考虑如何调节影响时间距离与伦理判断之间的关系。     

Dispositions and the Argument from Science

Central to the debate between Humean and anti-Humean metaphysics is the question of whether dispositions can exist in the absence of categorical properties that ground them (that is, where the causal burden is shifted on to categorical properties on which the dispositions would therefore supervene). Dispositional essentialists claim that they can; categoricalists reject the possibility of such ‘baseless’ dispositions, requiring that all dispositions must ultimately have categorical bases. One popular argument, recently dubbed the ‘Argument from Science’, has appeared in one or another form over much of the last century and purports to win the day for the dispositional essentialist. Taking its cue from physical theory, the Argument from Science treats the exclusively dispositional characterizations of the fundamental particles one finds in physical theory as providing a key premise in what has been called a ‘decisive’ argument for baseless dispositions. Despite sharing the intuition that dispositions can be baseless, I argue that the force and significance of the Argument from Science have been greatly overestimated: no version of the argument is close to decisive, and only one version succeeds in scoring points against the categoricalist. Not only is physical theory more ontologically innocent than defenders of baseless dispositions seem to appreciate, most versions of the Argument from Science neglect important ways that dispositions could be grounded by categorical properties.     

Identical Twins,Deduction Theorems,and Pattern Functions: Exploring the Implicative BCSK Fragment of S5

We recapitulate (Section 1) some basic details of the system of implicative BCSK logic, which has two primitive binary implicational connectives, and which can be viewed as a certain fragment of the modal logic S5. From this modal perspective we review (Section 2) some results according to which the pure sublogic in either of these connectives (i.e., each considered without the other) is an exact replica of the material implication fragment of classical propositional logic. In Sections 3 and 5 we show that for the pure logic of one of these implicational connectives two – in general distinct – consequence relations (global and local) definable in the Kripke semantics for modal logic turn out to coincide, though this is not so for the pure logic of the other connective, and that there is an intimate relation between formulas constructed by means of the former connective and the local consequence relation. (Corollary 5.8. This, as we show in an Appendix, is connected to the fact that the ‘propositional operations’ associated with both of our implicational connectives are close to being what R. Quackenbush has called pattern functions.) Between these discussions Section 4 examines some of the replacement-of-equivalents properties of the two connectives, relative to these consequence relations, and Section 6 closes with some observations about the metaphor of identical twins as applied to such pairs of connectives.     

Plural signification and the Liar paradox

In recent years, speech-act theory has mooted the possibility that one utterance can signify a number of different things. This pluralist conception of signification lies at the heart of Thomas Bradwardine’s solution to the insolubles, logical puzzles such as the semantic paradoxes, presented in Oxford in the early 1320s. His leading assumption was that signification is closed under consequence, that is, that a proposition signifies everything which follows from what it signifies. Then any proposition signifying its own falsity, he showed, also signifies its own truth and so, since it signifies things which cannot both obtain, it is simply false. Bradwardine himself, and his contemporaries, did not elaborate this pluralist theory, or say much in its defence. It can be shown to accord closely, however, with the prevailing conception of logical consequence in England in the fourteenth century. Recent pluralist theories of signification, such as Grice’s, also endorse Bradwardine’s closure postulate as a plausible constraint on signification, and so his analysis of the semantic paradoxes is seen to be both well-grounded and plausible.

A Model of Tolerance

According to the naive theory of vagueness, the vagueness of an expression consists in the existence of both positive and negative cases of application of the expression and in the non-existence of a sharp cut-off point between them. The sorites paradox shows the naive theory to be inconsistent in most logics proposed for a vague language. The paper explores the prospects of saving the naive theory by revising the logic in a novel way, placing principled restrictions on the transitivity of the consequence relation. A lattice-theoretical framework for a whole family of (zeroth-order) “tolerant logics” is proposed and developed. Particular care is devoted to the relation between the salient features of the formal apparatus and the informal logical and semantic notions they are supposed to model. A suitable non-transitive counterpart to classical logic is defined. Some of its properties are studied, and it is eventually shown how an appropriate regimentation of the naive theory of vagueness is consistent in such a logic.     

Algebraic Semantics for Deductive Systems

The notion of an algebraic semantics of a deductive system was proposed in [3], and a preliminary study was begun. The focus of [3] was the definition and investigation of algebraizable deductive systems, i.e., the deductive systems that possess an equivalent algebraic semantics. The present paper explores the more general property of possessing an algebraic semantics. While a deductive system can have at most one equivalent algebraic semantics, it may have numerous different algebraic semantics. All of these give rise to an algebraic completeness theorem for the deductive system, but their algebraic properties, unlike those of equivalent algebraic semantics, need not reflect the metalogical properties of the deductive system. Many deductive systems that don't have an equivalent algebraic semantics do possess an algebraic semantics; examples of these phenomena are provided. It is shown that all extensions of a deductive system that possesses an algebraic semantics themselves possess an algebraic semantics. Necessary conditions for the existence of an algebraic semantics are given, and an example of a protoalgebraic deductive system that does not have an algebraic semantics is provided. The mono-unary deductive systems possessing an algebraic semantics are characterized. Finally, weak conditions on a deductive system are formulated that guarantee the existence of an algebraic semantics. These conditions are used to show that various classes of non-algebraizable deductive systems of modal logic, relevance logic and linear logic do possess an algebraic semantics.     

Generalized Logical Consequence: Making Room for Induction in the Logic of Science

We present a framework that provides a logic for science by generalizing the notion of logical (Tarskian) consequence. This framework will introduce hierarchies of logical consequences, the first level of each of which is identified with deduction. We argue for identification of the second level of the hierarchies with inductive inference. The notion of induction presented here has some resonance with Popper's notion of scientific discovery by refutation. Our framework rests on the assumption of a restricted class of structures in contrast to the permissibility of classical first-order logic. We make a distinction between deductive and inductive inference via the notions of compactness and weak compactness. Connections with the arithmetical hierarchy and formal learning theory are explored. For the latter, we argue against the identification of inductive inference with the notion of learnable in the limit. Several results highlighting desirable properties of these hierarchies of generalized logical consequence are also presented.     

False Though Partly True – An Experiment in Logic

We explore in an experimental spirit the prospects for extending classical propositional logic with a new operator P intended to be interpreted when prefixed to a formula as saying that formula in question is at least partly true. The paradigm case of something which is, in the sense envisaged, false though still partly true is a conjunction one of whose conjuncts is false while the other is true. Ideally, we should like such a logic to extend classical logic – or any fragment thereof under consideration – conservatively, to be closed under uniform substitution (of arbitrary formulas for sentence letters or propositional variables), and to allow the substitutivity of provably equivalent formulas salva provabilitate. To varying degrees, we experience some difficulties only with this last (congruentiality) desideratum in the two four-valued logics we end up giving our most extended consideration to.     

Inferential Intensionality

The paper is a study of properties of quasi-consequence operation which is a key notion of the so-called inferential approach in the theory of sentential calculi established in [5]. The principal motivation behind the quasi-consequence, q-consequence for short, stems from the mathematical practice which treats some auxiliary assumptions as mere hypotheses rather than axioms and their further occurrence in place of conclusions may be justified or not. The main semantic feature of the q-consequence reflecting the idea is that its rules lead from the non-rejected assumptions to the accepted conclusions.First, we focus on the syntactic features of the framework and present the q-consequence as related to the notion of proof. Such a presentation uncovers the reasons for which the adjective inferential is used to characterize the approach and, possibly, the term inference operation replaces q-consequence. It also shows that the inferential approach is a generalisation of the Tarski setting and, therefore, it may potentially absorb several concepts from the theory of sentential calculi, cf. [10]. However, as some concrete applications show, see e.g.[4], the new approach opens perspectives for further exploration.The main part of the paper is devoted to some notions absent, in Tarski approach. We show that for a given q-consequence operation W instead of one W-equivalence established by the properties of W we may consider two congruence relations. For one of them the current name is kept preserved and for the other the term W-equality is adopted. While the two relations coincide for any W which is a consequence operation, for an arbitrary W the inferential equality and the inferential equivalence may differ. Further to this we introduce the concepts of inferential extensionality and intensionality for q-consequence operations and connectives. Some general results obtained in Section 2 sufficiently confirm the importance of these notions. To complete a view, in Section 4 we apply the new intensionality-extensionality distinction to inferential extensions of a version of the ukasiewicz four valued modal logic.