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)

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)

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 are two parts. The notion of an "event" is reinterpreted from being an epistemological state of indefiniteness to being an objective state of indefiniteness. And the mathematical framework of finite probability theory is recast as the quantum probability calculus for QM/sets. The point is not to (...) clarify finite probability theory but to elucidate quantum mechanics itself by seeing some of its quantum features in a classical setting. (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)

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)

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)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (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)

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.

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]).

In this paper, the foundations for setting up a knowledge industry are laid. Firstly, it is established that this industry constitutes the only way of making use of the huge amounts of knowledge produced as a result of the introduction of the Science-Technology binomial in postindustrial society. Then, the elements which will lead to such an industry are defined, that is, the resources and means. Under the ‘Means’ section, special emphasis is placed on the processes involved, in other words, inference (...) methods and commonsense reasoning. Finally, it is concluded that the establishment of this industry, calledmindfacturing because of the raw material that it processes and uses, is, more than possible, desirable, provided that the precautions outlined in the epilogue are taken. (shrink)

In this paper, I stress the utility of employing test-driven development (TDD) for conceiving logical systems. TDD, originally invented in the context of Extreme Programming, is a methodology widely used by software engineers to conceive and develop programs. Its main principle is to design the tests of the expected properties of the system before the development phase. I argue that this methodology is especially convenient in conceiving applied logics. Indeed, this technique is efficient with most decidable logics having a software (...) implementation. Having a clear list of the desired inferences right from the beginning makes it possible to refine the properties of the system step by step until its completion. I distinguish and detail seven advantages of the usage of TDD for the conception of a logical theory. Most importantly, this methodology increases the predictability of the inferential power of the theory. A second important benefit is that the time required for the conception of the logic goes down dramatically. This methodology will change both ideas and practices. Logic is no longer considered to be a formal science, but rather to be an empirical one. Research in the field is geared toward specific and concrete goals. Programs are considered tools used to verify the conformity of formal theories. To sum up, I defend the view that, in some situations, this way of designing a formal system brings significant benefits, and that the construction of new logics can be conducted similarly to the development of open source software. (shrink)

In the period 1893–1897 Charles Dodgson, writing as Lewis Carroll, published two books and two articles on logic topics. Manuscript material first published in 1977 together with letters and diary entries provide evidence that he was working toward a visual proof system for complex syllogistic propositional logic based on a mechanical tree method that he devised.

The paper first introduces a cube of opposition that associates the traditional square of opposition with the dual square obtained by Piaget’s reciprocation. It is then pointed out that Blanché’s extension of the square-of-opposition structure into an conceptual hexagonal structure always relies on an abstract tripartition. Considering quadripartitions leads to organize the 16 binary connectives into a regular tetrahedron. Lastly, the cube of opposition, once interpreted in modal terms, is shown to account for a recent generalization of formal concept analysis, (...) where noticeable hexagons are also laid bare. This generalization of formal concept analysis is motivated by a parallel with bipolar possibility theory. The latter, albeit graded, is indeed based on four graded set functions that can be organized in a similar structure. (shrink)

Belief revision from the point of view of doxastic logic. Logic Journal of the IGPL, 3(4), 535–553. Segerberg, K. (1995). Conditional action. In G. Crocco, L. Fariñas, & A. Herzig (Eds.), Conditionals: From philosophy to computer science, Studies ...

Deontic logic is devoted to the study of logical properties of normative predicates such as permission, obligation and prohibition. Since it is usual to apply these predicates to actions, many deontic logicians have proposed formalisms where actions and action combinators are present. Some standard action combinators are action conjunction, choice between actions and not doing a given action. These combinators resemble boolean operators, and therefore the theory of boolean algebra offers a well-known athematical framework to study the properties of the (...) classic deontic operators when applied to actions. In his seminal work, Segerberg uses constructions coming from boolean algebras to formalize the usual deontic notions. Segerberg’s work provided the initial step to understand logical properties of deontic operators when they are applied to actions. In the last years, other authors have proposed related logics. In this chapter we introduce Segerberg’s work, study related formalisms and investigate further challenges in this area. (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)

The probabilization of a logic system consists of enriching the language (the formulas) and the semantics (the models) with probabilistic features. Such an operation is said to be exogenous if the enrichment is done on top, without internal changes to the structure, and is called endogenous otherwise. These two different enrichments can be applied simultaneously to the language and semantics of a same logic. We address the problem of studying the transference of metaproperties, such as completeness and decidability, to the (...) exogenous probabilization of an abstract logic system. First, we setup the necessary framework to handle the probabilization of a satisfaction system by proving transference results within a more general context. In this setup, we define a combination mechanism of logics through morphisms and prove sufficient condition to guarantee completeness and decidability. Then, we demonstrate that probabilization is a special case of this exogenous combination method, and that it fulfills the general conditions to obtain transference of completeness and decidability. Finally, we motivate the applicability of our technique by analyzing the probabilization of the linear temporal logic over Markov chains, which constitutes an endogenous probabilization. The results are obtained first by studying the exogenous semantics, and then by establishing an equivalence with the original probabilization given by Markov chains. (shrink)

Van Heijenoort’s account of the historical development of modern logic was composed in 1974 and first published in 1992 with an introduction by his former student. What follows is a new edition with a revised and expanded introduction and additional notes.

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)

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)

We analyze the connections of Lavoisier system of nomenclature with Leibniz’s philosophy, pointing out to the resemblance between what we call Leibnizian and Lavoisian programs. We argue that Lavoisier’s contribution to chemistry is something more subtle, in so doing we show that the system of nomenclature leads to an algebraic system of chemical sets. We show how Döbereiner and Mendeleev were able to develop this algebraic system and to find new interesting properties for it. We pointed out the resemblances between (...) Leibniz program and Lavoisier legacy, particularly regarding the lingua philosophica for understanding and thinking Nature, in this particular case, chemistry. In the second part we discuss, from the linguistic viewpoint, how Lavoisian algebraic system may be taken further to build a language. We study the constituents of such a chemical language. Finally, we formalize some of the ideas here presented by using elements of network theory and discrete mathematics. (shrink)

It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. These (...) practices presuppose, respectively, a criterion of validity and a criterion of invalidity each of which has been extended and refined by modern logicians: deductions are studied in formal syntax (proof theory) and coun¬termodels are studied in formal semantics (model theory). The purpose of this paper is to compare these two criteria to the corresponding criteria employed in Boole’s first logical work, The Mathematical Analysis of Logic (1847). In particular, this paper presents a detailed study of the relevant metalogical passages and an analysis of Boole’s symbolic derivations. It is well known, of course, that Boole’s logical analysis of compound terms (involving ‘not’, ‘and’, ‘or’, ‘except’, etc.) contributed to the enlargement of the class of propositions and arguments formally treatable in logic. The present study shows, in addition, that Boole made significant contributions to the study of deduc¬tive reasoning. He identified the role of logical axioms (as opposed to inference rules) in formal deductions, he conceived of the idea of an axiomatic deductive sys¬tem (which yields logical truths by itself and which yields consequences when ap¬plied to arbitrary premises). Nevertheless, surprisingly, Boole’s attempt to imple¬ment his idea of an axiomatic deductive system involved striking omissions: Boole does not use his own formal deductions to establish validity. Boole does give symbolic derivations, several of which are vitiated by “Boole’s Solutions Fallacy”: the fallacy of supposing that a solution to an equation is necessarily a logical consequence of the equation. This fallacy seems to have led Boole to confuse equational calculi (i.e., methods for gen-erating solutions) with deduction procedures (i.e., methods for generating consequences). The methodological confusion is closely related to the fact, shown in detail below, that Boole had adopted an unsound criterion of validity. It is also shown that Boole totally ignored the countermodel criterion of invalid¬ity. Careful examination of the text does not reveal with certainty a test for invalidity which was adopted by Boole. However, we have isolated a test that he seems to use in this way and we show that this test is ineffectual in the sense that it does not serve to identify invalid arguments. We go beyond the simple goal stated above. Besides comparing Boole’s earliest criteria of validity and invalidity with those traditionally (and still generally) employed, this paper also investigates the framework and details of THE MATHEMATICAL ANALYSIS OF LOGIC. (shrink)

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)

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...

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)

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)

We reconstruct Frege’s treatment of certain deducibility problems posed by Boole. It turns out that in his formalization and solution of Boole’s problems Frege anticipates the idea of propositional resolution.

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)

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)

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)

In 1880, when Oliver Wendell Holmes (later to be a Justice of the U.S. Supreme Court) criticized the logical theology of law articulated by Christopher Columbus Langdell (the first Dean of Harvard Law School), neither Holmes nor Langdell was aware of the revolution in logic that had begun, the year before, with Frege's Begriffsschrift. But there is an important element of truth in Holmes's insistence that a legal system cannot be adequately understood as a system of axioms and corollaries; and (...) this element of truth is not obviated by the more powerful logical techniques that are now available. (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.

Charles Peirce is often credited for being among the first, perhaps even the first, to develop a scientific metaphysics of indeterminism. After rejecting the received view that Peirce developed his views from Darwin and Maxwell, I argue that Peirce's view results from his synthesis of Immanuel Kant's critical philosophy and George Boole's contributions to formal logic. Specifically, I claim that Kant's conception of the laws of logic as the basis for his architectonic, when combined with Boole's view of probability, yields (...) Peirce's metaphysics of probabilistic laws. Indeterminism provides, therefore, an excellent illustration of how Peirce attempted to use logic to clarify metaphysical problems.Since everyone must have conceptions of things in general, it is most important that they should be carefully constructed. I shall enter into no criticism of the different methods of metaphysical research, but shall merely say that in the opinions of several great thinkers, the only successful mode yet lighted upon is that of adopting our logic as our metaphysics. (W1: 490, 1866)2. (shrink)

We present new probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment, called Zλ- and lexλ-entailment, which are parameterized through a value λ ∈ [0,1] that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of λ = 0 and λ = 1, the notions of Zλ- and lexλ-entailment coincide with probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment that have been recently introduced by the author. We show (...) that the notions of Zλ- and lexλ-entailment have similar properties as their classical counterparts. In particular, they both satisfy the rationality postulates of System P and the property of Rational Monotonicity. Moreover, Zλ-entailment is weaker than lexλ-entailment, and both Zλ- and lexλ-entailment are proper generalizations of their classical counterparts. (shrink)

This paper consists of three main parts. First, we give an introduction to Hill’s assumption A (n) and to theory of interval probability, and an overview of recently developed theory and methods for nonparametric predictive inference (NPI), which is based on A (n) and uses interval probability to quantify uncertainty. Thereafter, we illustrate NPI by introducing a variation to the assumption A (n), suitable for inference based on circular data, with applications to several data sets from the literature. This includes (...) attention to comparison of two groups of circular data, and to grouped data. We briefly discuss such inference for multiple future observations. We end the paper with a discussion of NPI and objective Bayesianism. (shrink)

1. Does Hegel’s The Science of Logic (Hegel 2010) have any relation to or relevance for what is now known as ‘the science of logic’? Here a negative answer is as likely to be endorsed by many conte...

The paradox of material implication has remained unresolved since antiquity because it was believed that the nature of implication was entailment. The article shows that this nature is opposition and therefore the name "implication" should be replaced with the name "competition". A solution to the paradox is provided along with appropriate changes in nomenclature, the addition of connectives and the postulate that the biconditional take over the role of the previous implication. In addition, changes to the nomenclature of logic gates (...) reflecting the competition in electronics are proposed. (shrink)

Paradoks implikacji materialnej pozostawał nierozwiązany od starożytności, ponieważ uważano, że naturą implikacji jest wynikanie. Artykuł ukazuje, że tą naturą jest przeciwstawność. Zostaje podane rozwiązanie paradoksu wraz z odpowiednimi zmianami nazewnictwa, dodaniem konektywów i postulatem przejęcia roli dotychczasowej implikacji przez równoważność. Ponadto zaproponowane zostają zmiany nazewnictwa bramek logicznych, odwzorowujących kompetycję w elektronice.

Already in ancient philosophy, there was a transition from the implicit and hidden action of the Logical ( lógos) in nature ( phýsis) to the scientific and explicit expression of the logical structures of thought, action, the world and language. Heraclitus' heno-logic with Logos as hidden implicit principle of homologization of opposites ( tà enantía) in nature differs from Parmenides' paraconsistent logic developed in a hypothetical hemidyalectics given in the formula ''All is One'' ( hén pánta eînai). Plato's concept of (...) dia-logic (dialektikè téchne ) with a new concept of Logos as the one genus of beings ( hén tí génon toôn ontoôn) in which the word not-Being (negation) got its place enabled production of dyadic logical structure by the granulation of genera into opposite species and sub-species that it contains. Aristotle's concept of triadic-logic as syl-logistics ( syllogismós) and demonstrative science (epistéme apodeiktikê ) give a new approach by new granulation of the concept of Logos into triadic logical structure: (1) the structure of being (substratum-attributes relation), (2) the structure of thought (substance-second substances relation), and (3) the structure of propositions (subject-predicate relation). Plato's dialectic and Aristotle's syllogistic both deconstructed the implicit ontological unity of the world (pan, kosmos, sphairos ) given through the concept of Logos in Pre-Socratic philosophy in order to make that unity in explicit form given by the logical and semantical structures of the propositions about the world, about the thought and about the language. The hidden implicit of the nature, which had to be known intuitively, was transformed into unhidden explicit inferential logical structures given in the semantics and pragmatics of scientific demonstration. (shrink)

In this paper we argue that there were several currents, ideas and problems in 19th-century logic that motivated John Venn to develop his famous logic diagrams. To this end, we first examine the problem of uncertainty or over-specification in syllogistic that became obvious in Euler diagrams. In the 19th century, numerous logicians tried to solve this problem. The most famous was the attempt to introduce dashed circles into Euler diagrams. The solution that John Venn developed for this problem, however, came (...) from a completely different area of logic: instead of orienting to syllogistic like Euler diagrams, Venn applied Boolean algebra to improve visual reasoning. Venn’s contribution to solving the problem of elimination also played an important role. The result of this development is still known today as the ‘Venn Diagram’. (shrink)

This paper discusses the theory of knowledge based on the idea of dynamical space. The goal of this effort is to comprehend the knowledge that remains beyond the human domain, e.g., of the artificial cognitive systems. This theory occurs in two versions, weak and strong. The weak version is limited to knowledge in which retention and articulation are performed through the discourse. The strong version is general and is not limited in any way. In the weak version, knowledge is represented (...) by the trajectories of discourses in time, in a dynamical space called the discursive space, which has an arbitrary number of dimensions. Given space is used to represent a given part of knowledge. A manifold is introduced to represent knowledge with a wider scope (all knowledge). The strong version is an extrapolation of the weak version to cover all forms of knowledge, not necessarily human or manifesting in language. The use of dynamical space construction allows one to formalize knowledge as such. Such an effort requires us to initially consider knowledge as mainly a social and linguistic phenomenon, which also could be presented as a result of the evolution of the understanding of knowledge that took place in the 20th century. (shrink)

Standard histories of mathematics and of analytic philosophy contend that work on the foundations of mathematics was motivated by a crisis such as the discovery of paradoxes in set theory or the discovery of non-Euclidean geometries. Recent scholarship, however, casts doubt on the standard histories, opening the way for consideration of an alternative motive for the study of the foundations of mathematics—unification. Work on foundations has shown that diverse mathematical practices could be integrated into a single framework of axiomatic systems (...) and that much of mathematics could be expressed in a single language. The new framework was the product of an interdisciplinary coalition whose ideas resemble those later adopted by the Vienna Circle and logical empiricists. (shrink)