Logic and Information

An important problem with machine learning is that when label number n>2, it is very difficult to construct and optimize a group of learning functions, and we wish that optimized learning functions are still useful when prior distribution P(x) (where x is an instance) is changed. To resolve this problem, the semantic information G theory, Logical Bayesian Inference (LBI), and a group of Channel Matching (CM) algorithms together form a systematic solution. MultilabelMultilabel A semantic channel in the G theory consists (...) of a group of truth functions or membership functions. In comparison with likelihood functions, Bayesian posteriors, and Logistic functions used by popular methods, membership functions can be more conveniently used as learning functions without the above problem. In Logical Bayesian Inference (LBI), every label’s learning is independent. For Multilabel learning, we can directly obtain a group of optimized membership functions from a big enough sample with labels, without preparing different samples for different labels. A group of Channel Matching (CM) algorithms are developed for machine learning. For the Maximum Mutual Information (MMI) classification of three classes with Gaussian distributions on a two-dimensional feature space, 2-3 iterations can make mutual information between three classes and three labels surpass 99% of the MMI for most initial partitions. For mixture models, the Expectation-Maxmization (EM) algorithm is improved and becomes the CM-EM algorithm, which can outperform the EM algorithm when mixture ratios are imbalanced, or local convergence exists. The CM iteration algorithm needs to combine neural networks for MMI classifications on high-dimensional feature spaces. LBI needs further studies for the unification of statistics and logic. (shrink)

Logical information theory is the quantitative version of the logic of partitions just as logical probability theory is the quantitative version of the dual Boolean logic of subsets. The resulting notion of information is about distinctions, differences and distinguishability and is formalized using the distinctions of a partition. All the definitions of simple, joint, conditional and mutual entropy of Shannon information theory are derived by a uniform transformation from the corresponding definitions at the logical level. The purpose of this paper (...) is to give the direct generalization to quantum logical information theory that similarly focuses on the pairs of eigenstates distinguished by an observable, i.e., qudits of an observable. The fundamental theorem for quantum logical entropy and measurement establishes a direct quantitative connection between the increase in quantum logical entropy due to a projective measurement and the eigenstates that are distinguished by the measurement. Both the classical and quantum versions of logical entropy have simple interpretations as “two-draw” probabilities for distinctions. The conclusion is that quantum logical entropy is the simple and natural notion of information for quantum information theory focusing on the distinguishing of quantum states. (shrink)

We introduce a family of operators to combine Description Logic concepts. They aim to characterise complex concepts that apply to instances that satisfy \enough" of the concept descriptions given. For instance, an individual might not have any tusks, but still be considered an elephant. To formalise the meaning of "enough", the operators take a list of weighted concepts as arguments, and a certain threshold to be met. We commence a study of the formal properties of these operators, and study some (...) variations. The intended applications concern the representation of cognitive aspects of classi cation tasks: the interdependencies among the attributes that de ne a concept, the prototype of a concept, and the typicality of the instances. (shrink)

We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social choice theory and judgment aggregation show. The proposed logics for modelling collective attitudes are based on a substructural propositional logic that allows for circumventing inconsistent outcomes. Individual and collective propositional attitudes, such as beliefs, desires, obligations, are then modelled by means of minimal modalities (...) to ensure a number of basic principles. In this way, a viable consistent modelling of collective attitudes is obtained. (shrink)

After a number of decades of research into the dynamics of rational belief, the belief revision theory community remains split on the appropriate handling of sequences of changes in view, the issue of so-called iterated revision. It has long been suggested that the matter is at least partly settled by facts pertaining to the results of various single revisions of one’s initial state of belief. Recent work has pushed this thesis further, offering various strong principles that ultimately result in a (...) wholesale reduction of iterated to one-shot revision. The present paper offers grounds to hold that these principles should be significantly weakened and that the reductionist thesis should ultimately be rejected. Furthermore, the considerations provided suggest a close connection between the logic of iterated belief change and the logic of evidential relevance. (shrink)

Background: Systematized Nomenclature of Medicine—Clinical Terms (SNOMED CT, hereafter abbreviated SCT) is acomprehensive medical terminology used for standardizing the storage, retrieval, and exchange of electronic healthdata. Some efforts have been made to capture the contents of SCT as Web Ontology Language (OWL), but theseefforts have been hampered by the size and complexity of SCT. Method: Our proposal here is to develop an upper-level ontology and to use it as the basis for defining the termsin SCT in a way that will (...) support quality assurance of SCT, for example, by allowing consistency checks ofdefinitions and the identification and elimination of redundancies in the SCT vocabulary. Our proposed upper-levelSCT ontology (SCTO) is based on the Ontology for General Medical Science (OGMS). Results: The SCTO is implemented in OWL 2, to support automatic inference and consistency checking. Theapproach will allow integration of SCT data with data annotated using Open Biomedical Ontologies (OBO) Foundryontologies, since the use of OGMS will ensure consistency with the Basic Formal Ontology, which is the top-levelontology of the OBO Foundry. Currently, the SCTO contains 304 classes, 28 properties, 2400 axioms, and 1555annotations. It is publicly available through the bioportal athttp://bioportal.bioontology.org/ontologies/SCTO/. Conclusion: The resulting ontology can enhance the semantics of clinical decision support systems and semanticinteroperability among distributed electronic health records. In addition, the populated ontology can be used forthe automation of mobile health applications. (shrink)

We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the (...) problem of the safety of the agenda). We provide results both for specific aggregation procedures (the quota rules, the premisebased procedure, and a distance-based procedure) and for classes of aggregation procedures characterised in terms of fundamental axioms. (shrink)

We present a formal semantics for epistemic logic, capturing the notion of knowability relative to information (KRI). Like Dretske, we move from the platitude that what an agent can know depends on her (empirical) information. We treat operators of the form K_AB (‘B is knowable on the basis of information A’) as variably strict quantifiers over worlds with a topic- or aboutness- preservation constraint. Variable strictness models the non-monotonicity of knowledge acquisition while allowing knowledge to be intrinsically stable. Aboutness-preservation models (...) the topic-sensitivity of information, allowing us to invalidate controversial forms of epistemic closure while validating less controversial ones. Thus, unlike the standard modal framework for epistemic logic, KRI accommodates plausible approaches to the Kripke-Harman dogmatism paradox, which bear on non-monotonicity, or on topic-sensitivity. KRI also strikes a better balance between agent idealization and a non-trivial logic of knowledge ascriptions. (shrink)

In this paper, we investigate a method for constructing cascades of information co-occurrence, which is suitable to trace emergent structures in information in scenarios where rich contextual features are unavailable. Our method relies only on the temporal order of content-sharing activities, and intrinsic properties of the shared content itself. We apply this method to analyse information dissemination patterns across the active online citizen science project Planet Hunters, a part of the Zooniverse platform. Our results lend insight into both structural and (...) informational properties of different types of identifiers that can be used and combined to construct cascades. In particular, significant differences are found in the structural properties of information cascades when hashtags as used as cascade identifiers, compared with other content features. We also explain apparent local information losses in cascades in terms of information obsolescence and cascade divergence; e.g., when a cascade branches into multiple, divergent cascades with combined capacity equal to the original. (shrink)

This paper is an attempt to lay out foundations for a general theory of coincidence in information spaces such as the World Wide Web, expanding on existing work on bursty structures in document streams and information cascades. We elaborate on the hypothesis that every resource that is published in an information space, enters a temporary interaction with another resource once a unique explicit or implicit reference between the two is found. This thought is motivated by Erwin Shroedingers notion of entanglement (...) between quantum systems. We present a generic information cascade model that exploits only the temporal order of information sharing activities, combined with inherent properties of the shared information resources. The approach was applied to data from the world's largest online citizen science platform Zooniverse and we report about findings of this case study. (shrink)

This is the first of a two-volume work combining two fundamental components of contemporary computing into classical deductive computing, a powerful form of computation, highly adequate for programming and automated theorem proving, which, in turn, have fundamental applications in areas of high complexity and/or high security such as mathematical proof, software specification and verification, and expert systems. Deductive computation is concerned with truth-preservation: This is the essence of the satisfiability problem, or SAT, the central computational problem in computability and complexity (...) theory. The Turing machine provides the classical version of this theory—classical computing—with its standard model, which is physically concretized—and thus spatial-temporally limited and restricted—in the von Neumann, or digital, computer. Although a number of new technological applications require classical deductive computation with non-classical logics, many key technologies still do well—or exclusively, for that matter—with classical logic. In this first volume, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing and classical deduction with the classical first-order predicate calculus with a view to computational implementations. As a complement to the mathematical-based exposition of the topics we offer the reader a very large selection of exercises. This selection aims at not only practice of discussed material, but also creative approaches to problems, for both discussed and novel contents, as well as at research into further relevant topics. (shrink)

Review of "Exploring Randomness" (200) and "The Unknowable" (1999) by Gregory Chaitin.

We are in the information age. Nowadays, the information is a high power commodity. Your domain and handling have high economic, political, social value. However, we still know little about it. What is the information? How do we store it, retrieve it and manipulate it? Everyone have or should have equal access to information? What is the relationship between information and knowledge? How can both influence and be influenced by the action? Can they are modeled? The models can contribute to (...) your understanding? Information and knowledge can consolidate or destroy friendships? What are the most efficient means to produce, store, organize and retrieve knowledge and information? Such questions permeate the content of this book, bringing together Brazilian and foreign authors, seeking to contribute to the improvement of the understanding of each of the concepts involved and the relationships between them. This work is the result of EIICA IX, International Meeting information, knowledge and action, held between December, 2nd and 4th 2015, at the Faculty of Philosophy and Science of UNESP/ Marília. (shrink)

In this work, we propose a definition of logical consequence based on the relation between the quantity of information present in a particular set of formulae and a particular formula. As a starting point, we use Shannon‟s quantitative notion of information, founded on the concepts of logarithmic function and probability value. We first consider some of the basic elements of an axiomatic probability theory, and then construct a probabilistic semantics for languages of classical propositional logic. We define the quantity of (...) information for the formulae of these languages and introduce the concept of informational logical consequence, identifying some important results, among them: certain arguments that have traditionally been considered valid, such as modus ponens, are not valid from the informational perspective; the logic underlying informational logical consequence is not classical, and is at the least paraconsistent sensu lato; informational logical consequence is not a Tarskian logical consequence. (shrink)

This special issue of the Logic Journal of the IGPL includes revised and updated versions of the best work presented at the fourth edition of the workshop Formal Ap- proaches to Multi-Agent Systems, FAMAS'09, which took place in Turin, Italy, from 7 to 11 September, 2009, under the umbrella of the Multi-Agent Logics, Languages, and Organisations Federated Workshops (MALLOW). -/- Just like its predecessor, research reported in this FAMAS 2009 special issue is very much inspired by practical concerns. This time (...) the authors of all the five selected papers are concerned with knowledge and beliefs in multi-agent settings: How to create a group belief in a fair way from individual plausibility orderings? How to close gaps and resolve ambiguities in a tractable way, when information comes from multiple sources? How to reason about a spatial environment? How to compare the strengths of an agent's beliefs in a principled way? How to decide as efficiently as possible whether a given formula concerning group beliefs is valid? These questions and their answers lead to a multi-faceted and at the same time coherent special issue. We concisely introduce the five articles. (shrink)

Over the last decade, multi-agent systems have come to form one of the key tech- nologies for software development. The Formal Approaches to Multi-Agent Systems (FAMAS) workshop series brings together researchers from the fields of logic, theoreti- cal computer science and multi-agent systems in order to discuss formal techniques for specifying and verifying multi-agent systems. FAMAS addresses the issues of logics for multi-agent systems, formal methods for verification, for example model check- ing, and formal approaches to cooperation, multi-agent planning, communication, (...) coordination, negotiation, games, and reasoning under uncertainty in a distributed environment. In 2007, the third FAMAS workshop, FAMAS'007, was one of the agent workshops gathered together under the umbrella of Multi-Agent Logics, Languages, and Organ- isations - Federated Workshops, MALLOW'007, taking place from 3 to 7 September 2007 in Durham. This current special issue of the Logic Journal of the IGPL gathers together the revised and updated versions of the five best FAMAS'007 contributions. (shrink)

An introductory logic textbook where the central concept is not deduction but search and logical form. (Deduction - logical consequence - drops out as a special case. TIt is meant for a class-based rather than a lecture-based course, and for students with general interests.

Nearly a decade has past since Grove gave a semantics for the AGM postulates. The semantics, called sphere semantics, provided a new perspective of the area of study, and has been widely used in the context of theory or belief change. However, the soundness proof that Grove gives in his paper contains an error. In this note, we will point this out and give two ways of repairing it.

We argue that a command and control system can undermine a commander’s moral agency if it causes him/her to process information in a purely syntactic manner, or if it precludes him/her from ascertaining the truth of that information. Our case is based on the resemblance between a commander’s circumstances and the protagonist in Searle’s Chinese Room, together with a careful reading of Aristotle’s notions of ‘compulsory’ and ‘ignorance’. We further substantiate our case by considering the Vincennes Incident, when the crew (...) of a warship mistakenly shot down a civilian airliner. To support a combat commander’s moral agency, designers should strive for systems that help commanders and command teams to think and manipulate information at the level of meaning. ‘Down conversions’ of information from meaning to symbols must be adequately recovered by ‘up conversions’, and commanders must be able to check that their sensors are working and are being used correctly. Meanwhile ethicists should establish a mechanism that tracks the potential moral implications of choices in a system’s design and intended operation. Finally we highlight a gap in normative ethics, in that we have ways to deny moral agency, but not to affirm it. (shrink)

Our commonsense notion of reality is supported by two critical assumptions for which we have little understanding: The conscious experience which underpins the observations integral to the scientific method and language, which is the method by which all theories, scientific or otherwise, are communicated. This book examines both of these matters in detail and arrives at a new theoretical foundation for understanding how nature undertakes the task of building the universe. -/- Creating Reality is a synthesis of Darwin’s The Origin (...) of Species and Douglas Hofstadter’s Gödel, Escher, Bach (GEB). It is an intellectual journey that addresses the most profound questions facing science and philosophy today and delivers the greatest transformation in the way we view the world since Darwin’s masterpiece. The book is targeted at anyone up for the cerebral challenge of thinking deeply about how we make sense of the world and our existence. The book is thoroughly researched and referenced, drawing from the most highly credential sources. -/- When we take stock of where we are in our understanding of nature, it seems that three important questions stand out for which we have few answers. More than just questions, they represent gaps in our comprehension of what makes the universe tick. These are the thematic focal points of this book: -/- • What is the nature of belief? (An examination of truth as a function of language). • What is consciousness? • What is the relationship between mathematics and the physical world? -/- The exploration of these three questions unravels the mystery behind the principal means by which we come to have knowledge of the world. So our journey begins by asking the more generic question: How do we come to know the world? The book makes no assumptions about this thing called ‘reality’ and takes a fresh look at the presuppositions underlying commonsense notions of reality. (shrink)

►JOHN CORCORAN AND IDRIS SAMAWI HAMID, Two-method errors: having it both ways. Philosophy, University at Buffalo, Buffalo, NY 14260-4150, USA E-mail: corcoran@buffalo.edu Philosophy, Colorado State University, Fort Collins, CO 80523-1781 USA E-mail: ishamid@colostate.edu Where two methods produce similar results, mixing the two sometimes creates errors we call two-method errors, TMEs: in style, syntax, semantics, pragmatics, implicature, logic, or action. This lecture analyzes examples found in technical and in non-technical contexts. One can say “Abe knows whether Ben draws” in two other (...) ways: ‘Abe knows whether or not Ben draws’ or ‘Abe knows whether Ben draws or not’. But a stylistic TME occurs in ‘Abe knows whether or not Ben draws or not’. One can say “Abe knows how Ben looks” using ‘Abe knows what Ben looks like’. But syntactical TMEs are in ‘Abe knows what Ben looks’ and in ‘Abe knows how Ben looks like’. One can deny that Abe knows Ben by prefixing ‘It isn’t that’ or by interpolating ‘doesn’t’. But a pragmatic TME occurs in trying to deny that Abe knows Ben by using ‘It isn’t that Abe doesn’t know Ben’. There are several standard ways of defining truth using sequences. Quine’s discussions in the 1970 first printing of Philosophy of logic [3] and in previous lectures were vitiated by mixing two [1, p. 98]. The logical TME in [3], which eluded Quine’s colleagues, was corrected in the 1978 sixth printing [2]. But Quine never explicitly acknowledged, described, or even mentioned the error. This lecture presents and analyses two-method errors in the logic literature. [1] JOHN CORCORAN, Review of Quine’s 1970 Philosophy of Logic. In Philosophy of Science, vol. 39 (1972), pp. 97–99. [2] JOHN CORCORAN, Review of sixth printing of Quine’s 1970 Philosophy of Logic. In Mathematical Reviews MR0469684 (1979): 57 #9465. [3] WILLARD VAN ORMAN QUINE, Philosophy of logic, Harvard, 1970/1986. (shrink)

1994.Επιστημολογία της Λογικής. Συγγραφέας Επαμεινώνδας Ξενόπουλος Μοναδική μελέτη και προσέγγιση της θεωρίας της γνώσης, για την παγκόσμια βιβλιογραφία, της διαλεκτικής πορείας της σκέψης από την λογική πλευρά της και της μελλοντικής μορφής που θα πάρουν οι διαλεκτικές δομές της, στην αδιαίρετη ενότητα γνωσιοθεωρίας, λογικής και διαλεκτικής, με την «μέθοδο του διαλεκτικού υλισμού». Έργο βαρύ με θέμα εξαιρετικά δύσκολο διακατέχεται από πρωτοτυπία και ζωντάνια που γοητεύει τον κάθε ανήσυχο στοχαστή από τις πρώτες γραμμές.

Juries, committees and experts panels commonly appraise things of one kind or another on the basis of grades awarded by several people. When everybody's grading thresholds are known to be the same, the results sometimes can be counted on to reflect the graders’ opinion. Otherwise, they often cannot. Under certain conditions, Arrow's ‘impossibility’ theorem entails that judgements reached by aggregating grades do not reliably track any collective sense of better and worse at all. These claims are made by adapting the (...) Arrow–Sen framework for social choice to study grading in groups. (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)

A generalized information theory is proposed as a natural extension of Shannon's information theory. It proposes that information comes from forecasts. The more precise and the more unexpected a forecast is, the more information it conveys. If subjective forecast always conforms with objective facts then the generalized information measure will be equivalent to Shannon's information measure. The generalized communication model is consistent with K. R. Popper's model of knowledge evolution. The mathematical foundations of the new information theory, the generalized communication (...) model , information measures for semantic information and sensory information, and the coding meanings of generalized entropy and generalized mutual information are introduced. Assessments and optimizations of pattern recognition, predictions, and detection with the generalized information criterion are discussed. For economization of communication, a revised version of rate-distortion theory: rate-of-keeping-precision theory, which is a theory for datum compression and also a theory for matching an objective channels with the subjective understanding of information receivers, is proposed. Applications include stock market forecasting and video image presentation. (shrink)

Semantic Information conveyed by daily language has been researched for many years; yet, we still need a practical formula to measure information of a simple sentence or prediction, such as “There will be heavy rain tomorrow”. For practical purpose, this paper introduces a new formula, Semantic Information Formula (SIF), which is based on L. A. Zadeh’s fuzzy set theory and P. Z. Wang’s random set falling shadow theory. It carries forward C. E. Shannon and K. Popper’s thought. The fuzzy set’s (...) probability defined by Zadeh is treated as the logical probability sought by Popper, and the membership grade is treated as the truth-value of a proposition and also as the posterior logical probability. The classical relative information formula (Information=log(Posterior probability / Prior probability) is revised into SIF by replacing the posterior probability with the membership grade and the prior probability with the fuzzy set’s probability. The SIF can be explained as “Information=Testing severity – Relative square deviation” and hence can be used as Popper's information criterion to test scientific theories or propositions. The information measure defined by the SIF also means the spared codeword length as the classical information measure. This paper introduces the set-Bayes’ formula which establishes the relationship between statistical probability and logical probability, derives Fuzzy Information Criterion (FIC) for the optimization of semantic channel, and discusses applications of SIF and FIC in areas such as linguistic communication, prediction, estimation, test, GPS, translation, and fuzzy reasoning. Particularly, through a detailed example of reasoning, it is proved that we can improve semantic channel with proper fuzziness to increase average semantic information to reach its upper limit: Shannon mutual information. (shrink)

Our online interaction with information-systems may well provide the largest arena of formal logical reasoning in the world today. Presented here is a critique of the foundations of Logic, in which the metaphysical assumptions of such 'closed world' reasoning are contrasted with those of traditional logic. Closed worlds mostly employ a syntactic alternative to formal language namely, recording data in files. Whilst this may be unfamiliar as logical syntax, it is argued here that propositions are expressed by data stored in (...) files which are essentially non-linguistic and so cannot be expressed by simple formulae F(a), with the inference-rules normally used in Logic. Hence, the syntax of data may be said to define a fundamentally new kind of logical form for simple propositions. In this way, the logic of closed systems is shown to be non-classical, differing from traditional logic in its truth-conditions, inferences and metaphysics. This paper will be concerned mainly with how the reference and certain inferences in such a closed system differ metaphysically from classical logic. (shrink)

This paper defines the form of prior knowledge that is required for sound inferences by analogy and single-instance generalizations, in both logical and probabilistic reasoning. In the logical case, the first order determination rule defined in Davies (1985) is shown to solve both the justification and non-redundancy problems for analogical inference. The statistical analogue of determination that is put forward is termed 'uniformity'. Based on the semantics of determination and uniformity, a third notion of "relevance" is defined, both logically and (...) probabilistically. The statistical relevance of one function in determining another is put forward as a way of defining the value of information: The statistical relevance of a function F to a function G is the absolute value of the change in one's information about the value of G afforded by specifying the value of F. This theory provides normative justifications for conclusions projected by analogy from one case to another, and for generalization from an instance to a rule. The soundness of such conclusions, in either the logical or the probabilistic case, can be identified with the extent to which the corresponding criteria (determination and uniformity) actually hold for the features being related. (shrink)

2006. George Boole. Encyclopedia of Philosophy. 2nd edition. Detroit: Macmillan Reference USA. -/- George Boole (1815-1864), whose name lives among modern computer-related sciences in Boolean Algebra, Boolean Logic, Boolean Operations, and the like, is one of the most celebrated logicians of all time. Ironically, his actual writings often go unread and his actual contributions to logic are virtually unknown—despite the fact that he was one of the clearest writers in the field. Working with various students including Susan Wood and Sriram (...) Nambiar, I have written several publications trying to set the record straight—but so far to little avail. This encyclopedia entry is one more attempt to set the record straight in a way that can be appreciated by non-experts.Also see https://www.academia.edu/10161999/Booles_criteria_of_validity_and_invalidity . (shrink)

This review places this translation and commentary on Book A of Prior Analytics in historical, logical, and philosophical perspective. In particular, it details the author’s positions on current controversies. The author of this translation and commentary is a prolific and respected scholar, a leading figure in a large and still rapidly growing area of scholarship: Prior Analytics studies PAS. PAS treats many aspects of Aristotle’s Prior Analytics: historical context, previous writings that influenced it, preservation and transmission of its manuscripts, editions (...) of its manuscripts, interpretations, commentaries, translations, and its influence on subsequent logic, philosophy, and mathematics. All this attention is warranted because Prior Analytics marks the origin of logic: the field that, among other things, asks of a given proposition whether it follows from a given set of propositions; and, if it follows, how we determine that it follows; and, if it does not follow, how we determine that it does not follow. This translation and commentary is not suitable for use in an undergraduate course. It has too many quirks that the teacher would want to warn against. A copy editor should have dealt with these things and with other matters such as incorrect punctuation and improper end-of-line divisions. The prose is heavily laden with glaring clichés. The one-page preface contains “longer than I care to remember”, “more than I can possibly list here”, “first and foremost”, and “last and by no means least”—a sentence later is devoted to thanking the “incredibly meticulous and helpful copy-editor”. A few pages later the translator reveals the need “to find a path between the Scylla … and the Charybdis …”. Moreover, the index is far from meeting the needs of undergraduate students. The attention to scholarly detail is not what one hoped for from Oxford University Press. At 26b10-15, this translation reads “let swan and white be chosen as white things” for what Smith correctly translates “let swan and snow be selected from among those white things”. At 41b16, “angles AB and CD” should read “angles AC and BD”. Despite this book’s flaws, it will be found useful if not indispensable for those currently engaged in Prior Analytics studies. The alternatives suggested to Robin Smith’s translation choices are often worth consideration. It is to be emphasized, however, that this book is unsuitable for those entering Prior Analytics studies. (shrink)

The logical form of a discourse—such as a proposition, a set of propositions, an argument, or an argumentation—is obtained by abstracting from the subject-matter of its content terms or by regarding the content terms as mere place-holders or blanks in a form. In a logically perfect language the logical form of a proposition, a set of propositions, an argument, or an argumentation is determined by the grammatical form of the sentence, the set of sentences, the argument-text, or the argumentation-text expressing (...) it. Two such discourse-texts are said to have the same grammatical form, in this sense, if a uniform one-one substitution of content words transforms the one exactly into the other. The sentence ‘Abe properly respects every agent who respects himself’ may be regarded as having the same grammatical form as the sentence ‘Ben generously assists every patient who assists himself’. (shrink)

I am saying farewell after more than forty happy years of teaching logic at the University of Buffalo. But this is only a partial farewell. I will no longer be at UB to teach classroom courses or seminars. But nothing else will change. I will continue to be available for independent study. I will continue to write abstracts and articles with people who have taken courses or seminars with me. And I will continue to honor the LogicLifetimeGuarantee™, which is earned (...) by taking one of my logic courses or seminars. As you know, according to the terms of the LogicLifetimeGuarantee™, I stand behind everything I teach. If you find anything to be unsatisfactory, I am committed to fixing it. If you forget anything, I will remind you. If you have questions, I will answer them or ask more questions. And if you need more detail on any topic we discussed, I will help you to broaden and deepen your knowledge—and maybe write an abstract or article. Stay in touch. (shrink)

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

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)

World semantics for relevant logics include so-called non-normal or impossible worlds providing model-theoretic counterexamples to such irrelevant entailments as (A ∧ ¬A) → B, A → (B∨¬B), or A → (B → B). Some well-known views interpret non-normal worlds as information states. If so, they can plausibly model our ability of conceiving or representing logical impossibilities. The phenomenon is explored by combining a formal setting with philosophical discussion. I take Priest’s basic relevant logic N4 and extend it, on the syntactic (...) side, with a representation operator, (R), and on the semantic side, with particularly anarchic non-normal worlds. This combination easily invalidates unwelcome “logical omniscience” in- ferences of standard epistemic logic, such as belief-consistency and closure under entailment. Some open questions are then raised on the best strategies to regiment (R) in order to express more vertebrate kinds of conceivability. (shrink)

Concept representation is still an open problem in the field of ontology engineering and, more generally, of knowledge representation. In particular, the issue of representing “non classical” concepts, i.e. concepts that cannot be defined in terms of necessary and sufficient conditions, remains unresolved. In this paper we review empirical evidence from cognitive psychology, according to which concept representation is not a unitary phenomenon. On this basis, we sketch some proposals for concept representation, taking into account suggestions from psychological research. In (...) particular, it seems that human beings employ both prototype-based and exemplar-based representations in order to represent non classical concepts. We suggest that a similar, hybrid prototype-exemplar based approach could also prove useful in the field of knowledge representation technology. Finally, we propose conceptual spaces as a suitable framework for developing some aspects of this proposal. (shrink)

Is logic empirical? Is logic to be found in the world? Or is logic rather a convention, a product of conventions, part of the many rules that regulate the language game? Answers fall in either camp. We like the linguistic answer. In this paper, we want to analyze how a linguistic community would tackle the problem of developing a logic and show how the linguistic conventions adopted by the community determine the properties of the local logic. Then show how to (...) move from a notion of logic that varies from community to community to a notion of logic that is in a sense universal. The framework is conventional up to a point: we have sentences, atomic and composite, the connectives are interpreted, values are computed, and the value of a composite sentence is a function of the values of its subsentences. Less conventional is the use of a plurality of truth values, and the sharp distinction we draw between sentences and statements, in the spirit of the distinction between proposition and judgment that one may find in proof theory. The linguistic community will face many choices. What are the good ones, the ones to avoid? Are there, in some sense, optimal choices? These are the kind of issues we are addressing. Where do we end up? With some kind of universal bivalent logic, ironically enough. We start from an arbitrarily large number of truth values, atomic sentences and connectives, construct a generic many-valued logic, recover more or less the usual results and issues, and in the end it all comes down to a positive bivalent logic with two connectives, `and' and `or', as if logic is nothing more than a mere accounting of possibilities. (shrink)

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