In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is suitable, for which I introduce a sequent calculus system, displaying - just like the corresponding natural deduction system - a consequence relation for provability as well as one dual to provability. I will propose a modified characterization of uniqueness incorporating such a duality of (...) consequence relations, with which we can maintain uniqueness in a bilateralist setting. (shrink)

Wittgenstein took the _Tractatus Logico-Philosophicus_ to be eventually invalidated by logical atomism. Our main thesis is that it can be revalidated, provided that we subtract the thesis 2.02 (“The object is simple.”) from it: atoms are not simple objects but, rather, bits of information the objects are made of. Starting from an introductory discussion about what is meant by a ‘logic of colors’, an explanatory framework is then proposed in the form of a partition semantics. The philosophical problem of Wittgenstein’s (...) color-statements is reformulated accordingly, thus overcoming the trouble with logical atomism. A Boolean treatment is advanced to solve the initial difficulty and leads to two final results: Wittgenstein’s logic of colors requires a mereological understanding of the relations between colors in order to make sense; the analysis of psychophysical concepts like colors casts some additional doubt about the analytic–synthetic distinction, to the point of treating relations between colors as analytic a posteriori judgments. (shrink)

After some generalities about connections between functions and relations in Sections 1 and 2 recalls the possibility of taking the semantic values of ‐ary Boolean connectives as ‐ary relations among truth‐values rather than as ‐ary truth functions. Section 3, the bulk of the paper, looks at correlates of these truth‐value relations as applied to formulas, and explores in a preliminary way how their properties are related to the properties of “logical relations” among formulas such as equivalence, implication (entailment) and contrariety (...) (logical incompatibility), concentrating for illustrative purposes on binary logical relations such as those just listed. To avoid an excess of footnotes, some points have been deferred to an Appendix as “Longer Notes”. (shrink)

The need for a ‘many-valued logic’ in linguistics has been evident since the 1970s, but there was lack of clarity as to whether it should come from the family of fuzzy logics or from the family of probabilistic logics. In this regard, Fine [14] and Kamp [26] pointed out undesirable effects of fuzzy logic (the failure of idempotency and coherence) which kept two generations of linguists and philosophers at arm’s length. (Another unwanted feature of fuzzy logic is the property of (...) truth functionality.) While probabilistic logic is not fraught by the same problems, its lack of constructiveness, i.e. its inability to compose complex truth degrees from atomic truth degrees, did not make it more attractive to linguists either. In the absence of a clear perspective in ‘many-valued logic’, scholars chose to proliferate ontologies grafted atop the classical bivalent logic: ontologies for truth, individuals, events, situations, possible worlds and degrees. The result has been a collection of incompatible classical logics. In this paper, I present sample logic, in particular its semantics (not its axiomatization). Sample logics is a member of the family of probabilistic logics, which is constructive without being truth functional. More specifically, I integrate all the important linguistic data on which the classical logics are predicated. The concepts of (in)dependency and conditional (in)dependency are the cornerstones of sample logic. (shrink)

This discussion explores the possibility of distinguishing a tighter notion of contrariety evident in the Square of Opposition, especially in its modal incarnations, than as that binary relation holding statements that cannot both be true, with or without the added rider ‘though can both be false’. More than one theorist has voiced the intuition that the paradigmatic contraries of the traditional Square are related in some such tighter way—involving the specific role played by negation in contrasting them—that distinguishes them from (...) other pairs of incompatible statements constructed from the same conceptual materials. Prominent among examples, these other nonstandard pairs are the ‘new contraries’ presented by Robert Blanché’s hexagon(s) of opposition. With special, though not exclusive, attention to these cases, we investigate whether contrariety in the distinguished sense can be captured by adding to the incompatibility condition the further demand that the pair of statements concerned can be represented as the results of applying some sentence operator to the content in its scope, for one of the pair, and, for the other, the application of that same operator to the negation of that content. For one of the two cases, a Blanché case, of nonstandard contrariety singled out for attention, the question of whether such a representation is available is settled at the end of Section 4, and then in a more satisfying way in Section 5, though for the other case, noticed by Peter Simons, the question remains open, after some tentative discussion in one subsection, 6.2, of an Appendix (Section 6). (shrink)

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...) dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games. (shrink)