Information-theoretic approaches to formal logic analyse the "common intuitive" concept of propositional implication (or argumental validity) in terms of information content of propositions and sets of propositions: one given proposition implies a second if the former contains all of the information contained by the latter; an argument is valid if the conclusion contains no information beyond that of the premise-set. This paper locates information-theoretic approaches historically, philosophically and pragmatically. Advantages and disadvantages are (...) identified by examining such approaches in themselves and by contrasting them with standard transformation-theoretic approaches. Transformation-theoretic approaches analyse validity (and thus implication) in terms of transformations that map one argument onto another: a given argument is valid if no transformation carries it onto an argument with all true premises and false conclusion. Model-theoretic, set-theoretic, and substitution-theoretic approaches, which dominate current literature, can be construed as transformation-theoretic, as can the so-called possible-worlds approaches. Ontic and epistemic presuppositions of both types of approaches are considered. Attention is given to the question of whether our historically cumulative experience applying logic is better explained from a purely information-theoretic perspective or from a purely transformation-theoretic perspective or whether apparent conflicts between the two types of approaches need to be reconciled in order to forge a new type of approach that recognizes their basic complementarity. (shrink)

Information-theoretic approaches to formal logic analyze the "common intuitive" concepts of implication, consequence, and validity in terms of information content of propositions and sets of propositions: one given proposition implies a second if the former contains all of the information contained by the latter; one given proposition is a consequence of a second if the latter contains all of the information contained by the former; an argument is valid if the conclusion contains no (...) class='Hi'>information beyond that of the premise-set. This paper locates information-theoretic approaches historically, philosophically, and pragmatically. Advantages and disadvantages are identified by examining such approaches in themselves and by contrasting them with standard transformation-theoretic approaches. Transformation-theoretic approaches analyze validity (and thus implication) in terms of transformations that map one argument onto another: a given argument is valid if no transformation carries it onto an argument with all true premises and false conclusion. Model-theoretic, set-theoretic, and substitution-theoretic approaches, which dominate current literature, can be construed as transformation-theoretic, as can the so-called possible-worlds approaches. Ontic and epistemic presuppositions of both types of approaches are considered. Attention is given to the question of whether our historically cumulative experience applying logic is better explained from a purely information-theoretic perspective or from a purely transformation-theoretic perspective or whether apparent conflicts between the two types of approaches need to be reconciled in order to forge a new type of approach that recognizes their basic complementarity. (shrink)

A set of qubit channels has a classical representation when it is isomorphic to the convex closure of a group of classical channels. From Crowder and Martin (Proceedings of Quantum Physics and Logic, Electronic Notes in Theoretical Computer Science, 2009), we know that up to isomorphism there are five such sets, each corresponding to either a subgroup of the alternating group on four letters, or a subgroup of the symmetric group on three letters. In this paper, we show that (...) the classical representation of a qubit channel also carries its information theoretic data—in particular, both the Holevo capacity and the scope of a unital qubit channel can be completely calculated from a systematically determined classical channel. (shrink)

We present an information-theoretic interpretation of quantum formalism based on a Bayesian framework and devoid of any extra axiom or principle. Quantum information is construed as a technique for analyzing a logical system subject to classical constraints, based on a question-and-answer procedure. The problem is posed from a particular batch of queries while the constraints are represented by the truth table of a set of Boolean functions. The Bayesian inference technique consists in assigning a probability distribution within (...) a real-valued probability space to the joint set of queries in order to satisfy the constraints. The initial query batch is not unique and alternative batches can be considered at will. They are enabled mechanically from the initial batch, quite simply by transcribing the probability space into an auxiliary Hilbert space. It turns out that this sole procedure leads to exactly rediscover the standard quantum information theory and thus provides an information-theoretic rationale to its technical rules. In this framework, the great challenges of quantum mechanics become simple platitudes: Why is the theory probabilistic? Why is the theory linear? Where does the Hilbert space come from? In addition, most of the paradoxes, such as uncertainty principle, entanglement, contextuality, nonsignaling correlation, measurement problem, etc., become straightforward features. In the end, our major conclusion is that quantum information is nothing but classical information processed by a mature form of Bayesian inference technique and, as such, consubstantial with Aristotelian logic. (shrink)

Probabilistic theories are a natural framework to investigate the foundations of quantum theory and possible alternative or deeper theories. In a generic probabilistic theory, states of a physical system are represented as vectors of outcomes probabilities and state spaces are convex cones. In this picture the physics of a given theory is related to the geometric shape of the cone of states. In quantum theory, for instance, the shape of the cone of states corresponds to a projective space over complex (...) numbers. In this paper we investigate geometric constraints on the state space of a generic theory imposed by the following information theoretic requirements: every non completely mixed state of a system is perfectly distinguishable from some other state in a single shot measurement; information capacity of physical systems is conserved under making mixtures of states. These assumptions guarantee that a generic physical system satisfies a natural principle asserting that the more a state of the system is mixed the less information can be stored in the system using that state as logical value. We show that all theories satisfying the above assumptions are such that the shape of their cones of states is that of a projective space over a generic field of numbers. Remarkably, these theories constitute generalizations of quantum theory where superposition principle holds with coefficients pertaining to a generic field of numbers in place of complex numbers. If the field of numbers is trivial and contains only one element we obtain classical theory. This result tells that superposition principle is quite common among probabilistic theories while its absence gives evidence of either classical theory or an implausible theory. (shrink)

This article discusses two coextensive concepts of logical consequence that are implicit in the two fundamental logical practices of establishing validity and invalidity for premise-conclusion arguments. The premises and conclusion of an argument have information content (they ?say? something), and they have subject matter (they are ?about? something). The asymmetry between establishing validity and establishing invalidity has long been noted: validity is established through an information-processing procedure exhibiting a step-by-step deduction of the conclusion from the premise-set. Invalidity is (...) established by exhibiting a countermodel satisfying the premises but not the conclusion. The process of establishing validity focuses on information content; the process of establishing invalidity focuses on subject matter. Corcoran's information-theoretic concept of logical consequence corresponds to the former. Tarski's model-theoretic concept of logical consequence formulated in his famous 1936 no-countermodels definition corresponds to the latter. Both are found to be indispensable for understanding the rationale of the deductive method and each complements the other. This study discusses the ontic question of the nature of logical consequence and the epistemic question of the human capabilities presupposed by practical applications of these two concepts as they make validity and invalidity accessible to human knowledge. (shrink)

The Editors express their gratitude and appreciation to the indi-viduals listed below who served as referees for Informal Logic for Volumes 31 (2011) and 32 (2012).

The interventionist account of causation offers a criterion to distinguish causes from non-causes. It also aims at defining various desirable properties of causal relationships, such as specificity, proportionality and stability. Here we apply an information-theoretic approach to these properties. We show that the interventionist criterion of causation is formally equivalent to non-zero specificity, and that there are natural, information-theoretic ways to explicate the distinction between potential and actual causal influence. We explicate the idea that the description (...) of causes should be proportional to that of their effects. Then we draw a distinction between two ideas in the existing literature, the range of invariance of a causal relationship and its stability. The range of invariance is related to specificity and range of causal values. Stability concerns the effect of additional variables on the relationship between some focal pair of cause and effect variables. We show how to distinguish and measure the direct influence of background variables on the effect variable, and their influence on the relationship between the focal cause and the effect variable. Finally, we discuss the limitations of the information-theoretic approach, and offer prospects for complementary approaches. (shrink)

I survey in this article the practical uses of computers in philosophy: except for logic, computers have not yet noticeably improved the quality of philosophizing, research, or pedagogy. They have made work easier. My main interest, however, is in the “substantive” impact that computers may have on philosophical problems, especially in metaphysics. I argue that logic, the notion of decidability, and the theory of computation all predated and did not require modern digital computers. In the philosophy of mind, (...) there has been a persistent conflation of computationalism and physicalism. The two theses can and should be separated. Finally, I suggest that we see glimpses of a new metaphysics based on information and information transformations that goes far beyond the well‐trodden mind‐brain debates. (shrink)

This paper provides an interpretation of the Routley-Meyer semantics for a weak negation-free relevant logic using Israel and Perry's theory of information. In particular, Routley and Meyer's ternary accessibility relation is given an interpretation in information-theoretic terms.

There is a new theory of information based on logic. The definition of Shannon entropy as well as the notions on joint, conditional, and mutual entropy as defined by Shannon can all be derived by a uniform transformation from the corresponding formulas of logical information theory. Information is first defined in terms of sets of distinctions without using any probability measure. When a probability measure is introduced, the logical entropies are simply the values of the probability (...) measure on the sets of distinctions. The compound notions of joint, conditional, and mutual entropies are obtained as the values of the measure, respectively, on the union, difference, and intersection of the sets of distinctions. These compound notions of logical entropy satisfy the usual Venn diagram relationships since they are values of a measure. The uniform transformation into the formulas for Shannon entropy is linear so it explains the long-noted fact that the Shannon formulas satisfy the Venn diagram relations--as an analogy or mnemonic--since Shannon entropy is not a measure on a given set. What is the logic that gives rise to logical information theory? Partitions are dual to subsets, and the logic of partitions was recently developed in a dual/parallel relationship to the Boolean logic of subsets. Boole developed logical probability theory as the normalized counting measure on subsets. Similarly the normalized counting measure on partitions is logical entropy--when the partitions are represented as the set of distinctions that is the complement to the equivalence relation for the partition. In this manner, logical information theory provides the set-theoretic and measure-theoretic foundations for information theory. The Shannon theory is then derived by the transformation that replaces the counting of distinctions with the counting of the number of binary partitions it takes, on average, to make the same distinctions by uniquely encoding the distinct elements--which is why the Shannon theory perfectly dovetails into coding and communications theory. (shrink)

Informal logic began in the 1970s as a critique of then-current theoretical assumptions in the teaching of argument analysis and evaluation in philosophy departments in the U.S. and Canada. The last 35 years have seen significant developments in informal logic and critical thinking theory. The paper is a pilot study of the influence of these advances in theory on what is taught in courses on argument analysis and critical thinking in U.S. and Canadian philosophy departments. Its finding, provisional (...) and much-qualified, is that the theoretical developments and refinements have had limited impact on instruction in leading philosophy departments. (shrink)

In this paper we relax the assumption that the logical constants of ordinary first-order logic be linearly ordered. As a consequence, we shall have formulas involving not only partially ordered quantifiers, but also partially ordered connectives. The resulting language, called the language of informational independence will be given an interpretation in terms of games of imperfect information. The II-logic will be seen to have some interesting properties: It is very natural to define in this logic two (...) negations, weak negation as failure to verify a sentence, and strong negation as the existence of a falsifying strategy: One can express in this logic complete problems of finite structures, like the non-connectedness and 3-colorability of finite graphs, the satisfiability problem for Boolean circuits built up from NAND-gates, etc. (shrink)

We present an informational view of classical propositional logic that stems from a kind of informational semantics whereby the meaning of a logical operator is specified solely in terms of the information that is actually possessed by an agent. In this view the inferential power of logical agents is naturally bounded by their limited capability of manipulating “virtual information”, namely information that is not implicitly contained in the data. Although this informational semantics cannot be expressed by (...) any finitely-valued matrix, it can be expressed by a non-deterministic 3-valued matrix that was first introduced by W.V.O. Quine, but ignored by the logical community. Within the general framework presented in [21] we provide an in-depth discussion of this informational semantics and a detailed analysis of a specific infinite hierarchy of tractable approximations to classical propositional logic that is based on it. This hierarchy can be used to model the inferential power of resource-bounded agents and admits of a uniform proof-theoretical characterization that is half-way between a classical version of Natural Deduction and the method of semantic tableaux. (shrink)

The present article proposes an Informational-Theoretic interpretation of logical analysis applied to natural language in Tractatus Logico-Philosophicus. Natural language is characterized by descriptive definitions in order to compress information according to empirical regularities. However, notations fitted to empirical patterns do not explicitly reflect the logical structure of language that enables it to represent those very patterns. I argue that logical analysis is the process of obtaining incompressible and uniformly distributed codes, best fitted to express the possible combinations of (...) facts instead of eventual empirical regularities. That implies mutual translatability between different representations of the same facts, which justifies the possibility to decompose natural language and to rebuild it in mathematized ideographical languages, such as physics. Logical analysis decomposition process, then, results in a reductionism that sets the basis for conceptions of logic and language not only in Tractatus, but also in Some Remarks on Logical Form, which, in turn, is shown to be unattainable in Philosophical Remarks. That posterior book introduces a fragmentation of linguistic systems and analytical methods that can no longer be interpreted under computation theory alone. (shrink)

The new logic of partitions is dual to the usual Boolean logic of subsets (usually presented only in the special case of the logic of propositions) in the sense that partitions and subsets are category-theoretic duals. The new information measure of logical entropy is the normalized quantitative version of partitions. The new approach to interpreting quantum mechanics (QM) is showing that the mathematics (not the physics) of QM is the linearized Hilbert space version of the (...) mathematics of partitions. Or, putting it the other way around, the math of partitions is a skeletal version of the math of QM. The key concepts throughout this progression from logic, to logical information, to quantum theory are distinctions versus indistinctions, definiteness versus indefiniteness, or distinguishability versus indistinguishability. The distinctions of a partition are the ordered pairs of elements from the underlying set that are in different blocks of the partition and logical entropy is defined (initially) as the normalized number of distinctions. The cognate notions of definiteness and distinguishability run throughout the math of QM, e.g., in the key non-classical notion of superposition (= ontic indefiniteness) and in the Feynman rules for adding amplitudes (indistinguishable alternatives) versus adding probabilities (distinguishable alternatives). (shrink)

In this paper I offer a proof-theoretic defence of meaning-invariant logical pluralism. I argue that there is a relation of co-determination between the operational and structural aspects of a logic. As a result, some features of the consequence relation are induced by the connectives. I propose that a connective is defined by those rules which are conservative and unique, while at the same time expressing only connective-induced structural information. This is the key to stabilizing the meaning of (...) the connectives across multiple determinations of the consequence relation. (shrink)

What is a minimal proof-theoretical foundation of logic? Two different ways to answer this question may appear to offer themselves: reduce the whole of logic either to the relation of inference, or else to the property of incompatibility. The first way would involve defining logical operators in terms of the algebraic properties of the relation of inference—with conjunction $$\hbox {A}\wedge \hbox {B}$$ A ∧ B as the infimum of A and B, negation $$\lnot \hbox {A}$$ ¬ A as (...) the minimal incompatible of A, etc. The second way involves introducing logical operators in terms of the relation of incompatibility, such that X is incompatible with $$\{\lnot \hbox {A}\}$$ { ¬ A } iff every Y incompatible with X is incompatible with {A}; and X is incompatible with $$\{\hbox {A}\!\wedge \!\hbox {B}\}$$ { A ∧ B } iff X is incompatible with {A,B}; etc. Whereas the first route leads us naturally to intuitionistic logic, the second leads us to classical logic. The aim of this paper is threefold: to investigate the relationship of the two approaches within a very general framework, to discuss the viability of erecting logic on such austere foundations, and to find out whether choosing one of the ways we are inevitably led to a specific logical system. (shrink)

Shows how digital capitalism has shaped human rights practices What happens to the cultural politics of human rights when atrocities are rendered calculable, abuses are transformed into data, and victims become vectors? As human rights organisations have increasingly embraced information technologies this 'datafication' of rights has become both a reality and a pressing concern, one inextricably tangled up with questions regarding the broader political valences of human rights. Combining contemporary social and cultural theory with archival research and original ethnographic (...) work, Josh Bowsher resituates recent critiques of human rights within ongoing theoretical discussions concerning informational capitalism, digital culture and the politics of data. Critically analysing the contemporary human rights movement as an informational politics, Bowsher provides a new conceptual agenda for both exploring and overcoming the limits of human rights in an era shaped by the data flows, network infrastructures and informational logic of late capitalism. Josh Bowsher is Lecturer in Sociology at Brunel University. (shrink)

Theoretical physics is a deductive discipline which presupposes the validity and applicability of certain other disciplines. Among these are logic, algebra, analysis, and geometry. Before relativity, Euclidean geometry was the only one thought to be important for physical space. These disciplines correlate well with experience, and, in the course of time, a priori validity came to be ascribed to them. To Kant, for example, the universe could not possibly be based on any geometry other than Euclid's. The discovery of (...) non-Euclidean geometries by Bolyai and Lobatchevsky, its systematic extension by Riemann, and the critical scrutiny of foundations by Mach and Poincaré shook the “self-evident truth” of Euclidean geometry as applied to the world of physics. The death knell of the a priori truth of any geometry was supplied by Einstein. He showed that a wider body of experience was coordinated by a Riemannian geometry than by Euclidean. He traced the success of Euclidian geometry back to the existence of so-called rigid bodies, in terms of which operations can be associated with numbers which correlate well with numbers associated in a purely mathematical way with mathematical constructs put in correspondence with these bodies. For the physicist, then, the geometry of the real world is now a physical theory whose “truth” like that of all physical theory, is measured by its degree of success in coordinating experience. (shrink)

Weakly Aggregative Modal Logic ) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. \ has interesting applications on epistemic logic, deontic logic, and the logic of belief. In this paper, we study some basic model theoretical aspects of \. Specifically, we first give a van Benthem–Rosen characterization theorem of \ based on an intuitive notion of bisimulation. Then, in contrast to many well known normal or non-normal modal (...) logics, we show that each basic \ system \ lacks Craig interpolation. Finally, by model theoretical techniques, we show that an extension of \ does have Craig interpolation, as an example of amending the interpolation problem of \. (shrink)

I argue against the skeptical epistemological view exemplified by the Groarkes that “all theories of informal argument must face the regress problem.” It is true that in our theoretical representations of reasoning, infinite regresses of self-justification regularly and inadvertently arise with respect to each of the RSA criteria for argument cogency (the premises are to be relevant, sufficient, and acceptable). But they arise needlessly, by confusing an RSA criterion with argument content, usually premise material.

Information-based epistemology maintains that ‘being informed’ is an independent cognitive state that cannot be reduced to knowledge or to belief, and the modal logic KTB has been proposed as a model. But what distinguishes the KTB analysis of ‘being informed’, the Brouwersche schema (B), is precisely its downfall, for no logic of information should include (B) and, more generally, no epistemic logic should include (B), either.

We investigate many paradigms of identifications for classes of languages in a measure-theoretic context, and we relate such paradigms to their analogues in learning on informants. Roughly speaking, the results say that most paradigms in measure-theoretic learning wrt some classes of distributions are equivalent to the corresponding paradigms for identification on informants.

Deanna Kuhn's theory of informal argumentation (1991) evaluates arguments according to a theory/evidence model where subjects first articulate a theory and then must provide critical testing of alternatives on the basis of evidence. Using this model, Kuhn reports that many subjects fail to supply adequate evidence for their 'theories' and are often unable or unwilling to generate alternatives. In this paper an account of practical reasoning is provided that suggests an alternate interpretation for Kuhn's subjects' poor perfonnance. It is argued (...) that treating practical arguments as failed theoretical justifications causes Kuhn to misrepresent the contribution of many of her subjects' arguments. (shrink)

When, if ever, is one justified in accepting the premises of an argument? What is the proper criterion of premise acceptability? Can the criterion be theoretically or philosophically justified? This is the first book to provide a comprehensive theory of premise acceptability and it answers the questions above from an epistemological approach that the author calls common sense foundationalism. It will be eagerly sought out not just by specialists in informal logic, critical thinking, and argumentation theory but also by (...) a broader range of philosophers and those teaching rhetoric. (shrink)

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. (shrink)

In this paper, we show the equivalence between the provability of a proof system of basic hybrid logic and that of translated formulas of the classical predicate logic with equality and explicit substitution by a purely proof–theoretic method. Then we show the equivalence of two groups of proof systems of hybrid logic: the group of labelled deduction systems and the group of modal logic-based systems.