In the present version of these lecture notes only a number of typos and a few glaring mistakes have been corrected. Thanks to Paul Dekker for his help in this respect. No attempt has been been made to update the original text or to incorporate new insights and approaches. For a more recent overview, see our ‘Questions’ in the Handbook of Logic and Language (edited by Johan van Benthem and Alice ter Meulen, Elsevier, 1997).

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)

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositional” logic is thus seen as (...) the logic of subsets of a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic. (shrink)

The theory of granular partitions is designed to capture in a formal framework important aspects of the selective character of common-sense views of reality. It comprehends not merely the ways in which we can view reality by conceiving its objects as gathered together not merely into sets, but also into wholes of various kinds, partitioned into parts at various levels of granularity. We here represent granular partitions as triples consisting of a rooted tree structure as first component, a domain satisfying (...) the axioms of Extensional Mereology as second component, and a mapping (called ’projection’) of the first into the second as a third component. We define ordering relations among granular partitions the resulting structures are called partition frames. We then introduce an axiomatic theory which sentences are interpreted in partition frames. (shrink)

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

The purpose of this paper is to show that the mathematics of quantum mechanics is the mathematics of set partitions linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite to more definite (...) states is the partition join operation at the set level that prefigures at the quantum level projective measurement as well as the formation of maximally-definite state descriptions by Dirac’s Complete Sets of Commuting Operators. This development is measured quantitatively by logical entropy at the set level and by quantum logical entropy at the quantum level. This follow-the-math approach supports the Literal Interpretation of QM—as advocated by Abner Shimony among others which sees a reality of objective indefiniteness that is quite different from the common sense and classical view of reality as being “definite all the way down”. (shrink)

The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method presented here to define any n-ary Boolean operation on partitions. An equivalent closure-theoretic method is also defined. In closing, the question is addressed of why it took so long for all Boolean operations to be defined for partitions.

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)

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

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)

The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood structures, are introduced in Sections (...) 3 and 4, respectively. It is recalled that Aumann's partitional model of CK is a particular case of a definition in terms of Kripke structures. The paper also restates the well-known fact that Kripke structures can be regarded as particular cases of neighbourhood structures. Section 3 reviews the soundness and completeness theorems proved w.r.t. the former structures by Fagin, Halpern, Moses and Vardi, as well as related results by Lismont. Section 4 reviews the corresponding theorems derived w.r.t. the latter structures by Lismont and Mongin. A general conclusion of the paper is that the axiomatization of CB does not require as strong systems of individual belief as was originally thought- only monotonicity has thusfar proved indispensable. Section 5 explains another consequence of general relevance: despite the "infinitary" nature of CB, the axiom systems of this paper admit of effective decision procedures, i.e., they are decidable in the logician's sense. (shrink)

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

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)

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)

Roman Suszko said that “Obviously, any multiplication of logical values is a mad idea and, in fact, Łukasiewicz did not actualize it.” The aim of the present paper is to qualify this ‘obvious’ statement through a number of logical and philosophical writings by Professor Jan Woleński, all focusing on the nature of truth-values and their multiple uses in philosophy. It results in a reconstruction of such an abstract object, doing justice to what Suszko held a ‘mad’ project within a generalized (...) logic of judgments. Four main issues raised by Woleński will be considered to test the insightfulness of such generalized truth-values, namely: the principle of bivalence, the logic of scepticism, the coherence theory of truth, and nothingness. (shrink)

Recent developments in pure mathematics and in mathematical logic have uncovered a fundamental duality between "existence" and "information." In logic, the duality is between the Boolean logic of subsets and the logic of quotient sets, equivalence relations, or partitions. The analogue to an element of a subset is the notion of a distinction of a partition, and that leads to a whole stream of dualities or analogies--including the development of new logical foundations for information theory (...) parallel to Boole's development of logical finite probability theory. After outlining these dual concepts in mathematical terms, we turn to a more metaphysical speculation about two dual notions of reality, a fully definite notion using Boolean logic and appropriate for classical physics, and the other objectively indefinite notion using partition logic which turns out to be appropriate for quantum mechanics. The existence-information duality is used to intuitively illustrate these two dual notions of reality. The elucidation of the objectively indefinite notion of reality leads to the "killer application" of the existence-information duality, namely the interpretation of quantum mechanics. (shrink)

The purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and functions. The analysis extends directly to other concrete categories (groups, rings, vector spaces, etc.) where the objects are sets with a certain type of structure and the morphisms are functions that preserve that structure. Then the elements & distinctions-based definitions can be (...) abstracted in purely arrow-theoretic way for abstract category theory. In short, the language of elements & distinctions is the conceptual language in which the category of sets is written, and abstract category theory gives the abstract arrows version of those definitions. (shrink)

Categorical logic has shown that modern logic is essentially the logic of subsets (or "subobjects"). Partitions are dual to subsets so there is a dual logic of partitions where a "distinction" [an ordered pair of distinct elements (u,u′) from the universe U ] is dual to an "element". An element being in a subset is analogous to a partition π on U making a distinction, i.e., if u and u′ were in different blocks of π. (...) Subset logic leads to finite probability theory by taking the (Laplacian) probability as the normalized size of each subset-event of a finite universe. The analogous step in the logic of partitions is to assign to a partition the number of distinctions made by a partition normalized by the total number of ordered pairs |U|² from the finite universe. That yields a notion of "logical entropy" for partitions and a "logical information theory." The logical theory directly counts the (normalized) number of distinctions in a partition while Shannon's theory gives the average number of binary partitions needed to make those same distinctions. Thus the logical theory is seen as providing a conceptual underpinning for Shannon's theory based on the logical notion of "distinctions.". (shrink)

Agents know some but not all logical consequences of what they know. Agents seem to be neither logically omniscient nor logically incompetent. Yet finding an intermediate standard of minimal rationality has proven difficult. In this paper, I take suggestions found in the literature (Lewis, 1988; Hawke, Özgün and Berto, 2020; Plebani and Spolaore, 2021) and join the forces of subject matter and impossible worlds approaches to devise a new solution to this quandary. I do so by combining a space of (...) FDE worlds (Berto and Jago, 2019) with a Lewisian (1988) understanding of subject matters as partitions. By doing so, I show how subject matters impose some order in the anarchic space of FDE worlds, while the worlds allow for distinctions between contents which would not otherwise be available. Combining the two approaches, then, brings us closer to the desired closure principles for knowledge of minimally rational agents. (shrink)

Continuing prior work by the author, a simple classical system for personal obligation is integrated with a fairly rich system for aretaic (agent-evaluative) appraisal. I then explore various relationships between definable aretaic statuses such as praiseworthiness and blameworthiness and deontic statuses such as obligatoriness and impermissibility. I focus on partitions of the normative statuses generated ("normative positions" but without explicit representation of agency). In addition to being able to model and explore fundamental questions in ethical theory about the connection between (...) blame, praise, permissibility and obligation, this allows me to carefully represent schemes for supererogation and kin. These controversial concepts have provided challenges to both ethical theory and deontic logic, and are among deontic logic's test cases. (shrink)

The aim of this paper is to make sense of the Keynes–Johnson octagon of oppositions. We will discuss Keynes' logical theory, and examine how his view is reflected on this octagon. Then we will show how this structure is to be handled by means of a semantics of partition, thus computing logical relations between matching formulas with a semantic method that combines model theory and Boolean algebra.

Agents know some but not all logical consequences of what they know. Agents seem to be neither logically omniscient nor logically incompetent. Yet finding an intermediate standard of minimal rationality has proven difficult. In this paper, I take suggestions found in the literature (Lewis, 1988; Hawke, Özgün and Berto, 2020; Plebani and Spolaore, 2021) and join the forces of subject matter and impossible worlds approaches to devise a new solution to this quandary. I do so by combining a space of (...) FDE worlds (Berto and Jago, 2019) with a Lewisian (1988) understanding of subject matters as partitions. By doing so, I show how subject matters impose some order in the anarchic space of FDE worlds, while the worlds allow for distinctions between contents which would not otherwise be available. Combining the two approaches, then, brings us closer to the desired closure principles for knowledge of minimally rational agents. (shrink)

Plato’s partition argument infers that the soul has parts from the fact that the soul experiences mental conflict. We consider an ambiguity in the concept of mental conflict. According to the first sense of conflict, a soul is in conflict when it has desires whose satisfaction is logically incompatible. According to the second sense of conflict, a soul is in conflict when it has desires which are logically incompatible even when they are unsatisfied. This raises a dilemma: if the (...) mental conflict is supposed to be the latter kind of conflict, then the partition argument is valid but is likely unsound; if it’s supposed to be the former kind, then the partition argument has true premises but is invalid. We explain this dilemma in detail and defend a dispositionalist solution to it. (shrink)

This paper describes a cubic water tank equipped with a movable partition receiving various amounts of liquid used to represent joint probability distributions. This device is applied to the investigation of deductive inferences under uncertainty. The analogy is exploited to determine by qualitative reasoning the limits in probability of the conclusion of twenty basic deductive arguments (such as Modus Ponens, And-introduction, Contraposition, etc.) often used as benchmark problems by the various theoretical approaches to reasoning under uncertainty. The probability bounds (...) imposed by the premises on the conclusion are derived on the basis of a few trivial principles such as "a part of the tank cannot contain more liquid than its capacity allows", or "if a part is empty, the other part contains all the liquid". This stems from the equivalence between the physical constraints imposed by the capacity of the tank and its subdivisions on the volumes of liquid, and the axioms and rules of probability. The device materializes de Finetti's coherence approach to probability. It also suggests a physical counterpart of Dutch book arguments to assess individuals' rationality in probability judgments in the sense that individuals whose degrees of belief in a conclusion are out of the bounds of coherence intervals would commit themselves to executing physically impossible tasks. (shrink)

Every domain-specific ontology must use as a framework some upper-level ontology which describes the most general, domain-independent categories of reality. In the present paper we sketch a new type of upper-level ontology, which is intended to be the basis of a knowledge modelling language GOL (for: 'General Ontological Language'). It turns out that the upper- level ontology underlying standard modelling languages such as KIF, F-Logic and CycL is restricted to the ontology of sets. Set theory has considerable mathematical power (...) and great flexibility as a framework for modelling different sorts of structures. At the same time it has the disadvantage that sets are abstract entities (entities existing outside the realm of time, space and causality), and thus a set-theoretical framework should be supplemented by some other machinery if it is to support applications in the ripe, messy world of concrete objects. In the present paper we partition the entities of the real world into sets and urelements, and then we introduce several new ontological relations between these urelements. In contrast to standard modelling and representation formalisms, the concepts of GOL provide a machinery for representing and analysing such ontologically basic relations. (shrink)

Models of collective deliberation often assume that the chief aim of a deliberative exchange is the sharing of information. In this paper, we argue that an equally important role of deliberation is to draw participants’ attention to pertinent questions, which can aid the assembly and processing of distributed information by drawing deliberators’ attention to new issues. The assumption of logical omniscience renders classical models of agents’ informational states unsuitable for modelling this role of deliberation. Building on recent insights from psychology, (...) linguistics and philosophy about the role of questions in speech and thought, we propose a different model in which beliefs are treated as answers directed at specific questions. Here, questions are formally represented as partitions of the space of possibilities and individuals’ information states as sets of questions and corresponding partial answers to them. The state of conversation is then characterised by individuals’ information together with the questions under discussion, which can be steered by various deliberative inputs. Using this model, deliberation is then shown to shape collective decisions in ways that classical models cannot capture, allowing for novel explanations of how group consensus is achieved. (shrink)

En el ámbito de la lógica matemática existe un problema sobre la relación lógica entre dos versiones débiles del Axioma de elección (AE) que no se ha podido resolver desde el año 2000 (aproximadamente). Tales versiones están relacionadas con ultrafiltros no principales y con Propiedades Ramsey (Bernstein, Polarizada, Subretículo, Ramsey, Ordinales flotantes, etc). La primera versión débil del AE es la siguiente (A): “Existen ultrafiltros no principales sobre el conjunto de los números naturales (ℕ)”. Y la segunda versión débil del (...) AE es la siguiente (B): “Existen ultraflitros sobre ℕ”. Se sabe que A implica B, pero se desconoce si B implica A. Di Prisco y Henle conjeturan en los artículos ([1], [2]) que esto no ocurre, es decir, conjeturan que B no implica A, en otras palabras, conjeturan que A es más fuerte estrictamente que B, que A es independiente de B, pero esto no se ha podido demostrar todavía aunque se ha intentado hacer desde hace aproximadamente 21 años. Una descripción detallada de este problema abierto puede encontrarse en esta ponencia (dictada en el marco del Día Mundial de la Lógica 14-01-2022) y en el artículo [3]. [1] C. Di Prisco y H. Henle. “Doughnuts, Floating Ordinals, Square Brackets, and Ultraflitters”. Journal of Symbolic Logic 65 (2000) 462-473. [2] C. Di Prisco y H. Henle. “Partitions of the reals and choice”. En “Models, algebras and proofs”. X. Caicedo y C.M. Montenegro. Eds. Lecture Notes in Pure and Appl. Math, 203, Marcel Dekker, 1999. [3] F. Galindo. “Tópicos de ultrafiltros”. Divulgaciones Matemáticas. Vol. 21, No 1-2, 2020. (shrink)

Hugh MacColl is commonly seen as a pioneer of modal and many-valued logic, given his introduction of modalities that go beyond plain truth and falsehood. But a closer examination shows that such a legacy is debatable and should take into account the way in which these modalities proceeded. We argue that, while MacColl devised a modal logic in the broad sense of the word, he did not give rise to a many-valued logic in the strict sense. Rather, (...) his logic is similar to a “non-Fregean logic”: an algebraic logic that partitions the semantic classes of truth and falsehood into subclasses but does not extend the range of truth-values. (shrink)

This paper deals with Gärdenfors’ theory of conceptual spaces. Let \({\mathcal {S}}\) be a conceptual space consisting of 2-type fuzzy sets equipped with several kinds of metrics. Let a finite set of prototypes \(\tilde{P}_1,\ldots,\tilde{P}_n\in \mathcal {S}\) be given. Our main result is the construction of a classification algorithm. That is, given an element \({\tilde{A}}\in \mathcal {S},\) our algorithm classifies it into the conceptual field determined by one of the given prototypes \(\tilde{P}_i.\) The construction of our algorithm uses some physical analogies (...) and the Newton potential plays a significant role here. Importantly, the resulting conceptual fields are not convex in the Euclidean sense, which we believe is a reasonable departure from the assumptions of Gardenfors’ original definition of the conceptual space. A partitioning algorithm of the space \(\mathcal {S}\) is also considered in the paper. In the application section, we test our classification algorithm on real data and obtain very satisfactory results. Moreover, the example we consider is another argument against requiring convexity of conceptual fields. (shrink)

This thesis examines the prospects for mechanical procedures that can identify true, complete, universal, first-order logical theories on the basis of a complete enumeration of true atomic sentences. A sense of identification is defined that is more general than those which are usually studied in the learning theoretic and inductive inference literature. Some identification algorithms based on confirmation relations familiar in the philosophy of science are presented. Each of these algorithms is shown to identify all purely universal theories without function (...) symbols. It is demonstrated that no procedure can solve this universal theory inference problem in the more usual senses of identification. The question of efficiency for theory inference systems is addressed, and some definitions of limiting complexity are examined. It is shown that several aspects of obvious strategies for solving the universal theory inference problem are NP-hard. Finally, some non-worst case heuristic search strategies are examined in light of these NP-completeness results. These strategies are based upon an isomorphism between clausal entailments of a certain class and partition lattices, and are applicable to the improvement of earlier work on language acquisition and logical inductive inference. (shrink)

A CONSTRUCTIVE CRITIQUE OF THE FOUNDATIONS OF PHILOSOPHY: Abstract of the Ph.D. Dissertation By Ramesh N. Patel June, 1970 -/- Philosophy pursues a rational explication of our understanding, experiences, and values in terms of objective truth and reality. Conspicuously, its view of rationality has been rigid and preconceived. Application of the preconceived reason in the explication of the essential features of our world fails and issues in a network of dialectical tangles. These artificially created tangles pose a unique intellectual challenge, (...) but the perennial failure to resolve them limits the intellectual response of philosophers to remaining caught in the tangles, or to taking intuitively favorable sides, or to simply denouncing the tangles as meaningless. Each is understandable. -/- Superficially, traditional philosophical reason looks like a correct tool for the explication of our world of common sense, but its applications to the world result in logical tangles showing its inadequacy. The philosopher’s faith in such reason ends up in one of two positions: abandoning our world in the interests of such reason, or embodying itself in the world through a special form of reason. Plato took the first and Aristotle took the second position. My analysis shows that Plato failed to explicate the relation between his world of Forms and our world of particulars, and, more importantly, between the Forms and the intuitive reason which grasps them. Aristotle, in my analysis, cannot conceal that the law of noncontradiction is a mere exhortation and has no descriptive necessity with respect to thought, things, or meaning. We also find such dialectical difficulties in Augustine, Hume and Strawson. -/- “Microphilosophical feasibilism” is our proposal for the best treatment, if not the definitive solution, of these problems. Instead of separating philosophical method into logic, epistemology, axiology, and metaphysics on the one side, and partitioning the projected results of philosophizing into validity, truth, valuation, and reality on the other, we need to start philosophizing with a general distinction between “method employed” and “intended result.” This distinction is not pre-colored by claims to ultimate verities. It is a direct aid to understanding. I consider the basic inevitable paradox that a philosopher should explain not only our understanding of experience but also his philosophizing itself. The circularity between “method employed” and “intended result” needs to be admitted as an initial fact about reason rather than circumvented by an implausibly claimed capacity of philosophical reason to formally transcend everything including this circularity. -/- Presuppositions are reduced to a minimum inevitable number. Being our primary microphilosophical criteria, they are reason, experience, and value in their minimal sense. They cannot be plausibly substituted or further reduced. They cannot be preferred one or more to others arbitrarily. We show how, in microphilosophy they coincide or synchronize. Jointly and basically, they form the minimum method employed. The initial, basic, intended result is called minimum feasibility. The fundamental circularity between method and result leaves no way out but to ground self-reference in such a manner that method and result “logico-genetically” coincide. Two extreme situations are avoided: “the logical zero-situation” where nothing is true or real, and “the credulous open situation” where everything is true or real. Finding a mean manifests a basic value. If the meaning of truth and reality is to be preserved, the basic value must have a clear impact and express descriptive rather than revisionary reason. -/- Several other stringent demands are raised as conditions which microphilosophy should fulfil to achieve feasibility. The final, joint, outcome of both “method” and “result,” in the thesis of microphilosophical feasibilism, is formulated thus: Self refers freely and symbolically to itself, own person, own body, material bodies, other persons’ bodies, other persons, and other selves. -/- Ramesh N. Patel Doctor of Philosophy in Philosophy conferred in June, 1970 University of New Mexico, Albuquerque, N.M. (shrink)

This is a re-look at the (Indian) Partition event through the lens of Advaita Vedanta.

It has been recently argued that the well-known square of opposition is a gathering that can be reduced to a one-dimensional figure, an ordered line segment of positive and negative integers [3]. However, one-dimensionality leads to some difficulties once the structure of opposed terms extends to more complex sets. An alternative algebraic semantics is proposed to solve the problem of dimensionality in a systematic way, namely: partition (or bitstring) semantics. Finally, an alternative geometry yields a new and unique pattern (...) of oppositions that proceeds with colored diagrams and an increasing set of bitstrings. (shrink)

There are some who defend a view of vagueness according to which there are intrinsically vague objects or attributes in reality. Here, in contrast, we defend a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being (...) its extension. We provide a new formulation of these ideas in terms of a theory of granular partitions. We show that this theory provides a general framework within which we can understand the relation between vague terms and concepts on the one hand and correlated portions of reality on the other. We also sketch how it might be possible to formulate within this framework a theory of vagueness which dispenses with the notion of truth-value gaps and other artifacts of more familiar approaches. (shrink)

We have a variety of different ways of dividing up, classifying, mapping, sorting and listing the objects in reality. The theory of granular partitions presented here seeks to provide a general and unified basis for understanding such phenomena in formal terms that is more realistic than existing alternatives. Our theory has two orthogonal parts: the first is a theory of classification; it provides an account of partitions as cells and subcells; the second is a theory of reference or intentionality; it (...) provides an account of how cells and subcells relate to objects in reality. We define a notion of well-formedness for partitions, and we give an account of what it means for a partition to project onto objects in reality. We continue by classifying partitions along three axes: (a) in terms of the degree of correspondence between partition cells and objects in reality; (b) in terms of the degree to which a partition represents the mereological structure of the domain it is projected onto; and (c) in terms of the degree of completeness with which a partition represents this domain. (shrink)

Plato’s tripartite soul plays a central role in his account of justice in the Republic. It thus comes as a surprise to find him apparently abandoning this model at the end of the work, when he suggests that the soul, as immortal, must be simple. I propose a way of reconciling these claims, appealing to neglected features of the city-soul analogy and the argument for the soul’s division. The original true soul, I argue, is partitioned, but in a finer manner (...) than how we encounter it in our everyday lives. (shrink)

Gaining information can be modelled as a narrowing of epistemic space . Intuitively, becoming informed that such-and-such is the case rules out certain scenarios or would-be possibilities. Chalmers’s account of epistemic space treats it as a space of a priori possibility and so has trouble in dealing with the information which we intuitively feel can be gained from logical inference. I propose a more inclusive notion of epistemic space, based on Priest’s notion of open worlds yet which contains only those (...) epistemic scenarios which are not obviously impossible. Whether something is obvious is not always a determinate matter and so the resulting picture is of an epistemic space with fuzzy boundaries. (shrink)

This paper analyses a hitherto unknown technique of using logic diagrams to create argument maps in eristic dialectics. The method was invented in the 1810s and -20s by Arthur Schopenhauer, who is considered the originator of modern eristic. This technique of Schopenhauer could be interesting for several branches of research in the field of argumentation: Firstly, for the field of argument mapping, since here a hitherto unknown diagrammatic technique is shown in order to visualise possible situations of arguments in (...) a dialogical controversy. Secondly, the art of controversy or eristic, since the diagrams do not analyse the truth of judgements and the validity of inferences, but the persuasiveness of arguments in a dialogue. (shrink)

In this paper we propose a formal theory of partitions (ways of dividing up or sorting or mapping reality) and we show how the theory can be applied in the geospatial domain. We characterize partitions at two levels: as systems of cells (theory A), and in terms of their projective relation to reality (theory B). We lay down conditions of well-formedness for partitions and we define what it means for partitions to project truly onto reality. We continue by classifying well-formed (...) partitions along three axes: (a) degree of correspondence between partition cells and objects in reality; (b) degree to which a partition represents the mereological structure of the domain it is projected onto; and (c) degree of completeness and exhaustiveness with which a partition represents reality. This classification is used to characterize three types of partitions that play an important role in spatial information science: cadastral partitions, categorical coverages, and the partitions involved in folk categorizations of the geospatial domain. (shrink)

Once upon a time, logical conventionalism was the most popular philosophical theory of logic. It was heavily favored by empiricists, logical positivists, and naturalists. According to logical conventionalism, linguistic conventions explain logical truth, validity, and modality. And conventions themselves are merely syntactic rules of language use, including inference rules. Logical conventionalism promised to eliminate mystery from the philosophy of logic by showing that both the metaphysics and epistemology of logic fit into a scientific picture of reality. For (...) naturalists of all stripes, this was paradise. Alas, paradise was lost. By the end of the twentieth century, logical conventionalism had been almost universally abandoned. But more recently, it has been revitalized. This chapter provides an overview of logical conventionalism and its history, clears away misunderstandings, and briefly responds to both the canonical objections to conventionalism (from Quine, Dummett, Boghossian, and many others) as well as new objections (from Field and Golan). From paradise lost, to paradise regained: logical conventionalism is back. (shrink)

In his “Bridging mainstream and formal ontology”, Augusto (2021) gives an excellent analysis of Dietrich von Freiberg’s idea of using causality as a partitioning principle for upper ontologies. For this Dietrich’s notion of extrinsic principles is crucial. The question whether causation can and indeed should be used as a partitioning principle for ontologies is discussed using mathematics and physics as examples.

We present a minimum message length (MML) framework for trajectory partitioning by point selection, and use it to automatically select the tolerance parameter ε for Douglas-Peucker partitioning, adapting to local trajectory complexity. By examining a range of ε for synthetic and real trajectories, it is easy to see that the best ε does vary by trajectory, and that the MML encoding makes sensible choices and is robust against Gaussian noise. We use it to explore the identification of micro-activities within a (...) longer trajectory. This MML metric is comparable to the TRACLUS metric – and shares the constraint of abstracting only by omission of points – but is a true lossless encoding. Such encoding has several theoretical advantages – particularly with very small segments (high frame rates) – but actual performance interacts strongly with the search algorithm. Both differ from unconstrained piecewise linear approximations, including other MML formulations. (shrink)

We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.

We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.

Hyperlogic is a hyperintensional system designed to regiment metalogical claims (e.g., “Intuitionistic logic is correct” or “The law of excluded middle holds”) into the object language, including within embedded environments such as attitude reports and counterfactuals. This paper is the first of a two-part series exploring the logic of hyperlogic. This part presents a minimal logic of hyperlogic and proves its completeness. It consists of two interdefined axiomatic systems: one for classical consequence (truth preservation under a classical (...) interpretation of the connectives) and one for “universal” consequence (truth preservation under any interpretation). The sequel to this paper explores stronger logics that are sound and complete over various restricted classes of models as well as languages with hyperintensional operators. (shrink)

‘Feminist logic’ may sound like an impossible, incoherent, or irrelevant project, but it is none of these. We begin by delineating three categories into which projects in feminist logic might fall: philosophical logic, philosophy of logic, and pedagogy. We then defuse two distinct objections to the very idea of feminist logic: the irrelevance argument and the independence argument. Having done so, we turn to a particular kind of project in feminist philosophy of logic: Valerie (...) Plumwood's feminist argument for a relevance logic. Plumwood's work serves as our primary case study as we turn to the project of considering three different ways we might understand her argument and revisionist arguments like it: as a priori theorizing, as ameliorative conceptual engineering, or as instances of anti-exceptionalist approaches to logic. After arguing that the anti-exceptionalist approach seems to provide the most promising means of understanding the kind of project undertaken in a feminist challenge to classical logic, we briefly address the consequences that this might have for logic instruction. Here, we argue for the perhaps unexpected conclusion that feminist programs ought to offer more, not less, instruction in logic for those who take interest. (shrink)

In this short note many conjectures on partitions of integers as summations of prime numbers are presented, which are extension of Goldbach conjecture.

Although the invariance criterion of logicality first emerged as a criterion of a purely mathematical interest, it has developed into a criterion of considerable linguistic and philosophical interest. In this paper I compare two different perspectives on this criterion. The first is the perspective of natural language. Here, the invariance criterion is measured by its success in capturing our linguistic intuitions about logicality and explaining our logical behavior in natural-linguistic settings. The second perspective is more theoretical. Here, the invariance criterion (...) is used as a tool for developing a theoretical foundation of logic, focused on a critical examination, explanation, and justification of its veridicality and modal force. (shrink)

In this paper, I offer a novel analysis of logical arguments from evil. I claim that logical arguments from evil have three parts: (1) characterisation (attribution of specified attributes to God); (2) datum (a claim about evil); and (3) link (connection between attributes and evil). I argue that, while familiar logical arguments from evil are known to be unsuccessful, it remains an open question whether there are successful logical arguments from evil.

The purpose of this paper is to explore the question of how truthmaker theorists ought to think about their subject in relation to logic. Regarding logic and truthmaking, I defend the view that considerations drawn from advances in modal logic have little bearing on the legitimacy of truthmaker theory. To do so, I respond to objections Timothy Williamson has lodged against truthmaker theory. As for the logic of truthmaking, I show how the project of understanding the (...) logical features of the truthmaking relation has led to an apparent impasse. I offer a new perspective on the logic of truthmaking that both explains the problem and offers a way out. (shrink)