A taxonomy of part‐whole or meronymic relations is developed to explain the ordinary English‐speaker's use of the term “part of” and its cognates. The resulting classification yields six types of meronymic relations: 1. component‐integral object (pedal‐bike), 2. member‐collection (ship‐fleet), 3. portion‐mass (slice‐pie), 4. stuff‐object (steel‐car), 5. feature‐activity (paying‐shopping), and 6. place‐area (Everglades‐Florida). Meronymic relations ore further distinguished from other inclusion relations, such as spatial inclusion, and class inclusion, and from several other semantic relations: attribution, attachment, and ownership. This taxonomy is (...) then used to explain cases of apparent intransitivity in merological syllogisms, and standard form syllogisms whose premises express different inclusion relations. The data suggest that intransitivities arise due to equivocations between different types of semantic relations. These results are then explained by means of the relation element theory which accounts for the character and behavior of semantic relations in terms of more primitive relational elements. The inferential phenomena observed are then explained by means of a single principle of element matching. (shrink)

I construe the question Are species sets? as a question about whether species can be conceived of as sets, as the term set is understood by contemporary logicians. The question is distinct from the question Are species classes?: The conception of classes invoked by Hull and others differs from the logician's conception of a set. I argue that species can be conceived of as sets, insofar as one could identify a set with any given species and that identification would satisfy (...) three desiderata: the set would be a set of organisms, the identification would be apposite, and the identification would permit the formulation of statements about species in set-theoretic terms. One cannot, however, identify a species with any given set. Understanding the claim that species are sets in this way enables one to understand better the dispute between some who accept the claim (e.g., Kitcher 1984, 1987) and some who apparently reject it (e.g., Mayr 1987). (shrink)

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. Rather than (...) any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

A Dedekind algebra is an ordered pair (B, h), where B is a non-empty set and h is a similarity transformation on B. Among the Dedekind algebras is the sequence of the positive integers. From a contemporary perspective, Dedekind established that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. The purpose here is to show that this seemingly isolated result is a consequence of more general results in the model theory of second-order languages. (...) Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are ?0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on ? called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type that occurs in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. The second-order theory of any countably infinite Dedekind algebra is categorical, and there are countably infinite Dedekind algebras whose second-order theories are not finitely axiomatizable. It is shown that there is a condition on configuration signatures necessary and sufficient for the second-order theory of a Dedekind algebra to be finitely axiomatizable. It follows that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. (shrink)

Some new double analogues of induction and transfinite recursion are given which yields a relatively simple proof of a result of Robert Cowen, [2] which in turn is a strengthening of an earlier result of Smullyan [1], which in turn gives a unified approach to Zorn's Lemma, the transfinite recursion theorem and certain results about ordinal numbers.

RésuméL'analyse non‐standard fournit une base solide à la théorie des infinitésimaux. L'approche axiomatique qu'en donne Nelson est basée sur un nouveau predicat qui est ajouté au langage de la théorie usuelle des ensembles. Nous interprétons ce prédicat et formulons les axio‐mes de Nelson ?on;une façon qui peut être comparee à la discussion de P. R. Halmos dans son livre Naïve Set Theory .SummaryNon‐standard analysis gives a proper foundation to the theory of infinitesimals. Nelson's axiomatic approach of it uses a new (...) predicate which is added to the classical language of set theory. We interpret this new predicate and formulate Nelson's axioms in a way that can be compared to P. R. Halmos' discussion of set axioms in his book Naïve Set Theory .ZusammenfassungDie nicht‐standard Analyse liefert eine solide Grundlage für die Theorie der infinitesimalen Grössen. Die von Nelson vorgeschlagene Axiomatisierung beruht auf einem neuen Prädikat, das den in der Sprache der Mengentheorie üblichen hinzugefügt wird. Wir interpretieren dieses Prädikat und formulieren Nelsons Axiome auf eine Art, die mit der Diskus‐sion von P.R. Halmos in Naïve Set Theory verglichen werden kann. (shrink)

Almost all set theorists pay at least lip service to Cantor’s definition of a set as a collection of many things into one whole; but empty and singleton sets do not fit with it. Adapting Dana Scott’s axiomatization of the cumulative theory of types, we present a ‘Cantorian’ system which excludes these anomalous sets. We investigate the consequences of their omission, examining their claim to a place on grounds of convenience, and asking whether their absence is an obstacle to the (...) theory’s ability to represent ordered pairs or to support the arithmetization of analysis or the development of the theory of cardinals and ordinals. (shrink)

This paper examines the proposition that adopting a socially responsible, or philanthropic, management posture is not antithetic to the capitalist business model but rather can be seen as a sound approach to the development of long-term sustainability in business in a modern business environment, wherein a strand of corporate social responsibility is one core aspect of the composite utility function of the modern business. We suggest further that for many of the prominent/significant examples of the successful adoption of a policy (...) of informed benevolence in the management of employees that policy seems to be faith rooted – be that faith Christian, Buddhist, Jewish, Muslim or other. Indeed, even if one observed an organisation subject to an humanist or even atheistic based socially responsible management, one could see that as being rooted in that organisation’s ‘non-faith’ faith, or ethical bubble. Our argument also gives the lie to the proposition, in currency in some circles, that the term ‘business ethics’ is an oxymoron. To underpin the argument we cite examples (/set out mini-cases, or a mixture of these) from a range of faith based traditions including, Buddhism, the Quaker-Christian tradition, Judaism and Islam. (shrink)

This paper tackles an open problem posed by Åqvist. It is the problem of whether his dyadic deontic systemsEandFare complete with respect to their intended Hanssonian preference-based semantics. It is known that there are two different ways of interpreting what it means for a world to be best or top-ranked among alternatives. This can be understood as saying that it is optimal among them, or maximal among them. First, it is established that, under either the maximality rule or the optimality (...) rule,Eis sound and complete with respect to the class of all preference models, the class of those in which the betterness relation is reflexive, and the class of those in which it is total. Next, an analogous result is shown to hold forF. That is, it is established that, under either rule,Fis sound and complete with respect to the class of preference models in which the betterness relation is limited, the class of those in which it is limited and reflexive, and the class of those in which it is limited and total. (shrink)

An important perquisite for verification of the correctness of software is the ability to write mathematically precise documents that can be read by practitioners and advanced users. Without such documents, we won't know what properties we should verify. Tabular expressions, in which predicate expressions may appear, have been found useful for this purpose. We frequently use partial functions in our tabular documentation. Conventional interpretations of expressions that describe predicates are not appropriate for our application because they do not deal with (...) partial functions. Experience with this documentation has led us to choose a logic in which predicates are total but functions remain partial. We have found that this particular interpretation results in simpler expressions and is easily understood by practitioners. (shrink)

Humans and organizations have limitations of computational capacity and information management. Such constraints are synonymous with bounded rationality. Therefore, in order to extend the human and organizational boundaries to more advanced models of cognition, this research proposes concepts of cognitive machines in organizations. From a micro point of view, what makes this research distinct is that, beyond people, it includes in the list of participants of the organization the cognitive machines. From a macro point of view, this paper relies on (...) the premise that cognitive machines can improve the cognitive abilities of the organization. From such perspectives, it presents rationale and principles of a class of cognitive machines with capabilities to carry out complex cognitive tasks in organizations. It also introduces analyses of the cognitive machines in organizations through theories of bounded rationality, economic decision-making, and conflict resolution. The analyses indicate that these machines can solve or reduce intra-individual and group dysfunctional conflicts which arise from decision-making processes in the organization, and thus they can improve the degree of organizational cognition. From all these backgrounds, this research outlines implications of cognitive machines for organizations. (shrink)

It is usually stated that quantum mechanics presents problems with the identity of particles, the most radical position—supported by E. Schrödinger—asserting that elementary particles are not individuals. But the subject goes deeper, and it is even possible to obtain states with an undefined particle number. In this work we present a set theoretical framework for the description of undefined particle number states in quantum mechanics which provides a precise logical meaning for this notion. This construction goes in the line of (...) solving a problem posed by Y. Manin, namely, to incorporate quantum mechanical notions at the foundations of mathematics. We also show that our system is capable of representing quantum superpositions. (shrink)

After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those (...) involving the distinction between characterizing a system and axiomatizing the truths of a system. (shrink)

A dilemma has stymied interpretations of the Stranger’s method of dividing kinds into subkinds in Plato’sSophistandStatesman. The dilemma assumes that the kinds are either extensions or intensions. Now kinds divide like extensions, not intensions. But extensions cannot explain the distinct identities of kinds that possess the very same members. We propose understanding a kind as like an animal body—the Stranger’s simile for division—possessing both an extension and an intension. We find textual support in the Stranger’s paradigmatic four steps for collecting (...) a subkind. (shrink)

Wittgenstein's conception of infinity can be seen as continuing the tradition of the potential infinite that begins with Aristotle. Transfinite cardinals in set theory might seem to render the potential infinite defunct with the actual infinite now given mathematical legitimacy. But Wittgenstein's remarks on set theory argue that the philosophical notion of the actual infinite remains philosophical and is not given a mathematical status as a result of set theory. The philosophical notion of the actual infinite is not to be (...) found in the mathematics of set theory, only in a certain associated philosophy – what Wittgenstein calls a certain kind of “prose”. (shrink)

It is a commonplace of set theory to say that there is no set of all well-orderings nor a set of all sets. We are implored to accept this due to the threat of paradox and the ensuing descent into unintelligibility. In the absence of promising alternatives, we tend to take up a conservative stance and tow the line: there is no universe. In this paper, I am going to challenge this claim by taking seriously the idea that we can (...) talk about the collection of all the sets and many more collections beyond that. A method of articulating this idea is offered through an indefinitely extending hierarchy of set theories. It is argued that this approach provides a natural extension to ordinary set theory and leaves ordinary mathematical practice untouched. (shrink)

In science as in mathematics, it is popular to know little and resent much about category theory. Less well known is how common it is to know little and like much about set theory. The set theory of almost all scientists, and even the average mathematician, is fundamentally different from the formal set theory that is contrasted against category theory. The latter two are often opposed by saying one emphasizes Substance, the other Form. However, in all known systems of mathematics (...) throughout history, mathematicians have moved fluidly between ideas conceived of as thing-like, property-like, and process-like. On the other hand one way to advance science is to better distinguish between thing, property, and process. All this constitutes a distracting background for those interested in, or distressed by, the possible application of category theory to science, and to mathematics as well. (shrink)

In science as in mathematics, it is popular to know little and resent much about category theory. Less well known is how common it is to know little and like much about set theory. The set theory of almost all scientists, and even the average mathematician, is fundamentally different from the formal set theory that is contrasted against category theory. The latter two are often opposed by saying one emphasizes Substance, the other Form. However, in all known systems of mathematics (...) throughout history, mathematicians have moved fluidly between ideas conceived of as thing-like, property-like, and process-like. On the other hand one way to advance science is to better distinguish between thing, property, and process. All this constitutes a distracting background for those interested in, or distressed by, the possible application of category theory to science, and to mathematics as well. (shrink)

The state of affairs of some things falling under a predicate is supposedly a single entity that collects these things as its constituents. But whether we think of a state of affairs as a fact, a proposition or a possibility, problems will arise if we adopt a plural logic. For plural logic says that any plurality include themselves, so whenever there are some things, the state of affairs of their plural self-inclusion should be a single thing that collects them all. (...) This leads to paradoxes analogous to those that afflict naïve set theory. Here I suggest that they are the very same paradoxes, because sets can be reduced to states of affairs. However, to obtain a consistent theoretical reduction we must restrict the usual axiom scheme of Comprehension for plural logic to ‘stratified’ formulas, to avoid viciously circular definitions. I prove that with this modification to the background plural logic, the theory of states of affairs is consistent; moreover, it yields the axioms of the familiar set theory NFU. (shrink)

Points of view are a central phenomenon in human cognition. Although the concept of point of view is ambiguous, there exist common elements in different notions. A point of view is a certain way to look at things around us. In conceptual points of view, things are looked at or interpreted through conceptual lenses. Conceptual points of view are important for epistemology, cognitive science, and philosophy of science. In this article, a new method to formalize conceptual points of view is (...) introduced. It is based on the conceptual space approach, where concepts are regions of multi-dimensional quality spaces. Points of view, as defined in this article, consist of a selection of relevant dimensions, referred to here as determinables, and of a certain supposition, referred to here as a theory, about the subject content. After considering some early efforts to formalize points of view, the notion of conceptual space is defined and explored. One concept of point of view is defined and developed in the framework of conceptual space, and a new logic for points of view is also outlined. The problem of mind–body correlation is discussed as an example of the application of the notion of points of view. To conclude, the meaning and applications of the new concepts and tools developed in the article are discussed. (shrink)

This is the first, out of two papers, devoted to Andrzej Grzegorczyk’s point-free system of topology from Grzegorczyk :228–235, 1960. https://doi.org/10.1007/BF00485101). His system was one of the very first fully fledged axiomatizations of topology based on the notions of region, parthood and separation. Its peculiar and interesting feature is the definition of point, whose intention is to grasp our geometrical intuitions of points as systems of shrinking regions of space. In this part we analyze separation structures and Grzegorczyk structures, and (...) establish their properties which will be useful in the sequel. We prove that in the class of Urysohn spaces with countable chain condition, to every topologically interpreted representative of a point in the sense of Grzegorczyk’s corresponds exactly one point of a space. We also demonstrate that Tychonoff first-countable spaces give rise to complete Grzegorczyk structures. The results established below will be used in the second part devoted to points and topological spaces. (shrink)

Quasi-set theory has been proposed as a means of handling collections of indiscernible objects. Although the most direct application of the theory is quantum physics, it can be seen per se as a non-classical logic (a non-reflexive logic). In this paper we revise and correct some aspects of quasi-set theory as presented in [12], so as to avoid some misunderstandings and possible misinterpretations about the results achieved by the theory. Some further ideas with regard to quantum field theory are also (...) advanced in this paper. (shrink)

Axiomatization is uncommon outside mathematics, partly for being often viewed as embalming, partly because the best-known axiomatizations have serious shortcomings, and partly because it has had only one eminent champion, namely David Hilbert. The aims of this paper are to describe what will be called dual axiomatics, for it concerns not just the formalism, but also the meaning of the key concepts; and to suggest that every instance of dual axiomatics presupposes some philosophical view or other. To illustrate these points, (...) a theory of solidarity will be crafted and axiomatized, and certain controversies in both classical and quantum physics, as well as in the philosophy of mind, will be briefly discussed. The upshot of this paper is that dual axiomatics, unlike the purely formal axiomatics favored by the structuralists school, is not a luxury but a tool helping resolve some scientific controversies. (shrink)

In this work, formulas are inclusions \ and non-inclusions \ between Boolean terms \ and \. We present a set of rules through which one can transform a term t in a diagram \ and, consequently, each inclusion \ ) in an inclusion \ ) between diagrams. Also, by applying the rules just to the diagrams we are able to solve the problem of verifying if a formula \ is consequence of a, possibly empty, set \ of formulas taken as (...) hypotheses. Our system has a diagrammatic language based on Venn diagrams that are read as sets, and not as statements about sets, as usual. We present syntax and semantics of the diagrammatic language, define a set of rules for proving consequence, and prove that our set of rules is strongly sound and complete in the following sense: given a set \ of formulas, \ is a consequence of \ iff there is a proof of this fact that is based only on the rules of the system and involves only diagrams associated to \ and to the members of \. (shrink)

Can Quine’s criterion for ontological commitment be comparatively applied across different logics? If so, how? Cross-logical evaluations of discourses are central to contemporary philosophy of mathematics and metaphysics. The focus here is on the influential and important arguments of George Boolos and David Lewis that second-order logic and plural quantification don’t incur additional ontological commitments over and above those incurred by first-order quantifiers. These arguments are challenged by the exhibition of a technical tool—the truncation-model construction of notational equivalents—that compares the (...) ontological role and increased expressive strength of non-first-order ideology to first-order ideology. (shrink)

The method of approximate reasoning using a fuzzy logic introduced by Baldwin (1978 a,b,c), is used to model human reasoning in the resolution of two well known paradoxes. It is shown how classical propositional logic fails to resolve the paradoxes, how multiple valued logic partially succeeds and that a satisfactory resolution is obtained with fuzzy logic. The problem of precise representation of vague concepts is considered in the light of the results obtained.