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)

Larry Moss and Rohit Parikh used subset semantics to characterize a family of logics for reasoning about knowledge. An important feature of their framework is that subsets always decrease based on the assumption that knowledge always increases. We drop this assumption and modify the semantics to account for logics of knowledge that handle arbitrary changes, that is, changes that do not necessarily result in knowledge increase, such as the update of our knowledge due to an action. We present a (...) system which is complete for subset spaces and prove its decidability. (shrink)

In this thesis we present two logical systems, $\bf MP$ and $\MP$, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and effort will be defined by concrete mathematical concepts.

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)

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

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

There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...) Cohen et al. (Eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony, Vol. 2, Kluwer Academic Publishers, Great Britain, 1997, pp. 177–190]. Unlike some others in the literature, these notions apply not only to certain nice sets, but to general sets in Rn and other appropriate spaces. We consider some motivations for these concepts and the logical relations between them. It has been argued that d.m.z. is especially appropriate for physical applications, and on Rn with the standard measure, it is strictly stronger than r.a. [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382]. Here we show that this is the only implication that holds among our three decidabilities in that setting. Under arbitrary measures, even this implication fails. Yet for intervals of non-zero length, and more generally, convex sets of non-zero measure, the three concepts are equivalent. (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)

Causal models show promise as a foundation for the semantics of counterfactual sentences. However, current approaches face limitations compared to the alternative similarity theory: they only apply to a limited subset of counterfactuals and the connection to counterfactual logic is not straightforward. This paper addresses these difficulties using exogenous interventions, where causal interventions change the values of exogenous variables rather than structural equations. This model accommodates judgments about backtracking counterfactuals, extends to logically complex counterfactuals, and validates familiar principles (...) of counterfactual logic. This combines the interventionist intuitions of the causal approach with the logical advantages of the similarity approach. (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)

In the fifth version of our response-paper [26] to Imamura’s criticism, we recall that NonStandard Neutrosophic Logic was never used by neutrosophic community in no application, that the quarter of century old neutrosophic operators (1995-1998) criticized by Imamura were never utilized since they were improved shortly after but he omits to tell their development, and that in real world applications we need to convert/approximate the NonStandard Analysis hyperreals, monads and binads to tiny intervals with the desired accuracy – otherwise (...) they would be inapplicable. We point out several errors and false statements by Imamura [21] with respect to the inf/sup of nonstandard subsets, also Imamura’s “rigorous definition of neutrosophic logic” is wrong and the same for his definition of nonstandard unit interval, and we prove that there is not a total order on the set of hyperreals (because of the newly introduced Neutrosophic Hyperreals that are indeterminate), whence the Transfer Principle from R to R* is questionable. After his criticism, several response publications on theoretical nonstandard neutrosophics followed in the period 2018-2022. As such, I extended the NonStandard Analysis by adding the left monad closed to the right, right monad closed to the left, pierced binad (we introduced in 1998), and unpierced binad - all these in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of NonStandard Unit Interval and NonStandard Neutrosophic Logic, together with NonStandard Neutrosophic Operators are presented. (shrink)

In the fifth version of our reply article [26] to Imamura's critique, we recall that Neutrosophic Non-Standard Logic was never used by the neutrosophic community in any application, that the quarter-century old (1995-1998) neutrosophic operators criticized by Imamura were never used as they were improved soon after, but omits to talk about their development, and that in real-world applications we need to convert/approximate the hyperreals, monads and bi-nads of Non-Standard Analysis to tiny intervals with the desired precision; otherwise they (...) would be inapplicable. We pointed out several errors and false statements by Imamura [21] regarding the inf/sup of nonstandard subsets, also Imamura's "rigorous definition of neutrosophic logic" is incorrect, as is his definition of nonstandard unit interval, and we showed that there is no total order in Neutrosophic Computing and Machine Learning , Vol. 23, 2022 Florentin Smarandache, Definición mejorada de la lógica neutrosófica no estándar e introducción a los hiperreales neutrosóficos (Quinta versión) 2 the set of hyperreals (due to the recently introduced Neutrosophic Hyperreals which are indeterminate), so the Transfer Principle from R to R* is questionable. After his critique, several reply posts on non-standard theoretical neutrosophy followed in 2018-2022. As such, I extended the Nonstandard Analysis by adding the right-closed left monad, the left-closed right monad, the punctured binad (which we introduced in 1998), and the nonpunctured binad - all in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of the Nonstandard Unitary Interval and Nonstandard Neutrosophic Logic are presented, along with Nonstandard Neutrosophic Operators. (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)

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)

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 paper is Part III of the large research, dedicated to both the revision of the system of basic logical categories and the generalization of modern predicate logic to functional logic. We determinate and contrapose modern Fregean logistics and proposed by the author ultra-Fregean logistics, next we describe values and arguments of functions, arguments of relations, relations themselves, sets (classes), and subsets (subclasses) as derivative categories (concepts) of ultrafregean logistics. Logistics is a part of metalogic, independent of semantics. (...) Fregean logictics is a metalogical theory, based on the quadruple <particular (individual), predicate, equality, sequence>; it generates predicate logic. Ultrafregean logictics is based on the quadruple <particular, function, representation, sequence>, where the notion of a function is a generalization of the notion of a predicate and the notion of representation is a generalization of the notion of equality; this logictics generates functional logic. For the completely correct denotation of the functional values, we need the Churchian symbolics with parenthesis. Predicates are usually identified with relations. A relation is the derived and even definable category of ultra-Fregean logictics. Namely, relations are representations by functions (of one of their arguments). We show that Frege could really establish this definition and the notion (category) of representation but, unfortunately, rejected this course of thought. Next, we show that every n-ary relation can be resolved for some of its arguments via some (n-1)-ary function. A set, or class, is a derived and not definable category of ultra-Fregean logistics. The universal way to introduce the sets is Frege’s abstraction principle. We formulate this principle for functional logic and show that the notion of a set is quantified, so there is the dual existential notion of a nonempty subset, involved by the same abstraction principle. (shrink)

Abstract. The aim of this paper is to show that the topological interpretation of knowledge as an interior kernel operator K of a topological space (X, OX) comes along with a partially ordered family of belief modalities B that fit K in the sense that the pairs (K, B) satisfy all axioms of Stalnaker’s KB logic of knowledge and belief with the exception of the contentious axiom of negative introspection (NI). The new belief modalities B introduced in this paper (...) are defined with the help of the (dense) nuclei of the Heyting algebra OX of open subsets on the topological space (X, OX). In this way, the natural context for the belief operators B related to topological knowledge operator K is shown to be the Heyting algebra NUC(OX) of the nuclei of the Heyting algebra OX.1 More precisely, the dense nuclei of NUC(OX) can be used to define a variety of bimodal logics of knowledge operators K and belief operators B. The operators K and B are compatible with each other in the sense that the pairs (K, B) satisfy all axioms of Stalnaker’s KB system with the exception of the axiom (NI). Therefore, for (X, OX), one obtains a bounded, partially ordered family of belief operators B defined by the elements of NUC(OX). (shrink)

The first degree entailment (FDE) family is a group of logics, a many-valued semantics for each system of which is obtained from classical logic by adding to the classical truth-values true and false any subset of {both, neither, indeterminate}, where indeterminate is an infectious value (any formula containing a subformula with the value indeterminate itself has the value indeterminate). In this paper, we see how to extend a version of star semantics for the logics whose many-valued semantics lack (...) indeterminate to star semantics for logics whose many-valued semantics include indeterminate. The equivalence of the many-valued semantics and star semantics is established by way of a soundness and completeness proof. The upshot of the novel semantics in terms of the applied semantics of these logics, and specifically infectiousness, is explored, settling on the idea that infectiousness concerns ineffability. (shrink)

A “conceptual spaces” approach is used to formalize Aristotle’s main intuitions about time and change, and other ideas about temporal points of view. That approach has been used in earlier studies about points of view. Properties of entities are represented by locations in multidimensional conceptual spaces; and concepts of entities are identified with subsets or regions of conceptual spaces. The dimensions of the spaces, called “determinables”, are qualities in a very general sense. A temporal element is introduced by adding a (...) time variable to state functions that map entities into conceptual spaces. That way, states may have some permanency or stability around time instances. Following Aristotle’s intuitions, changes and events will not be necessarily instant phenomena, instead they could be processual and interval dependent. Change is defined relatively to the interval during which the change is taking place. Time intervals themselves are taken to represent points of view. To have a point of view is to look at the world as it is in the selected interval. Many important concepts are relativized to intervals, for instance change, events, identity, ontology, potentiality, etc. The definition of points of view as intervals allows to compare points of view in relation to all these concepts. The conceptual space approach has an immediate semantic and structural character, but it is tempting to develop also logics to describe them. A formal language is introduced to show how this could be done. (shrink)

In 1995, as a student of psychology inspired by natural science, I defined a logical model of personality explaining psychosis. I created (for my MA thesis, 1998 and grant research, 1999) new kind of tests assessing intelligence, creativity, prejudices, expectations to show more exact methods in psychology. During my Phd study in economics, I developed 'Maximization of Uniqueness (Originality)' model enhancing the classic utility to explain irrational motivations linking economics and psychology. Later I became computer programmer developing functional programming. According (...) to Personality model (and my experience in chess composition), I've built server and client logic of information system www.each.co.uk, and produced visual art. I presented the excerpts of 'Personality Model' in a few articles, and later as part of my art exhibitions: From Animation (Oct 2013, Holland Park, London), Parallax 12 (Feb 2015, Chelsea Town Hall, London), Fading Memory (Sep 2015, Weißenohe / Nuremberg, Germany). Another work: The Science is a subset of the Art extends Personality Model to art, society. At the end I add example and explanation of a special problem, when the higher intelligence leads to a wrong solution. It was published in Japanese Journal Problem Paradise in 1999. All presented results can be repeated. Computer testing would enable to acquire more data and more exact analysis. (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)

This is the formal YACC BNF specification for Minimal Type Theory (MTT). MTT was created by augmenting the syntax of First Order Logic (FOL) to specify Higher Order Logic (HOL) expressions using FOL syntax. Syntax is provided to enable quantifiers to specify type. FOL is a subset of MTT. The ASSIGN_ALIAS operator := enables FOL expressions to be chained together to form HOL expressions.

A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. (...) A tableau system with labels, signs, and suffixes is defined, extending the basic language $\mathscr{L}_{\mathbf{QB}}$ by quasiformulas (to express the denotations of predicates). The proposed logical system is paraconsistent since $\phi \wedge \neg\phi$ does not ``explode'' with arbitrary syntactic consequences. (shrink)

This paper aims to provide a basic explanation of existence, fundamental aspects of reality, and consciousness. Existence in its most general sense is identified with the principle of logical consistency: to exist means to be logically consistent. The essence of the principle of logical consistency is that every thing is what it is and is not what it is not. From this principle follows the existence of intrinsic, indescribable identities of things and relations between them. There are three fundamental, logically (...) necessary relations: similarity, composition and instantiation. Set theory, mathematics, logic and science are presented as relational descriptions of reality. Qualities of consciousness (qualia) are identified with intrinsic identities of things or at least a certain subset of them, especially in the context of a dynamic form of organized complexity. (shrink)

This paper presents a uniform general account of regress problems in the form of a pentalemma—i.e., a set of five mutually inconsistent claims. Specific regress problems can be analyzed as instances of such a general schema, and this Regress Pentalemma Schema can be employed to generate deductively valid arguments from the truth of a subset of four claims to the falsity of the fifth. Thus, a uniform account of the nature of regress problems allows for an improved understanding of (...) specific regress objections or arguments, and, correspondingly, of the general logical geography of the debate about infinite regresses. This uniform approach is illustrated by a treatment of the classical epistemological problem of justification, but it encompasses a whole variety of cases including explanation and ontological grounding. Furthermore, this general account is compared and contrasted with the existing literature discussing argument schemata for regress objections, particularly with the work of Jan Willem Wieland. It is shown how such other schemata can be incorporated and superseded by the general Regress Pentalemma Schema. (shrink)

One important strand of Sellars’s attack on classical foundationalism from Empiricism and the Philosophy of Mind is his thesis about the priority of is-talk over looks-talk. This thesis has been criticized extensively in recent years, and classical foundationalism has found several contemporary defenders. I revisit Sellars’s thesis and argue that is-talk is epistemically prior to looks-talk in a way that undermines classical foundationalism. The classical foundationalist claims that epistemic foundations are constituted by the agent’s set of looks-judgments. However, I argue (...) that only a subset of these looks-judgments are even candidates to serve as foundations for the agent’s empirical knowledge, and membership in this subset is determined by the agent’s theory of how the world is. Thus, the epistemic force of the looks-judgments in this subset is dependent on the agent’s theory of how the world is. This means that these looks-judgments aren’t foundational at all, as the agent’s theory of how the world is is epistemically is prior to the epistemic status of these looks-judgments. This is the sense in which judgments about how the world is are epistemically prior to judgments about how things look. This conclusion allows concrete elaboration of another of Sellars’s well-know claims: “I do wish to insist that the metaphor of ‘foundation’ is misleading in that it keeps us from seeing that if there is a logical dimension in which other empirical propositions rest on observation reports, there is another logical dimension in which the latter rest on the former”. (shrink)

Dung’s argumentation frameworks are formalisms widely used to model interaction among arguments. Although their study has been profusely developed in the field of Artificial Intelligence, it is not common to see its treatment among those less connected to computer science within the logical-philosophical community. In this paper we propose to bring to that audience a proof-theory for argument justification based on tableaux, very similar to those the Logic students are familiar with. The tableaux enable to calculate whether an argument (...) or subset of arguments are accepted or rejected in accordance to Dung’s preferred and grounded extension-based semantics. Soundness and completeness results regarding those semantics are provided. (shrink)

Synthetic biology is a field of research that concentrates on the design, construction, and modification of new biomolecular parts and metabolic pathways using engineering techniques and computational models. By employing knowledge of operational pathways from engineering and mathematics such as circuits, oscillators, and digital logic gates, it uses these to understand, model, rewire, and reprogram biological networks and modules. Standard biological parts with known functions are catalogued in a number of registries (e.g. Massachusetts Institute of Technology Registry of Standard (...) Biological Parts). Biological parts can then be selected from the catalogue and assembled in a variety of combinations to construct a system or pathway in a microbe. Through the innovative re-engineering of biological circuits and the optimization of certain metabolic pathways, biological modules can be designed to reprogram organisms to produce products or behaviors. Synthetic biology is what is known as a “platform technology”. That is, it generates highly transferrable theoretical models, engineering principles, and know-how that can be applied to create potential products in a wide variety of industries. Proponents suggest that applications of synthetic biology may be able to provide scientific and engineered solutions to a multitude of worldwide problems from health to energy. Synthetic biology research has already been successful in constructing microbial products which promise to offer cheaper pharmaceuticals such as the antimalarial synthetic drug artemisinin, engineered microbes capable of cleaning up oil spills, and the engineering of biosensors that can detect the presence of high concentrations of arsenic in drinking water. One of the potential benefits of synthetic biology research is in its application to biofuel production. It is this application which is the focus of this entry. The term “biofuel” has referred generally to all liquid fuels that are sourced from plant or plant byproducts and are used for energy necessary for transportation vehicles (Thompson 2012). Biofuels that are produced using synthetic biological techniques re-engineer microbes into biofuel factories are a subset of these. (shrink)

This paper is about two controversial inference-patterns involving counterfactual or subjunctive conditionals. Given a plausible assumption about the truth-conditions of counterfactuals, it is shown that one can't go wrong in applying hypothetical syllogism (i.e., transitivity) so long as the set of worlds relevant for the conclusion is a subset of the sets of worlds relevant for the premises. It is also shown that one can't go wrong in applying antecedent strengthening so long as the set of worlds relevant for (...) the conclusion is a subset of that for the premise. These results are then adapted to Lewis's theory of counterfactuals. (shrink)

This draft preprint presents a nine step argument for “Connectionist Structuralism” (CS), an account of the ontology of abstract objects that is neither purely nominalist nor purely platonist. CS is a common, often implicit assumption in parts of the artificial intelligence literature, but such discussions have not presented formal accounts of the position or engaged with metaphysical issues that potentially undermine it. By making the position legible and presenting an initial case for it, we hope to support a constructive dialogue (...) between AI researchers and philosophers of metaphysics that helps both sides to refine the position. -/- CS proposes that each abstract object we can draw on in human analysis corresponds to a particular subset of an individual person’s brain structure whose functionality is isomorphic to a subset of the nodes and connections in a suitable connectionist network. In other words, abstract objects are physically realised, but in individual brains, rather than only in the referent objects (pure nominalism) or in metaphysical universals (pure platonism). -/- This paper’s minimum claim is that CS can account for all abstract object predicables regarding sensible properties, such as “is red” or “is a square”. Using evidence from cognitive neuroscience, machine learning, and evolutionary biology, as well as a fully traceable toy example, we describe how CS can support our core cognitive uses of such sensible properties and can account for our core phenomenal experiences of them. In the former, CS provides sufficient albeit imperfect inferential safety, whose limitations are argued to strengthen rather than weaken the case for CS as describing human behaviour. In the latter, four target phenomenal features are accounted for – abstract objects as feeling intangible, non-located, transparent, and unchanging - along with accounts for further phenomena such as semantic refinement, the Stroop effect, synaesthesia, semantic clarity, sensory overload, and satiation. -/- Our minimum claim concerns the day-to-day usage and felt experience of abstract objects, but we suggest also an extended claim in which CS can form the basis of a pragmatic sufficient logic. As such, the initial outline of a response is provided for five common objections to positions that seek to ground abstract objects without reference to metaphysically stand-alone universals: referential opacity; identity of indiscernibles; infinite regression; non-physical concepts; and necessary truths. These outlines lay the foundation for (but do not seek to formally demonstrate) an extended CS account that addresses other abstract objects, including issues relating to their use in mathematics and formal logic. -/- The CS account leads to a four-layer hierarchy of similarity for whether your “red” is the same as mine. Considering both semantic and phenomenal similarity, we conclude that our “reds” are likely non-identical but can be made close enough for practical purposes. Finally, we describe how future work could elaborate CS as a metaphysical project and how confidence in it could be tested through empirical research. (shrink)

The longstanding species problem in biology has a history that suggests a solution, and that history is not the received history found in many texts written by biologists or philosophers. The notion of species as the division into subordinate groups of any generic predicate was the staple of logic from Aristotle through the middle ages until quite recently. However, the biological species concept during the same period was at first subtly and then overtly different. Unlike the logic sense, (...) which relied on definitions of the essence of both genus and species, biological species from the time of Epicurus were consistently considered to involve a reproductive element: in short, living species relied not on essential definitions, but on the generative cause, which might not be definable. I term this the generative conception of species: species were the generation by reproduction of form. This undercuts the claim that species before Darwin were essentialist, and divorces the notion of a type from that of essence. In fact, as late as the end of the nineteenth century, logicians explicitly treated biological “species” as a homonym only of logical essentialist species, and permitted considerable deviation from the type or form. At every point, species in logic were thought to be a subset, in effect, of some more general notion. I sketch a history of both philosophical and biological traditions of the species concept, before turning to the current conceptions. These are reconsidered in the light of this history, and in particular Mayr’s changing views are shown to be somewhat Whiggish, historiographically. Of the many touted biological species concepts, only one of which (Mayr’s) is called _the_ Biological Species Concept, none appears to capture all the relevant facts, intuitions, and operational requirements of biology. Cladistic conceptions, however, have much in common with the older philosophical literature, in that the natural group of cladism is the clade, or monophyletic group. After considering the Individuality Thesis, and the metaphysics of species, we see that species are the most particular terminal taxa in a clade, and that they are “defined” in terms of the particular synapomorphies, or evolved characters, that are causally responsible for keeping the lineages that organisms form distinct from one another. In this way, we can remain within the generative conception of species that has been in play for over two millennia, and yet avoid the pitfalls of prior attempts to find a universal conception of species. (shrink)

Could the intersection of [formal proofs of mathematical logic] and [sound deductive inference] specify formal systems having [deductively sound formal proofs of mathematical logic]? All that we have to do to provide [deductively sound formal proofs of mathematical logic] is select the subset of conventional [formal proofs of mathematical logic] having true premises and now we have [deductively sound formal proofs of mathematical logic].

As soon as you believe an imagination to be nonfictional, this imagination becomes your ontological theory of the reality. Your ontological theory (of the reality) can describe a system as the reality. However, actually this system is only a theory/conceptual-space/imagination/visual-imagery of yours, not the actual reality (i.e., the thing-in-itself). An ontological theory (of the reality) actually only describes your (subjective/mental) imagination/visual-imagery/conceptual-space. An ontological theory of the reality, is being described as a situation model (SM). There is no way to prove/disprove (...) that there is only one reality, or there are two realities (i.e., “subjective reality” and “objective reality”). So, every ontology talk/theory/imagination about the two realities is only a talk/theory/imagination – we will never know whether it is true or not. The conventionally-called “physical/objective reality/world” around my conventionally-called “physical/objective body” is actually a geometric mathematical model (being generated/mathematically-modeled by my brain) – it's actually a subset/component/part/element of my brain’s mind/consciousness/manifest-image. Our cosmos is an autonomous objective parallel computing automaton (aka state machine) which evolves by itself automatically/unintentionally – wave-particle duality and Heisenberg’s uncertainty principle can be explained under this SM of my brain. Each elementary particle (as a building block of our cosmos) is an autonomous mathematical entity itself (i.e., a thing in itself). Our cosmos has the same nature as a Game of Life system – both are autonomous objective parallel-computing automata. Cosmos (as a state machine) is indistinguishable from a digital simulation – my consciousness (as something nonphysical) is not cosmos (as a state machine). If we are happy to accept randomness/stochasticity, then it is obviously possible that all other worlds in the many-worlds interpretation (MWI) actually do not exist (objectively). As one metaphysical option, we can treat all other worlds as subjective only (even if they are actually objective). Under the context of this metaphysical option, we are only living in one world (i.e., the world we are currently living in; this world) – we are not living in many worlds at the same time parallelly. Under the context of this metaphysical option, there is only one possible future. The relationship among any number of elementary particles, is governed/described by Schrodinger equation. If (in theory) Schrodinger equation can’t be used to reliably forecast whether I will go to McDonald for dinner in this world (based on the current state of all elementary particles of the cosmos), then what can Schrodinger equation do? The conventionally-called “space” does not exist objectively. “Time” and “matter” are not physical. Consciousness is the subjective-form (aka quale) of the mathematical models (of the objective cosmos) which are intracorporeally/subjectively used by the control logic of a Turing machine’s program fatedly. A Turing machine’s mind/consciousness/manifest-image or deliberate decisions/choices should not be able to actually/objectively change/control/drive the (autonomous or fated) worldline of any elementary particle within this world (i.e., the world we are currently living in, under the context of MWI). Besides the Schrodinger equation (or another mathematical equation/function which is yet to be discovered) which is a valid/correct/factual causality of our cosmos/state-machine, every other causality (of our cosmos/state-machine) is either invalid/incorrect/counterfactual or can be proved by deductive inference based on the Schrodinger equation (or the aforementioned yet-to-be-discovered mathematical equation/function) only. Closed causality entails no causality. Consciousness plays no causal role (“epiphenomenalism”), or in other words, any cognitive/behavioural activity can in principle be carried out without consciousness (“conscious inessentialism”). If the “loop quantum gravity” theory is correct, then time/space does not actually/objectively exist in the objective-evolution of the objective cosmos, or in other words, we should not use the subjective/mental concept of “time”, “state” or “space” to describe/imagine the objective-evolution of our cosmos. (shrink)

The paper defends a variant of the material implication approach to the meaning of conditional sentences against some arguments that are considered to be widely subscribed to and/or important in the philosophical, psychological and linguistic literature. These arguments are shown to be wrong, debatable, or to miss their aim if the truth conditions defining material implication are viewed as determining nothing but the denotation of conditional sentences and if the function of conditional sentences in deduction (logic) is focused on (...) rather than in inferencing (reasoning). It is shown that some ‘paradoxes of material implication’ are due to inconsistent premises of deductions introduced by semantic relations between clauses constituting the premises, a fact which does not invalidate the approach. Other ‘paradoxes’ are shown to arise because they are based on uninformative deductions, violating a basic pragmatic principle. In addition, the paper introduces the distinction between the set of possible states of a mental model of the actual world and of alternative worlds. It is argued that material implication determines the denotation of an indicative conditional as a subset of the former set and the denotation of a subjunctive conditional as a subset of the latter set, thus unifying these two types of conditionals. (shrink)

In this book, authors, for the first time, introduce the new notion of special subset linguistic topological spaces using linguistic square matrices. This book is organized into three chapters. Chapter One supplies the reader with the concept of ling set, ling variable, ling continuum, etc. Specific basic linguistic algebraic structures, like linguistic semigroup linguistic monoid, are introduced. Also, algebraic structures to linguistic square matrices are defined and described with examples. For the first time, non-commutative linguistic topological spaces are introduced. (...) The notion of a linguistic special subset of doubly non-commutative topological spaces of linguistic topological spaces is introduced in this book. (shrink)

Recent work has defended “Euclidean” theories of set size, in which Cantor’s Principle (two sets have equally many elements if and only if there is a one-to-one correspondence between them) is abandoned in favor of the Part-Whole Principle (if A is a proper subset of B then A is smaller than B). It has also been suggested that Gödel’s argument for the unique correctness of Cantor’s Principle is inadequate. Here we see from simple examples, not that Euclidean theories of (...) set size are wrong, but that they must be either very weak and narrow or largely arbitrary and misleading. (shrink)

The Subset View of realization, though it has some attractive advantages, also has several problems. In particular, there are five main problems that have emerged in the literature: Double-Counting, The Part/Whole Problem, The “No Addition of Being” Problem, The Problem of Projectibility, and the Problem of Spurious Kinds. Each is reviewed here, along with solutions (or partial solutions) to them. Taking these problems seriously constrains the form that a Subset view can take, and thus limits the kinds of (...) relations that can fulfill the realization relation on this view. (shrink)

The applicability of Bayesian conditionalization in setting one’s posterior probability for a proposition, α, is limited to cases where the value of a corresponding prior probability, PPRI(α|∧E), is available, where ∧E represents one’s complete body of evidence. In order to extend probability updating to cases where the prior probabilities needed for Bayesian conditionalization are unavailable, I introduce an inference schema, defeasible conditionalization, which allows one to update one’s personal probability in a proposition by conditioning on a proposition that represents a (...) proper subset of one’s complete body of evidence. While defeasible conditionalization has wider applicability than standard Bayesian conditionalization (since it may be used when the value of a relevant prior probability, PPRI(α|∧E), is unavailable), there are circumstances under which some instances of defeasible conditionalization are unreasonable. To address this difficulty, I outline the conditions under which instances of defeasible conditionalization are defeated. To conclude the article, I suggest that the prescriptions of direct inference and statistical induction can be encoded within the proposed system of probability updating, by the selection of intuitively reasonable prior probabilities. (shrink)

A central area of current philosophical debate in the foundations of mathematics concerns whether or not there is a single, maximal, universe of set theory. Universists maintain that there is such a universe, while Multiversists argue that there are many universes, no one of which is ontologically privileged. Often forcing constructions that add subsets to models are cited as evidence in favour of the latter. This paper informs this debate by analysing ways the Universist might interpret this discourse that seems (...) to necessitate the addition of subsets to V. We argue that despite the prima facie incoherence of such talk for the Universist, she nonetheless has reason to try and provide interpretation of this discourse. We analyse extant interpretations of such talk, and analyse various tradeoffs in naturality that might be made. We conclude that the Universist has promising options for interpreting different forcing constructions. (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)

In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable if and only if it is in the second ambiguous class, if and only if it is eventually annihilated by a certain remainder. We simplify this remainder and give a new proof of the latter equivalence. We then introduce a notion of guessing with an ordinal limit on how often one can change one’s mind. (...) We show that for every ordinal $\alpha$, a guessable set is annihilated by $\alpha$ applications of the simplified remainder if and only if it is guessable with fewer than $\alpha$ mind changes. We use guessability with fewer than $\alpha$ mind changes to give a semi-characterization of the Hausdorff difference hierarchy, and indicate how Wadge’s notion of guessability can be generalized to higher-order guessability, providing characterizations of ${\mathbf{\Delta}}^{0}_{\alpha}$ for all successor ordinals $\alpha\gt 1$. (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)

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)

A historical review and philosophical look at the introduction of “negative probability” as well as “complex probability” is suggested. The generalization of “probability” is forced by mathematical models in physical or technical disciplines. Initially, they are involved only as an auxiliary tool to complement mathematical models to the completeness to corresponding operations. Rewards, they acquire ontological status, especially in quantum mechanics and its formulation as a natural information theory as “quantum information” after the experimental confirmation the phenomena of “entanglement”. Philosophical (...) interpretations appear. A generalization of them is suggested: ontologically, they correspond to a relevant generalization to the relation of a part and its whole where the whole is a subset of the part rather than vice versa. The structure of “vector space” is involved necessarily in order to differ the part “by itself” from it in relation to the whole as a projection within it. That difference is reflected in the new dimension of vector space both mathematically and conceptually. Then, “negative or complex probability” are interpreted as a quantity corresponding the generalized case where the part can be “bigger” than the whole, and it is represented only partly in general within the whole. (shrink)

‘Dogwhistle’ refers to a kind of political manipulation that some people carry out for political gains. According to Saul (2018), dogwhistles can be either intentional or unintentional depending on whether the speaker carried out the dogwhistle deliberately or not —although one cannot always recognize whether a particular case was intentional. In addition to being intentional or not, dogwhistles can also be overt or covert depending on whether the audience is aware or not of the dogwhistle. In the case of overt (...) dogwhistles, the speaker addresses a message to an audience with two possible interpretations. One of these is coded and affects only a subset the audience (Witten 2014). Covert dogwhistles, on the other hand, are not really about sending a “coded message.” Instead, they raise attitudes to salience, so people will act on them without realizing they are being moved on them. As Stanley (2015) points out, these kinds of dogwhistles work as a strategy for undermining democratic ideals without immediate rejection. Our key question is whether covert dogwhistles constitute a special form of implicit communication or whether they can be reduced to already existing forms of implicit communication such as presuppositions or implicatures. We will focus on covert dogwhistles because they seem more difficult to accommodate within the traditional categories of presuppositions and implicatures. To carry out this task, we compare the features of each of the mentioned phenomena and analyse how they behave in the face of retraction. (shrink)

The hard problem of induction is to argue without begging the question that inductive inference, applied properly in the proper circumstances, is conducive to truth. A recent theorem seems to show that the hard problem has a deductive solution. The theorem, provable in ZFC, states that a predictive function M exists with the following property: whatever world we live in, M ncorrectly predicts the world’s present state given its previous states at all times apart from a well-ordered subset. On (...) the usual model of time a well-ordered subset is small relative to the set of all times. M’s existence therefore seems to provide a solution to the hard problem. My paper argues for two conclusions. First, the theorem does not solve the hard problem of induction. More positively though, it solves a version of the problem in which the structure of time is given modulo our choice of set theory. (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.