Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- David Ellerman (2009). Counting Distinctions: On the Conceptual Foundations of Shannon's Information Theory. Synthese 168 (1):119 - 149.Categorical logic has shown that modern logic is essentially the logic of subsets (or “subobjects”). In “subset logic,” predicates are modeled as subsets of a universe and a predicate applies to an individual if the individual is in the subset. Partitions are dual to subsets so there is a dual logic of partitions where a “distinction” [an ordered pair of distinct elements (u, u′) from the universe U] is dual to an “element”. A predicate modeled by a partition π on U would apply to a distinction if the pair of elements was distinguished by the partition π, i.e., if u and u′ were in different blocks of π. Subset logic leads to finite probability theory by taking the (Laplacian) probability as the normalized size of each subset-event of a finite universe. The analogous step in the logic of partitions is to assign to a partition the number of distinctions made by a partition normalized by the total number of ordered |U|2 pairs from the finite universe. That yields a notion of “logical entropy” for partitions and a “logical information theory.” The logical theory directly counts the (normalized) number of distinctions in a partition while Shannon’s theory gives the average number of binary partitions needed to make those same distinctions. Thus the logical theory is seen as providing a conceptual underpinning for Shannon’s theory based on the logical notion of “distinctions.”.Reading list | Discuss | Edit | Categorize |My bibliography
| Export citation | Other links: springerlink.com jstor.org | Scholar | At my library 
Similar books and articles
Our object is to study the interaction between mereology and David Lewis’ theory of subject-matters, elaborating his observation that not every subject matter is of the form: how things stand with such-and-such a part of the world. After an informal introduction to this point in Section 1, we turn to a formal treatment of the partial orderings arising in the two areas – the part-whole relation, on the one hand, and the relation of refinement amongst partitions of the set of worlds, on the other. (We follow Lewis – approximately – in identifying subject-matters with such partitions.) We emphasize a certain duality, formulated in (2.6) and (2.7) in Section 2, between the corresponding lattice operations – mereological joins with partition-lattice meets, mereological meets with partition-lattice joins. Section 3 presents some issues that are raised by consideration of the informally familiar idea of logical subtraction. These include, in particular, a problem about the need for a notion of independence different from the usual logical notion(s) going by that name. The apparatus of Section 2 promises to throw some light on this problem, as we indicate in Section 4. Section 5 ties up some loose ends and suggests an area in which further work would be desirable.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: dx.doi.org | Scholar | At my library | More options ...
| | Other links: dx.doi.org | Scholar | At my library | More options ... This paper discusses two combinatorial problems in stability theory. First we prove a partition result for subsets of stable models: for any A and B, we can partition A into |B |<κ(T ) pieces, Ai | i < |B |<κ(T ) , such that for each Ai there is a Bi ⊆ B where |Bi| < κ(T ) and Ai..
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... We compare the elementary theories of Shannon information and Kolmogorov complexity, the extent to which they have a common purpose, and wherethey are fundamentally different. We discuss and relate the basicnotions of both theories: Shannon entropy, Kolmogorov complexity, Shannon mutual informationand Kolmogorov (``algorithmic'') mutual information. We explainhow universal coding may be viewed as a middle ground betweenthe two theories. We consider Shannon's rate distortion theory, whichquantifies useful (in a certain sense) information.We use the communication of information as our guiding motif, and we explain howit relates to sequential question-answer sessions.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: springerlink.com dx.doi.org | Scholar | At my library | More options ...
| | Other links: springerlink.com dx.doi.org | Scholar | At my library | More options ... The need to distinguish between logical and extra-logical varieties of inference, entailment, validity, and consistency has played a prominent role in meta-ethical debates between expressivists and descriptivists. But, to date, the importance that matters of logical form play in these distinctions has been overlooked. That’s a mistake given the foundational place that logical form plays in our understanding of the difference between the logical and the extra-logical. This essay argues that descriptivists are better positioned than their expressivist rivals to provide the needed account of logical form, and so better able to capture the needed distinctions. This finding is significant for several reasons: First, it provides a new argument against expressivism. Second, it reveals that descriptivists can make use of this new argument only if they are willing to take a controversial—but plausible—stand on claims about the nature and foundations of logic.
No categories
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: springerlink.com dx.doi.org | Scholar | At my library | More options ...
| | Other links: springerlink.com dx.doi.org | Scholar | At my library | More options ... Standard (classical) logic is not independent of set theory. Which formulas are valid in logic depends on which sets we assume to exist in our set-theoretical universe. Second-order logic is just set theory in disguise. The typically logical notions of validity and consequence are not well defined in second-order logic, at least as long as there are open issues in set theory. Such contentious issues in set theory as the axiom of choice, the continuum hypothesis or the existence of inaccessible cardinals, can be equivalently transformed into question about the logical validity of pure sentences of second-order logic, where “pure” means that they only contain logical symbols and bound variables. Even standard first-order logic depends on the acceptance on infinite sets in our set-theoretical universe. Should we choose to admit only finite sets, the number of logically valid pure first-order formulas would increase dramatically and first-order logic would not be recursively enumerable any longer.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Scholar | More options ...
| | Scholar | More options ... Information is a notion of wide use and great intuitive appeal, and hence, not surprisingly, different formal paradigms claim part of it, from Shannon channel theory to Kolmogorov complexity. Information is also a widely used term in logic, but a similar diversity repeats itself: there are several competing logical accounts of this notion, ranging from semantic to syntactic. In this chapter, we will discuss three major logical accounts of information.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Scholar | More options ...
| | Scholar | More options ... We investigate the set (ω) of partitions of the natural numbers ordered by ≤* where A ≤* B if by gluing finitely many blocks of A we can get a partition coarser than B. In particular, we determine the values of a number of cardinals which are naturally associated with the structure ((ω),≥*), in terms of classical cardinal invariants of the continuum.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org dx.doi.org | Scholar | At my library | More options ...
| | Other links: jstor.org dx.doi.org | Scholar | At my library | More options ... A partition $\{C_i\}_{i\in I}$ of a Boolean algebra $\cS$ in a probability measure space $(\cS,p)$ is called a Reichenbachian common cause system for the correlated pair $A,B$ of events in $\cS$ if any two elements in the partition behave like a Reichenbachian common cause and its complement, the cardinality of the index set $I$ is called the size of the common cause system. It is shown that given any correlation in $(\cS,p)$, and given any finite size $n>2$, the probability space $(\cS,p)$ can be embedded into a larger probability space in such a manner that the larger space contains a Reichenbachian common cause system of size $n$ for the correlation. It also is shown that every totally ordered subset in the partially ordered set of all partitions of \cS$ contains only one Reichenbachian common cause system. Some open problems concerning Reichenbachian common cause systems are formulated.
No categories
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Scholar | More options ...
| | Scholar | More options ... Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms. Modern categorical logic as well as the Kripke models of intuitionistic logic suggest that the interpretation of classical "propositional" logic might be the logic of subsets of a given universe set. The propositional interpretation is isomorphic to the special case where the truth and falsity of propositions behave like the subsets of a one-element set. If classical "propositional" logic is thus seen as the logic of subsets of a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical "propositional" logic.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: journals.cambridge.org | Scholar | At my library | More options ...
| | Other links: journals.cambridge.org | Scholar | At my library | More options ... A new logic of partitions has been developed that is dual to ordinary logic when the latter is interpreted as the logic of subsets of a fixed universe rather than the logic of propositions. For a finite universe, the logic of subsets gave rise to finite probability theory by assigning to each subset its relative size as a probability. The analogous construction for the dual logic of partitions gives rise to a notion of logical entropy that is precisely related to Claude Shannon's entropy. In this manner, the new logic of partitions provides a logico-conceptual foundation for information-theoretic entropy or information content.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Scholar | More options ...
| | Scholar | More options ... Discussion of David Ellerman, Counting distinctions: On the conceptual foundations of Shannon's information theory
 Back
All discussions
Start a new thread
|
There are no threads in this forum |
Nothing in this forum yet.
