A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.

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)

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)

In this extended essay, I argue that Frege plagiarized the Stoics --and I mean exactly that-- on a large scale in his work on the philosophy of logic and language as written mainly between 1890 and his death in 1925 (much of which published posthumously) and possibly earlier. I use ‘plagiarize' (or 'plagiarise’) merely as a descriptive term. The essay is not concerned with finger pointing or casting moral judgement. The point is rather to demonstrate carefully by means of detailed (...) evidence that there are numerous (over a hundred) and extensive parallels both in formulation and --more importantly-- in content between the Stoics and Frege, parallels so plentiful that one would be hard pressed to brush them off as coincidence. These parallels include several that appear to occur in no other modern works that were published before Frege’s own and were accessible to him. Additionally, a cluster of corroborating historical data is adduced to support the suggestion, showing how easy it would have to been for Frege to plagiarize the Stoics. This (first) part of the essay is easy to read and vaguely entertaining, or so I hope. -/- (Corrigendum: At school, Frege likely had seven, not ten, years of intensive Latin and four years of intensive ancient Greek courses.). (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)

This volume concerns Rational Agents - humans, players in a game, software or institutions - which must decide the proper next action in an atmosphere of partial information and uncertainty. The book collects formal accounts of Uncertainty, Rationality and Agency, and also of their interaction. It will benefit researchers in artificial systems which must gather information, reason about it and then make a rational decision on which action to take.

The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources (...) of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method”, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the role of logic in philosophy. (shrink)

According to the fitting-attitude analysis of value (FA-analysis), 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 (indeterminacy) in probability comparisons. (shrink)

Ultralogic as Universal? is a seminal text in non-classcial logic. Richard Routley presents a hugely ambitious program: to use an 'ultramodal' logic as a universal key, which opens, if rightly operated, all locks. It provides a canon for reasoning in every situation, including illogical, inconsistent and paradoxical ones, realized or not, possible or not. A universal logic, Routley argues, enables us to go where no other logic—especially not classical logic—can. Routley provides an expansive and singular vision of how a universal (...) logic might one day solve major problems in set theory, arithmetic, linguistics, physics, and more. It circulated in typescript in the late 1970s before appearing as the Appendix to Exploring Meinong's Jungle and Beyond. With engaging, forceful prose, unsparing criticism of entrenched institutions, and many tantalizing proof sketches, Ultralogic? has had a major influence on the development of paraconsistent and relevant logic. This new edition makes this work available for a modern audience, newly typeset and corrected, along with extensive notes, and new commentary essays. (shrink)

This book celebrates the work of Don Pigozzi on the occasion of his 80th birthday. In addition to articles written by leading specialists and his disciples, it presents Pigozzi’s scientific output and discusses his impact on the development of science. The book both catalogues his works and offers an extensive profile of Pigozzi as a person, sketching the most important events, not only related to his scientific activity, but also from his personal life. It reflects Pigozzi's contribution to the rise (...) and development of areas such as abstract algebraic logic, universal algebra and computer science, and introduces new scientific results. Some of the papers also present chronologically ordered facts relating to the development of the disciplines he contributed to, especially abstract algebraic logic. The book offers valuable source material for historians of science, especially those interested in history of mathematics and logic. (shrink)

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

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

One of the characteristic features of contemporary logic is that it incorporates the Frege‐Russell thesis according to which verbs for being are multiply ambiguous. This thesis was not accepted before the nineteenth century. In Aristotle existence could not serve alone as a predicate term. However, it could be a part of the force of the predicate term, depending on the context. For Kant existence could not even be a part of the force of the predicate term. Hence, after Kant, existence (...) was left homeless. It found a home in the algebra of logic in which the operators corresponding to universal and particular judgments were treated as duals, and universal judgments were taken to be relative to some universe of discourse. Because of the duality, existential quantifier expressions came to express existence. The orphaned notion of existence thus found a new home in the existential quantifier. (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)

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)

This work presents an operational and geometric approach to logic. It starts from the multilinear elective decomposition of binary logical functions in the original form introduced by George Boole. A justification on historical grounds is presented bridging Boole’s theory and the use of his arithmetical logical functions with the axioms of Boolean algebra using sets and quantum logic. It is shown that this algebraic polynomial formulation can be naturally extended to operators in finite vector spaces. Logical operators will appear as (...) commuting projection operators and the truth values, which take the binary values \, are the respective eigenvalues. In this view the solution of a logical proposition resulting from the operation on a combination of arguments will appear as a selection where the outcome can only be one of the eigenvalues. In this way propositional logic can be formalized in linear algebra by using elective developments which correspond here to combinations of tensored elementary projection operators. The original and principal motivation of this work is for applications in the new field of quantum information, differences are outlined with more traditional quantum logic approaches. (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)

This essay describes a variety of contributions which relate to the connection of probability with logic. Some are grand attempts at providing a logical foundation for probability and inductive inference. Others are concerned with probabilistic inference or, more generally, with the transmittance of probability through the structure (logical syntax) of language. In this latter context probability is considered as a semantic notion playing the same role as does truth value in conventional logic. At the conclusion of the essay two fully (...) elaborated semantically based constructions of probability logic are presented. (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)

Well over a century after its introduction, Frege's two-dimensional Begriffsschrift notation is still considered mainly a curiosity that stands out more for its clumsiness than anything else. This paper focuses mainly on the propositional fragment of the Begriffsschrift, because it embodies the characteristic features that distinguish it from other expressively equivalent notations. In the first part, I argue for the perspicuity and readability of the Begriffsschrift by discussing several idiosyncrasies of the notation, which allow an easy conversion of logically equivalent (...) formulas, and presenting the notation's close connection to syntax trees. In the second part, Frege's considerations regarding the design principles underlying the Begriffsschrift are presented. Frege was quite explicit about these in his replies to early criticisms and unfavorable comparisons with Boole's notation for propositional logic. This discussion reveals that the Begriffsschrift is in fact a well thought-out and carefully crafted notation that intentionally exploits the possibilities afforded by the two-dimensional medium of writing like none other. (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)

Ravit Dotan argues that a No Free Lunch theorem from machine learning shows epistemic values are insufficient for deciding the truth of scientific hypotheses. She argues that NFL shows that the best case accuracy of scientific hypotheses is no more than chance. Since accuracy underpins every epistemic value, non-epistemic values are needed to assess the truth of scientific hypotheses. However, NFL cannot be coherently applied to the problem of theory choice. The NFL theorem Dotan’s argument relies upon is a member (...) of a family of theorems in search, optimization, and machine learning. They all claim to show that if no assumptions are made about a search or optimization problem or learning situation, then the best case performance of an algorithm is that of random search or random guessing. A closer inspection shows that these theorems all rely upon assigning uniform probabilities over problems or learning situations, which is just the Principle of Indifference. A counterexample can be crafted that shows that NFL cannot be coherently applied across different descriptions of the same learning situation. To avoid this counterexample, Dotan needs to privilege some description of the learning situation faced by scientists. However, this means that NFL cannot be applied since an important assumption about the problem is being made. So Dotan faces a dilemma: either NFL leads to incoherent best-case partial beliefs or it is inapplicable to the problem of theory choice. This negative result has implications for the larger debate over theory choice. (shrink)

Archaeology is currently bound to a series of metaphysical principles, one of which claims that reality is composed of a series of discrete objects. These discrete objects are fundamental metaphysical entities in archaeological science and posthumanist/new Materialist approaches and can be posited, assembled, counted, and consequently included in quantitative models (e.g. Big Data, Bayesian models) or network models (e.g. Actor-Network Theory). The work by Sørensen and Marila shows that archaeological reality is not that discrete, that some objects cannot be easily (...) identified, and that perhaps reality is not always necessarily composed of discrete objects. The aim of this article is to take Sørensen and Marila’s arguments to their ultimate logical consequences: most archaeological theory today operates under the illusion of a general metaphysics. This illusion dictates not only that all of reality is composed of discrete objects, but that since reality manifests in a certain way, there has to be a methodology that accurately represents that reality. A brief discussion on the notion of “conjecture,” as conceived in certain historical theories, is also presented. (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)

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

Each of our theories of mental representation provides some insight into how the mind works. However, these insights often seem incompatible, as the debates between symbolic, dynamical, emergentist, sub-symbolic, and grounded approaches to cognition attest. Mental representations—whatever they are—must share many features with each of our theories of representation, and yet there are few hypotheses about how a synthesis could be possible. Here, I develop a theory of the underpinnings of symbolic cognition that shows how sub-symbolic dynamics may give rise (...) to higher-level cognitive representations of structures, systems of knowledge, and algorithmic processes. This theory implements a version of conceptual role semantics by positing an internal universal representation language in which learners may create mental models to capture dynamics they observe in the world. The theory formalizes one account of how truly novel conceptual content may arise, allowing us to explain how even elementary logical and computational operations may be learned from a more primitive basis. I provide an implementation that learns to represent a variety of structures, including logic, number, kinship trees, regular languages, context-free languages, domains of theories like magnetism, dominance hierarchies, list structures, quantification, and computational primitives like repetition, reversal, and recursion. This account is based on simple discrete dynamical processes that could be implemented in a variety of different physical or biological systems. In particular, I describe how the required dynamics can be directly implemented in a connectionist framework. The resulting theory provides an “assembly language” for cognition, where high-level theories of symbolic computation can be implemented in simple dynamics that themselves could be encoded in biologically plausible systems. (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.

Logic is usually presented as a tool of rational inquiry; however, many logicians in fact treat logic so that it does not serve us, but rather governs us – as rational beings we are subordinated to the logical laws we aspire to disclose. We denote the view that logic primarily serves us as logica serviens, while denoting the thesis that it primarily governs our reasoning as logica dominans. We argue that treating logic as logica dominans is misguided, for it leads (...) to the idea of a “genuine” logic within a “genuine” language. Instead of this, we offer a naturalistic picture, according to which the only languages that exist are the natural languages and the artificial languages logicians have built. There is, we argue, no language beyond these, especially none that would be a wholesome vehicle of reasoning like the natural languages and yet be transparently rigorous like the artificial ones. Logic is a matter of using the artificial languages as idealized models of the natural ones, whereby we pinpoint the laws of logic by means of zooming in on a reflective equilibrium. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...) models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (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)

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

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

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)

In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begrijfsschrift, is like the language Leibniz sketched, a lingua characteristica, and not merely a logical calculus. According to the nineteenth century studies, Leibniz's lingua characteristica was supposed to be a language with which the truths of science and the constitution of its concepts could be accurately expressed. I argue that this is exactly what the Begriffsschrift is: it is (...) a language, since, unlike calculi, its sentential expressions express truths, and it is a characteristic language, since the meaning of its complex expressions depend only on the meanings of their constituents and on the way they are put together. In fact it is in itself already a science composed in accordance with the Classical Model of Science. What makes the Begrijfsschrift so special is that Frege is able to accomplish these goals with using only grammatical or syncategorematic terms and so has a medium with which he can try to show analyticity of the theorems of arithmetic. (shrink)

In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua characteristica, and not merely a logical calculus. According to the nineteenth century studies, Leibniz’s lingua characteristica was supposed to be a language with which the truths of science and the constitution of its concepts could be accurately expressed. I argue that this is exactly what the Begriffsschrift is: it is (...) a language, since, unlike calculi, its sentential expressions express truths, and it is a characteristic language, since the meaning of its complex expressions depend only on the meanings of their constituents and on the way they are put together. In fact it is in itself already a science composed in accordance with the Classical Model of Science. What makes the Begriffsschrift so special is that Frege is able to accomplish these goals with using only grammatical or syncategorematic terms and so has a medium with which he can try to show analyticity of the theorems of arithmetic. (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)

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)

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)

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)

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)