The paper develops the idea of discursive space by describing the manner of existence of this space and the world of facts. The ontology of discursive space is based on the idea of discourse by Foucault. Discourse, being a language phenomenon, is a form of existence of knowledge. The discursive space is a representation of knowledge and can be interpreted as the system of acquiring this knowledge. This space is connected with the world of facts by a relationship of supervenience, (...) which can be interpreted as a flow of knowledge. At the same time, the existence of the world of facts (world of affairs) assumes that it covers all phenomena and processes, and therefore, necessarily, also the discursive space. Hence, this space is not a separate system but a system that emerges from the world in order to allow the gathering of specific knowledge about it. Treating the discursive space as one of the possible cognitive systems, one can imagine other systems of knowledge that emerge from the world (the whole), as parts subordinated to particular goals (the use of knowledge), which can have a multilevel character. The flow of knowledge on the border of such a system and the whole of it can be interpreted as information. This paper tries to justify this possibility, which could lead to a general model of the flow of the knowledge. (shrink)

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the "quantum logic" of subspaces of a general vector space--which is then specialized to the closed subspaces of a Hilbert space. But there is a "dual" progression. The notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) to (...) the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of partitions to the quantum logic of direct-sum decompositions (i.e., the vector space version of a set partition) of a general vector space--which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the logic to express measurement by any self-adjoint operators rather than just the projection operators associated with subspaces. In this introductory paper, the focus is on the quantum logic of direct-sum decompositions of a finite-dimensional vector space (including such a Hilbert space). The primary special case examined is finite vector spaces over ℤ₂ where the pedagogical model of quantum mechanics over sets (QM/Sets) is formulated. In the Appendix, the combinatorics of direct-sum decompositions of finite vector spaces over GF(q) is analyzed with computations for the case of QM/Sets where q=2. (shrink)

In a recent paper Johan van Benthem reviews earlier work done by himself and colleagues on ‘natural logic’. His paper makes a number of challenging comments on the relationships between traditional logic, modern logic and natural logic. I respond to his challenge, by drawing what I think are the most significant lines dividing traditional logic from modern. The leading difference is in the way logic is expected to be used for checking arguments. For traditionals the checking is local, i.e. separately (...) for each inference step. Between inference steps, several kinds of paraphrasing are allowed. Today we formalise globally: we choose a symbolisation that works for the entire argument, and thus we eliminate intuitive steps and changes of viewpoint during the argument. Frege and Peano recast the logical rules so as to make this possible. I comment also on the traditional assumption that logical processing takes place at the top syntactic level, and I question Johan’s view that natural logic is ‘natural’. (shrink)

Classical logic is usually interpreted as the logic of propositions. But from Boole's original development up to modern categorical logic, there has always been the alternative interpretation of classical logic as the logic of subsets of any given (nonempty) universe set. Partitions on a universe set are dual to subsets of a universe set in the sense of the reverse-the-arrows category-theoretic duality--which is reflected in the duality between quotient objects and subobjects throughout algebra. Hence the idea arises of a dual (...) logic of partitions. That dual logic is described here. Partition logic is at the same mathematical level as subset logic since models for both are constructed from (partitions on or subsets of) arbitrary unstructured sets with no ordering relations, compatibility or accessibility relations, or topologies on the sets. Just as Boole developed logical finite probability theory as a quantitative treatment of subset logic, applying the analogous mathematical steps to partition logic yields a logical notion of entropy so that information theory can be refounded on partition logic. But the biggest application is that when partition logic and the accompanying logical information theory are "lifted" to complex vector spaces, then the mathematical framework of quantum mechanics is obtained. Partition logic models indefiniteness (i.e., numerical attributes on a set become more definite as the inverse-image partition becomes more refined) while subset logic models the definiteness of classical physics (an entity either definitely has a property or definitely does not). Hence partition logic provides the backstory so the old idea of "objective indefiniteness" in QM can be fleshed out to a full interpretation of quantum mechanics. (shrink)

Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics (QM) is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets (or partitions) which are category-theoretically dual (...) to one another and which are developed in two mathematical logics, the usual Boolean logic of subsets and the more recent logic of partitions. Our sense-making strategy is "follow the math" by showing how the logic and mathematics of set partitions can be transported in a natural way to Hilbert spaces where it yields the mathematical machinery of QM--which shows that the mathematical framework of QM is a type of logical system over ℂ. And then we show how the machinery of QM can be transported the other way down to the set-like vector spaces over ℤ₂ showing how the classical logical finite probability calculus (in a "non-commutative" version) is a type of "quantum mechanics" over ℤ₂, i.e., over sets. In this way, we try to make sense out of objective indefiniteness and thus to interpret quantum mechanics. (shrink)

The so-called classical limit of quantum mechanics is generally studied in terms of the decoherence of the state operator that characterizes a system. This is not the only possible approach to decoherence. In previous works we have presented the possibility of studying the classical limit in terms of the decoherence of relevant observables of the system. On the basis of this approach, in this paper we introduce the classical limit from a logical perspective, by studying the way in which the (...) logical structure of quantum properties corresponding to relevant observables acquires Boolean characteristics. (shrink)

The goal of this paper is to provide a detailed reading of John Venn's Logic of Chance as a work of logic or, more specifically, as a specific portion of the general system of so-called ‘material’ logic developed in his Principles of Empirical or Inductive Logic and to discuss it against the background of his Boolean-inspired views on the connection between logic and mathematics. It is by means of this situating of Venn 1866 [The Logic of Chance. An Essay on (...) the Foundations and Province of the Theory of Probability. With Especial Reference to Its Application to Moral and Social Science, London: Macmillan] within the entirety of his oeuvre that it becomes both possible to revisit and necessary to re-articulate its place in the history of the frequency interpretation of probability. For it is clear that if Venn's approach to logic not only allowed him to establish its foundations on the basis of a process of idealization and define it as consisting of so-called hypothetical infinite series, bu.. (shrink)

Ernst Schröder, Parafrasi Schröderiane. Ovvero: Ernst Schröder, Leoperazioni del Calcolo Logico. Original German text with Italian translation, commentary and annotations by Davide Bondoni, LED Edizioni, Milan, 2010, pp. 208, 15,5 × 22 cm, ISBN 978-88-7916-474-0.

John Venn and Charles L. Dodgson (Lewis Carroll) created systems of logic diagrams capable of representing classes (sets) and their relations in the form of propositions. Each is a proof method for syllogisms, and Carroll's is a sound and complete system. For a large number of sets, Carroll diagrams are easier to draw because of their self-similarity and algorithmic construction. This regularity makes it easier to locate and thereby to erase cells corresponding with classes destroyed by the premises of an (...) argument, a particularly difficult task in Venn diagrams for more than four sets. Carroll diagrams can represent existential propositions easily, so they are capable of clearly representing more complex problems than Venn's system can. Finally, both Carroll and Venn diagrams are maximal, in the sense that no additional logic information like inclusive disjunctions is able to be represented by them. Carroll's logic diagrams and logic trees constitute his visual logic system. (shrink)

This paper discusses George Boole’s two distinct approaches to the explanatory relationship between logical and psychological theory. It is argued that, whereas in his first book he attributes a substantive role to psychology in the foundation of logical theory, in his second work he abandons that position in favour of a linguistically conceived foundation. The early Boole espoused a type of psychologism and later came to adopt a type of anti-psychologism. To appreciate this invites a far-reaching reassessment of his philosophy (...) of logic. (shrink)

We establish a probabilized version of modus tollens, deriving from p(E|H)=a and p()=b the best possible bounds on p(). In particular, we show that p() 1 as a, b 1, and also as a, b 0. Introduction Probabilities of conditionals Conditional probabilities 3.1 Adams' thesis 3.2 Modus ponens for conditional probabilities 3.3 Modus tollens for conditional probabilities.

'Reason, Causation and Compatibility with the Phenomena' strives to give answers to the philosophical problem of the interplay between realism, explanation and experience. This book is a compilation of essays that recollect significant conceptions of rival terms such as determinism and freedom, reason and appearance, power and knowledge. This title discusses the progress made in epistemology and natural philosophy, especially the steps that led from the ancient theory of atomism to the modern quantum theory, and from mathematization to analytic philosophy. (...) Moreover, it provides possible gateways from modern deadlocks of theory either through approaches to consciousness or through historical critique of intellectual authorities. This work will be of interest to those either researching or studying in colleges and universities, especially in the departments of philosophy, history of science, philosophy of science, philosophy of physics and quantum mechanics, history of ideas and culture. Greek and Latin Literature students and instructors may also find this book to be both a fascinating and valuable point of reference. (shrink)

We assess the celebration of the 1st World Logic Day which recently took place all over the world. We then answer the question Why a World Logic Day? in two steps. First we explain why promoting logic, emphasizing its fundamental importance and its relations with many other fields. Secondly we examine the sense of a one-day celebration: how this can help reinforcing logic day-to-day and why logic deserves it. We make a comparison with other existing one-day celebrations. We end by (...) presenting and commenting the logo of the World Logic Day. (shrink)

According to Boole it is possible to deduce the principle of contradiction from what he calls the fundamental law of thought and expresses as \. We examine in which framework this makes sense and up to which point it depends on notation. This leads us to make various comments on the history and philosophy of modern logic.

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)

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “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 subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic. (shrink)

The notion of a partition on a set is mathematically dual to the notion of a subset of a set, so there is a logic of partitions dual to Boole's logic of subsets (Boolean logic is usually mis-specified as "propositional" logic). The notion of an element of a subset has as its dual the notion of a distinction of a partition (a pair of elements in different blocks). Boole developed finite logical probability as the normalized counting measure on elements of (...) subsets so there is a dual concept of logical entropy which is the normalized counting measure on distinctions of partitions. Thus the logical notion of information is a measure of distinctions. Classical logical entropy naturally extends to the notion of quantum logical entropy which provides a more natural and informative alternative to the usual Von Neumann entropy in quantum information theory. The quantum logical entropy of a post-measurement density matrix has the simple interpretation as the probability that two independent measurements of the same state using the same observable will have different results. The main result of the paper is that the increase in quantum logical entropy due to a projective measurement of a pure state is the sum of the absolute squares of the off-diagonal entries ("coherences") of the pure state density matrix that are zeroed ("decohered") by the measurement, i.e., the measure of the distinctions ("decoherences") created by the measurement. (shrink)

The logical basis for information theory is the newly developed logic of partitions that is dual to the usual Boolean logic of subsets. The key concept is a "distinction" of a partition, an ordered pair of elements in distinct blocks of the partition. The logical concept of entropy based on partition logic is the normalized counting measure of the set of distinctions of a partition on a finite set--just as the usual logical notion of probability based on the Boolean logic (...) of subsets is the normalized counting measure of the subsets (events). Thus logical entropy is a measure on the set of ordered pairs, and all the compound notions of entropy (join entropy, conditional entropy, and mutual information) arise in the usual way from the measure (e.g., the inclusion-exclusion principle)--just like the corresponding notions of probability. The usual Shannon entropy of a partition is developed by replacing the normalized count of distinctions (dits) by the average number of binary partitions (bits) necessary to make all the distinctions of the partition. (shrink)

What counts as human rationality: reasoning processes that embody content-independent formal theories, such as propositional logic, or reasoning processes that are well designed for solving important adaptive problems? Most theories of human reasoning have been based on content-independent formal rationality, whereas adaptive reasoning, ecological or evolutionary, has been little explored. We elaborate and test an evolutionary approach, Cosmides' social contract theory, using the Wason selection task. In the first part, we disentangle the theoretical concept of a “social contract” from that (...) of a “cheater-detection algorithm”. We demonstrate that the fact that a rule is perceived as a social contract — or a conditional permission or obligation, as Cheng and Holyoak proposed — is not sufficient to elicit Cosmides' striking results, which we replicated. The crucial issue is not semantic, but pragmatic: whether a person is cued into the perspective of a party who can be cheated. In the second part, we distinguish between social contracts with bilateral and unilateral cheating options. Perspective change in contracts with bilateral cheating options turns P & not-Q responses into not-P & Q responses. The results strongly support social contract theory, contradict availability theory, and cannot be accounted for by pragmatic reasoning schema theory, which lacks the pragmatic concepts of perspectives and cheating detection. (shrink)

This study explores several arguments against Spinoza's philosophy that were developed by Henry More, Samuel Clarke, and Colin Maclaurin. In the arguments on which I focus, More, Clarke, and Maclaurin aim to establish the existence of an immaterial and intelligent God precisely by showing that Spinoza does not have the resources to adequately explain the origin of motion. Attending to these criticisms grants us a deeper appreciation for how the authority derived from the empirical success of Newton's enterprise was used (...) to settle debates within philosophy. What I emphasize is that in the progression from More to Clarke to Maclaurin, key Newtonian concepts from the Principia (1687), such as motion, atomism, and the vacuum, are introduced and exploited in order to challenge the account of matter and motion that is presented in Spinoza's Ethics (1677). Building on this treatment, I use the arguments from More and Clarke especially to help discern the anti-Spinozism that can be detected in Newton's General Scholium (1713). Ultimately, the Newtonian criticisms that I detail offer us a more nuanced view of the problems that plague Spinoza's philosophy, and they also challenge the idea that Spinoza seamlessly fits into a progressive narrative about the scientific revolution. (shrink)

Sections 1 through 3 present all of the main ideas behind the probabilistic logic of evidential support. For most readers these three sections will suffice to provide an adequate understanding of the subject. Those readers who want to know more about how the logic applies when the implications of hypotheses about evidence claims (called likelihoods) are vague or imprecise may, after reading sections 1-3, skip to section 6. Sections 4 and 5 are for the more advanced reader who wants a (...) detailed understanding of some telling results about how this logic may bring about convergence to the truth. (shrink)

There is a growing interest in the foundations as well as the application of imprecise probability in contemporary epistemology. This dissertation is concerned with the application. In particular, the research presented concerns ways in which imprecise probability, i.e. sets of probability measures, may helpfully address certain philosophical problems pertaining to rational belief. The issues I consider are disagreement among epistemic peers, complete ignorance, and inductive reasoning with imprecise priors. For each of these topics, it is assumed that belief can be (...) modeled with imprecise probability, and thus there is a non-classical solution to be given to each problem. I argue that this is the case for peer disagreement and complete ignorance. However, I discovered that the approach has its shortcomings, too, specifically in regard to inductive reasoning with imprecise priors. Nevertheless, the dissertation ultimately illustrates that imprecise probability as a model of rational belief has a lot of promise, but one should be aware of its limitations also. (shrink)

This paper shows how the classical finite probability theory (with equiprobable outcomes) can be reinterpreted and recast as the quantum probability calculus of a pedagogical or toy model of quantum mechanics over sets (QM/sets). There have been several previous attempts to develop a quantum-like model with the base field of ℂ replaced by ℤ₂. Since there are no inner products on vector spaces over finite fields, the problem is to define the Dirac brackets and the probability calculus. The previous attempts (...) all required the brackets to take values in ℤ₂. But the usual QM brackets <ψ|ϕ> give the "overlap" between states ψ and ϕ, so for subsets S,T⊆U, the natural definition is <S|T>=|S∩T| (taking values in the natural numbers). This allows QM/sets to be developed with a full probability calculus that turns out to be a non-commutative extension of classical Laplace-Boole finite probability theory. The pedagogical model is illustrated by giving simple treatments of the indeterminacy principle, the double-slit experiment, Bell's Theorem, and identical particles in QM/Sets. A more technical appendix explains the mathematics behind carrying some vector space structures between QM over ℂ and QM/Sets over ℤ₂. (shrink)

Following the development of the selectionist theory of the immune system, there was an attempt to characterize many biological mechanisms as being "selectionist" as juxtaposed to "instructionist." But this broad definition would group Darwinian evolution, the immune system, embryonic development, and Chomsky's language-acquisition mechanism as all being "selectionist." Yet Chomsky's mechanism (and embryonic development) are significantly different from the selectionist mechanisms of biological evolution or the immune system. Surprisingly, there is a very abstract way using two dual mathematical logics to (...) make the distinction between genuinely selectionist mechanisms and what are better called "generative" mechanisms. This note outlines that distinction. (shrink)

The aim of this article is Schröder’s treatment of the so called solution problem [Auflösungsproblem]. First, I will introduce Schröder’s ideas; then I will discuss them taking into account Peirce’s considerations in The Logic of Relatives ([13, pp. 161–217] now republished in [9, pp. 288–345]).

Each science has its own domain of investigation, but one and the same science can be formalized in different languages with different universes of discourse. The concept of the domain of a science and the concept of the universe of discourse of a formalization of a science are distinct, although they often coincide in extension. In order to analyse the presuppositions and implications of choices of domain and universe, this article discusses the treatment of omega arguments in three very different (...) formalizations of arithmetic. In Peano's formalization the domain is a restricted class of individuals, while the universe of discourse is the unrestricted class of all individuals. In Gödel's formalization the domain is a restricted class of individuals as in Peano's formalization, but the universe of discourse coincides with the domain. In Whitehead-Russell's formalization the domain is a class of logical notions in Tarski's sense, that are necessarily not individuals, whereas the universe of discourse is the unrestricted class of individuals as in Peano's formalization. The present approach emphasizes the viewpoint that the universe of discourse of a given discourse is important in determining which propositions are expressed by which sentences. (shrink)

O presente artigo busca debater a posição de Charles Sanders Peirce e dos primeiros estudantes peirceanos de Lógica (Christine Ladd e O. H. Mitchell nos Studies in Logic, 1883) dentro do debate inspirador da visão da linguagem dentro da Filosofia Analítica, conhecido como “Lingua Universalis contra Calculus Ratiocinator”, cujos primórdios podem ser traçados desde a filosofia de Gottfried Leibniz. Para isso, comparamos esse campo do pensamento peirceano com o debate crucial entre a conceitografia de Gottlob Frege (Begriffsschrift, 1879) e a (...) lógica algébrica de George Boole (An investigation of the Laws of Thought on which are founded the mathematical theories of Logic and Probabilities, 1854). O nosso objetivo principal é observar que esse momento da filosofia peirceana pode ser comparado com o pensamento wittgensteiniano, especialmente em sua nova vertente, chamada New Wittgenstein, que tenta superar a tradicional divisão entre Tractatus Logico-Philosophicus e Investigações Filosóficas. Pela comparação entre pensadores influenciados por C. S. Peirce e a filosofia de Ludwig Wittgenstein, pretendemos abrir caminhos na compreensão do conceito de jogo de linguagem, especialmente em sua gramática e em seus operadores simbólicos, através da observação das funções de verdade [truth functions] e as tabelas de verdade [truth tables] enquanto lógica algébrica. (shrink)

Following the development of the selectionist theory of the immune system, there was an attempt to characterise many biological mechanisms as being ‘selectionist’ as juxtaposed with ‘instructionist’. However, this broad definition would group Darwinian evolution, the immune system, embryonic development, and Chomsky’s principles-and-parameters language-acquisition mechanism together under the ‘selectionist’ umbrella, even though Chomsky’s mechanism and embryonic development are significantly different from the selectionist mechanisms of biological evolution and the immune system. Surprisingly, there is an abstract way using two dual mathematical (...) logics to make the distinction between genuinely selectionist mechanisms and what are better called ‘generative’ or symmetry-breaking mechanisms. This distinction is outlined in this note. (shrink)

Hypotheticals, conditionals, and their connecting relation, implication, dramatically changed their meanings during the nineteenth and early part of the twentieth century. Modern logicians ordinarily do not distinguish between the terms hypothetical and conditional. Yet in the late nineteenth century their meanings were quite different, their ties to the implication relation either were unclear, or the implication relation was used exclusively as a logical operator. I will trace the development of implication as an inference operator from these earlier notions into the (...) first third of the twentieth century using as the starting point the ideas primarily of R. Whately and W. Hamilton before discussing the work of the transitional logicians, A. De Morgan and G. Boole on these topics. Then we discuss the relevant views of four prominent but relatively unknown nineteenth century British logicians, W.E. Johnson, J.N. Keynes, E.E.C. Jones, and H. MacColl, as well as those of the more influential logicians, W.S. Jevons and J. Venn, closing with a section on ‘implication as inference’ where we explore some key ideas of B. Russell and sketch the work of D. Hilbert, P. Hertz, and G. Gentzen who together are responsible for the development of the modern ideas related to the subjects of this paper. (shrink)

This paper focuses on the evolution of the notion of completeness in contemporary logic. We discuss the differences between the notions of completeness of a theory, the completeness of a calculus, and the completeness of a logic in the light of Gödel's and Tarski's crucial contributions.We place special emphasis on understanding the differences in how these concepts were used then and now, as well as on the role they play in logic. Nevertheless, we can still observe a certain ambiguity in (...) the use of the close notions of completeness of a calculus and completeness of a logic. We analyze the state of the art under which Gödel's proof of completeness was developed, particularly when dealing with the decision problem for first-order logic. We believe that Gödel had to face the following dilemma: either semantics is decidable, in which case the completeness of the logic is trivial or, completeness is a critical property but in this case it cannot be obtained as a corollary of a previous decidability result. As far as first-order logic is concerned, our thesis is that the contemporary understanding of completeness of a calculus was born as a generalization of the concept of completeness of a theory. The last part of this study is devoted to Henkin's work concerning the generalization of his completeness proof to any logic from his initial work in type theory. (shrink)

It is a commonplace that in the development of modern logic towards its actual shape at least two directions or traditions have to be distinguished. These traditions may be called, following the mo...

The introduction has a brief statement, sufficient for the purpose of this paper, which describes in general terms the notion of probability logic on which the paper is based. Contributions made in the eighteenth century by Leibniz, Jacob Bernoulli and Lambert, and in the nineteenth century by Bolzano, De Morgan, Boole, Peirce and MacColl are critically examined from a contemporary point of view. Historicity is maintained by liberal quotations from the original sources accompanied by interpretive explanation. Concluding the paper is (...) a summary. (shrink)

Charles L. Dodgson's reputation as a significant figure in nineteenth-century logic was firmly established when the philosopher and historian of philosophy William Warren Bartley, III published Dodgson's ?lost? book of logic, Part II of Symbolic Logic, in 1977. Bartley's commentary and annotations confirm that Dodgson was a superb technical innovator. In this paper, I closely examine Dodgson's methods and their evolution in the two parts of Symbolic Logic to clarify and justify Bartley's claims. Then, using more recent publications and unpublished (...) letters, I argue that Dodgson approached the elimination problem in class logic differently than his contemporaries, and in doing so, anticipated several important concepts and techniques in automated deductive reasoning. These materials also provide additional insight into his reasons for writing this book. (shrink)

Para Frege las relaciones lógicas se dan entre contenidos judicables, entre pensamientos. Aquellas relaciones son inferenciales. Los pensamientos se definen a través de sus relaciones inferenciales con otros. De acuerdo con esto es discutible afirmar, como lo hizo Schröder, que el proyecto lógico de Frege es como el proyecto lógico de Boole. También es cuestionable afirmar, como lo hizo Dummett, que la relación inferencial no es siempre central en el proyecto fregeano. En este texto defenderé una lectura del proyecto lógico (...) de Frege, en contra de las posturas de Schröder y Dummett. (shrink)

Mercier and Sperber illuminate many aspects of reasoning and rationality, providing refreshing and thoughtful analysis and elegant and well‐researched illustrations. They make a good case that reasoning should be viewed as a type of intuition, rather than a separate cognitive process or system. Yet questions remain. In what sense, if any, is reasoning a “module?” What is the link between rationality within an individual and rationality defined through the interaction between individuals? Formal theories of rationality, from logic, probability theory and (...) game theory, while not the focus of Mercier and Sperber's book, may help clarify this latter question. (shrink)

I discuss Aristotle’s opening argument against Platonic Forms in _Metaphysics_ A.9, ‘the Razor’, which criticizes the introduction of Forms on the basis of an analogy with a hypothetical case of counting things. I argue for a new interpretation of this argument, and show that it involves two interesting objections against the introduction of Forms as formal causes: one concerns the completeness and the other the adequacy of such an explanatory project.

According to the fitting-attitude analysis of value , to be valuable is to be a fitting object of a pro-attitude. In earlier publications, setting off from this format of analysis, I proposed a modelling of value relations which makes room for incommensurability in value. In this paper, I first recapitulate the value modelling and then move on to suggest adopting a structurally similar analysis of probability. Indeed, many probability theorists from Poisson onwards did adopt an analysis of this kind. This (...) move allows to formally model probability and probability relations in essentially the same way as value and value relations. One of the advantages of the model is that we get a new account of Keynesian incommensurable probabilities, which goes beyond Keynes in distinguishing between different types of incommensurability. It also becomes possible to draw a clear distinction between incommensurability and vagueness in probability comparisons. (shrink)

Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of cross-entropy minimization. To adequately formalize inductive probabilistic reasoning is an interesting topic for artificial intelligence, as an autonomous system (...) acting in a complex environment may have to base its actions on a probabilistic model of its environment, and the probabilities needed to form this model can often be obtained by combining statistical background information with particular observations made, i.e., by inductive probabilistic reasoning. In this paper a formal framework for inductive probabilistic reasoning is developed: syntactically it consists of an extension of the language of first-order predicate logic that allows to express statements about both statistical and subjective probabilities. Semantics for this representation language are developed that give rise to two distinct entailment relations: a relation ⊨ that models strict, probabilistically valid, inferences, and a relation that models inductive probabilistic inferences. The inductive entailment relation is obtained by implementing cross-entropy minimization in a preferred model semantics. A main objective of our approach is to ensure that for both entailment relations complete proof systems exist. This is achieved by allowing probability distributions in our semantic models that use non-standard probability values. A number of results are presented that show that in several important aspects the resulting logic behaves just like a logic based on real-valued probabilities alone. (shrink)

Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets which are category-theoretically dual to one another (...) and which are developed in two dual mathematical logics, the usual Boolean logic of subsets and the more recent logic of partitions. Our sense-making strategy is "follow the math" by showing how the mathematics of set partitions can be transported in a natural way to complex vector spaces where it yields the mathematical machinery of QM. And then we show how the machinery of QM can be transported the other way down to set-like vector spaces over ℤ₂ yielding a rather fulsome "toy" or pedagogical model of "quantum mechanics over sets." In this way, we try to make sense out of objective indefiniteness and thus to interpret quantum mechanics. (shrink)

In 1952, Quine showed that the problem of reducing a propositional formula to a simplest normal equivalent can be solved in two steps, viz., (i) express the given formula, Φ, equivalently as the disjunction of all its prime implicants, and (ii) find all non-redundant disjunctions of the latter that are equivalent to Φ (Quine 1952). However, it seems not generally known that an ingenious form of the same two-step process was published by Hugh McColl in 1878.

This paper augments Hailperin's substantial efforts to place Boole's algebra of logic on a solid footing. Namely Horn sentences are used to give a modern formulation of the principle that Boole adopted in 1854 as the foundation for his algebra of logic—we call this principle The Rule of 0 and 1.

The explanation of the suppression of Modus Ponens inferences within the framework of linguistic pragmatics and of plausible reasoning (i.e., deduction from uncertain premises) is defended. First, this approach is expounded, and then it is shown that the results of the first experiment of Byrne, Espino, and Santamar a (1999) support the uncertainty explanation but fail to support their counterexample explanation. Second, two experiments are presented. In the first one, aimed to refute one objection regarding the conclusions observed, the additional (...) conditional premise ( if N, C ) was replaced with a statement of uncertainty ( it is not certain that N ); the answers produced by the participants remained qualitatively and quantitatively similar in both conditions. In the second experiment, a fine-grained analysis of the responses to and justifications for an evaluation task was performed. The results of both experiments strongly supported the uncertainty explanation. (shrink)

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hubert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by their nondistributivity and by various other problems. We show that a possible resolution of these difficulties, suggested by the ideas of Bohr, emerges if instead of single projections one considers elementary propositions to be families (...) of projections indexed by a partially ordered set C(A) of appropriate commutative subalgebras of A. In fact, to achieve both maximal generality and ease of use within topos theory, we assume that A is a so-called Rickart C*-algebra and that C(A) consists of all unital commutative Rickart C*-subalgebras of A. Such families of projections form a Hey ting algebra in a natural way, so that the associated propositional logic is intuitionistic: distributivity is recovered at the expense of the law of the excluded middle. Subsequently, generalizing an earlier computation for n x n matrices, we prove that the Heyting algebra thus associated to A arises as a basis for the internal Gelfand spectrum (in the sense of Banaschewski-Mulvey) of the "Bohrification" A̱ of A, which is a commutative Rickart C*-algebra in the topos of functors from C(A) to the category of sets. We explain the relationship of this construction to partial Boolean algebras and Bruns-Lakser completions. Finally, we establish a connection between probability measures on the lattice of projections on a Hubert space H and probability valuations on the internal Gelfand spectrum of A̱ for A = B(H). (shrink)