Barry Smith recently discussed the diagraphs of book eight of Jacob Lorhard’s Ogdoas scholastica under the heading “birth of ontology” (Smith, 2022; this issue). Here, I highlight the commonalities between the original usage of diagraphs in the tradition of Ramus for didactic purposes and the the usage of their present-day successors–modern ontologies–for computational purposes. The modern ideas of ontology and of the universal computer were born just two generations apart in the breakthrough century of instrumental reason.

Minimal Type Theory (MTT) is based on type theory in that it is agnostic about Predicate Logic level and expressly disallows the evaluation of incompatible types. It is called Minimal because it has the fewest possible number of fundamental types, and has all of its syntax expressed entirely as the connections in a directed acyclic graph.

This paper provides a general introduction to the use of causal models in the metaphysics of causation, specifically structural equation models and directed acyclic graphs. It reviews the formal framework, lays out a method of interpretation capable of representing different underlying metaphysical relations, and describes the use of these models in analyzing causation.

The exponential growth of social data both in volume and complexity has increasingly exposed many of the shortcomings of the conventional frequentist approach to statistics. The scientific community has called for careful usage of the approach and its inference. Meanwhile, the alternative method, Bayesian statistics, still faces considerable barriers toward a more widespread application. The bayesvl R package is an open program, designed for implementing Bayesian modeling and analysis using the Stan language’s no-U-turn (NUTS) sampler. The package combines the ability (...) to construct Bayesian network models using directed acyclic graphs (DAGs), the Markov chain Monte Carlo (MCMC) simulation technique, and the graphic capability of the ggplot2 package. As a result, it can improve the user experience and intuitive understanding when constructing and analyzing Bayesian network models. A case example is offered to illustrate the usefulness of the package for Big Data analytics and cognitive computing. (shrink)

There are simple mechanical systems that elude causal representation. We describe one that cannot be represented in a single directed acyclic graph. Our case suggests limitations on the use of causal graphs for causal inference and makes salient the point that causal relations among variables depend upon details of causal setups, including values of variables.

Molinists hold that there are contingently true counterfactuals about what agents would do if put in specific circumstances, that God knows these prior to creation, and that God uses this knowledge in choosing how to create. In this essay we critique Molinism, arguing that if these theses were true, agents would not be free. Consider Eve’s sinning upon being tempted by a serpent. We argue that if Molinism is true, then there is some set of facts that fully explains both (...) Eve’s action and everything else Eve does that influences that action; and that if this is the case, Eve does not act freely. The first premise of this argument follows from the explanatory relations the Molinist is committed to, and the second premise follows from libertarian intuitions about free will. (shrink)

By separating the general concept of truth into syntactic truth and semantic truth, this article proposes a new theory of truth to explain several paradoxes like the Liar paradox, Card paradox, Curry’s paradox, etc. By revealing the relationship between syntactic /semantic truth and being-nothing-becoming which are the core concepts of dialectical logic, it is able to formalize dialectical logic. It also provides a logical basis for complexity theory by transferring all reasoning into a directed (cyclic/acyclic) graph which explains (...) both paradoxical and paradox-free reasoning. The different structure between cyclic graphs and acyclic graphs is the key to understanding paradoxes. By explaining the immanent between logic, paradox, and cellular automata, it also illustrates dialectical logic as ontology. (shrink)

Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to each other (in 2D space) when this expression is formalized using a directed acyclic graph (DAG). This provides substantially greater expressiveness than the 1D space of FOPL syntax. -/- The increase in expressiveness over other formal systems of logic shows the Pathological Self-Reference Error of expressions previously considered to be sentences of formal systems. MTT shows that these expressions were never truth (...) bearers, thus never sentences of any formal logic system. (shrink)

Modeling mechanisms is central to the biological sciences – for purposes of explanation, prediction, extrapolation, and manipulation. A closer look at the philosophical literature reveals that mechanisms are predominantly modeled in a purely qualitative way. That is, mechanistic models are conceived of as representing how certain entities and activities are spatially and temporally organized so that they bring about the behavior of the mechanism in question. Although this adequately characterizes how mechanisms are represented in biology textbooks, contemporary biological research practice (...) shows the need for quantitative, probabilistic models of mechanisms, too. In this paper we argue that the formal framework of causal graph theory is well-suited to provide us with models of biological mechanisms that incorporate quantitative and probabilistic information. On the ba-sis of an example from contemporary biological practice, namely feedback regulation of fatty acid biosynthesis in Brassica napus, we show that causal graph theoretical models can account for feedback as well as for the multi-level character of mechanisms. However, we do not claim that causal graph theoretical representations of mechanisms are advantageous in all respects and should replace common qualitative models. Rather, we endorse the more balanced view that causal graph theoretical models of mechanisms are useful for some purposes, while being insufficient for others. (shrink)

In this paper, we analyze and discuss Schopenhauer’s n-term diagrams for eristic dialectics from a graph-theoretical perspective. Unlike logic, eristic dialectics does not examine the validity of an isolated argument, but the progression and persuasiveness of an argument in the context of a dialogue or even controversy. To represent these dialogue situations, Schopenhauer created large maps with concepts and Euler-type diagrams, which from today’s perspective are a specific form of graphs. We first present the original method with Euler-type diagrams, (...) then give the most important graph-theoretical definitions, then discuss Schopenhauer’s diagrams graph-theoretically and finally give an example of how the graphs or diagrams can be used to analyze dialogues. (shrink)

A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as m-graphs. After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of (...) the generality of the approach our results apply to very different logics encompassing, among others, substructural logics as well as logics with nondeterministic semantics, and subsume all logics endowed with an algebraic semantics. (shrink)

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of (...) two deductive systems is an m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

In this book, the authors systematically define the new notion of linguistic graphs associated with a linguistic set of a linguistic variable. We can also define the notion of directed linguistic graphs and linguistic-weighted graphs. Chapter two discusses all types of linguistic graphs, linguistic dyads, linguistic triads, linguistic wheels, complete linguistic graphs, linguistic connected graphs, disconnected linguistic graphs, linguistic components of the graphs and so on. Further, we define the notion of linguistic subgraphs of a linguistic graph. However, like (...) usual graphs, we will not be able to arbitrarily connect any two linguistic words of a linguistic set associated with a linguistic variable. They can be related or adjacent depending on the linguistic variable associated with the linguistic set. This is an exceptional feature of a linguistic graph. (shrink)

We argue that C. Darwin and more recently W. Hennig worked at times under the simplifying assumption of an eternal biosphere. So motivated, we explicitly consider the consequences which follow mathematically from this assumption, and the infinite graphs it leads to. This assumption admits certain clusters of organisms which have some ideal theoretical properties of species, shining some light onto the species problem. We prove a dualization of a law of T.A. Knight and C. Darwin, and sketch a decomposition result (...) involving the internodons of D. Kornet, J. Metz and H. Schellinx. A further goal of this paper is to respond to B. Sturmfels’ question, “Can biology lead to new theorems?”. (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.

Can you find an xy-equation that, when graphed, writes itself on the plane? This idea became internet-famous when a Wikipedia article on Tupper’s self-referential formula went viral in 2012. Under scrutiny, the question has two flaws: it is meaningless (it depends on fonts) and it is trivial. We fix these flaws by formalizing the problem.

Once upon a time, coherentism was the dominant response to the regress problem in epistemology, but in recent decades the view has fallen into disrepute: now almost everyone is a foundationalist (with a few infinitists sprinkled here and there). In this paper, I sketch a new way of thinking about coherentism, and show how it avoids many of the problems often thought fatal for the view, including the isolation objection, worries over circularity, and concerns that the concept of coherence is (...) too vague or metaphorical for serious theoretical use. The key to my approach is to take a familiar tool from discussions of the regress problem -- namely, directed graphs depicting the support relations between beliefs -- and to use that tool in a more sophisticated manner than it is standardly employed. (shrink)

Metaphysical graphical structuralism is the view that at some fundamental level the world is a mathematical graph of nodes and edges. Randall Dipert has advanced a graphical structuralist theory of fundamental particulars and Alexander Bird has advanced a graphical structuralist theory of fundamental properties. David Oderberg has posed a powerful challenge to graphical structuralism: that it entails the absurd inexistence of the world or the absurd cessation of all change. In this paper I defend graphical structuralism. A sharper formulation, (...) some theorems about such structures, and careful attention to the interaction of metaphysical and mathematical features, shows that the absurdities depend on assumptions that are not essential to the view and brings to light a surprising fact about the necessary structure of fundamental properties. (shrink)

Many results have been obtained on isolated graphs and complete graphs. In this paper, a necessary and sufficient condition will be proved for a single valued neutrosophic graph to be an isolated single valued neutrosophic graph.

From my ongoing "Metalogical Plato" project. The aim of the diagram is to make reasonably intuitive how the Socratic elenchos (the logic of refutation applied to candidate formulations of virtues or ruling knowledges) looks and works as a whole structure. This is my starting point in the project, in part because of its great familiarity and arguable claim to being the inauguration of western philosophy; getting this point less wrong would have broad and deep consequences, including for philosophy’s self-understanding. -/- (...) (i.) is the first pass at elenchos in which the Socratic interlocutor does not reflect on knowledge being the crux of the problem. (ii.) is the second, rarer, reflective pass in which they are, making the investigation explicitly about knowledge. Its centrality in the Charmides makes that neglected dialogue of superlative importance. This structure is also the gateway through which the discussion/dialectic crosses into the Agathology (discussion of the form of the good) at Republic 505. -/- The problem of elenchos, then, grasped as a whole structure, is that it seems that knowledge can neither satisfactorily be included in nor excluded from its own scope. The development of the ti esti (“what is ---?”) question leads to the introduction of knowledge into its own scope (i. implicitly, as goodness contrasted with blind rule-following ii. explicitly qua knowledge) while the development of the dual peri tinos (“----about what?) question leads to K’s elimination from its own scope. The introductions are motivated to avoid contradiction, but produce regress; the eliminations are motivated to avoid regress, but produce contradiction. In scholarship, and in the history of philosophy, the ti esti question is universally recognized, to the point of being identified with philosophy’s origin and essence; the peri tinos question is neglected textually and never recognized as the equal dual to the ti esti. This, I claim, has blocked the development of a nontrivial logical appreciation of what Plato's Socrates is up to. (One rather disastrous effect of this neglect is taking Aristotle as the beginning of the development of logic, rather than, correctly, for the beginning of logic’s fatal separation from mathematics and dialectic.) -/- Further, because of this monopticism of the ti esti, the function of consistency in the elenchos has not been understood, even with respect to the ti esti. The ti esti is actually in search of completeness, given a norm of consistency; the peri tinos is in search of consistency, given a norm of completeness. Only appreciating the two questions as dual allows space in the structure to clarify these different orientations relative to consistency. (And, dually, to completeness, whose function in the elenchos is generally entirely missed by scholars and relegated to discussions of eros; it's not out of place there, of course, but its significance is secured here.) Recognizing the duality of the ti esti and peri tinos questions is thus the royal road, in the Socratic-Platonic context, to catching sight of what we post-Cantorians can recognize as the metalogical duality of consistency and completeness. (The salutary disruptive effects of this Plato-Cantor proximity have, of course, been traced in complementary ways by Badiou.) -/- Note that the diagram is supposed to provide a relatively accessible orientation, not to stand on its own, and certainly not to be the last word on any subject. An important qualification (telegraphed in the previous paragraph) is that what elenchos shows is not finally circular or paradoxical, though the problem first presents as such (stubbornly, obdurately, as "difficult" Plato's Socrates always says with characteristic understatement). What is depicted here is meant, at a first pass, to be the shape of that first presentation, the form of the problem of elenchos, rather than of its solution. It's not an accident that this problem strongly resembles "Russell's paradox" (not Russell's not a paradox.) Problem is to solution as RP is to the diagonal theorems. (shrink)

In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

We provide here irrefutable facts that prove the falsehood of the claims published in [1] by Dehmer and Mowshowitz (DM) against our paper published in [2]. We first prove that Dehmer’s definition of node probability [3] is flawed. In addition, we show that it was not Dehmer in [3] who proposed this definition for the first time. We continue by proving how the use of Dehmer’s definition does not reveal all the physico-mathematical richness of the walk entropy of graphs. Finally, (...) we show a few facts about the failure of DM themselves to cite properly the relevant literature in their field. We also show here how the Editors of Complexity have failed to manage the publication of [1] in an appropriate way according to the accepted guidelines given in the Code of Conduct and Best Practice Guidelines for Journal Editors, published by the Committee on Publication Ethics (COPE). (shrink)

Charles Peirce's diagrammatic logic — the Existential Graphs — is presented as a tool for illuminating how we know necessity, in answer to Benacerraf's famous challenge that most ‘semantics for mathematics’ do not ‘fit an acceptable epistemology’. It is suggested that necessary reasoning is in essence a recognition that a certain structure has the particular structure that it has. This means that, contra Hume and his contemporary heirs, necessity is observable. One just needs to pay attention, not merely to individual (...) things but to how those things are related in larger structures, certain aspects of which relations force certain other aspects to be a certain way. (shrink)

In this research paper, the graph of the bipolar single-valued neutrosophic set model (BSVNS) is proposed. The graphs of single valued neutrosophic set models is generalized by this graph. For the BSVNS model, several results have been proved on complete and isolated graphs. Adding, an important and suitable condition for the graphs of the BSVNS model to become an isolated graph of the BSVNS model has been demonstrated.

In graph theory, the concept of domination is essential in a variety of domains. It has broad applications in diverse fields such as coding theory, computer net work models, and school bus routing and facility lo cation problems. If a fuzzy graph fails to obtain acceptable results, neutrosophic sets and neutrosophic graphs can be used to model uncertainty correlated with indeterminate and inconsistent information in arbitrary real-world scenario. In this study, we consider the concept of domination as it (...) relates to single-valued neutrosophic incidence graphs (SVNIGs). Given the importance of domination and its utilization in numerous fields, we propose the application of dominating sets in SVNIG with valid edges. We present some relevant definitions such as those of valid edges, cardinality, and isolated vertices in SVNIG along with some examples. Furthermore, we also show a few significant sets connected to the dominating set in an SVNIG such as independent and irredundant sets. We also investigate a relationship between the concepts of dominating sets and domination numbers as well as irredundant and independence sets in SVNIGs. Finally, a real-life deployment of domination in SVNIGsis investigated in relation to COVID-19 vaccination locations as a practical application. (shrink)

Neutrosophic theory has many applications in graph theory, bipolar single valued neutrosophic graphs (BSVNGs) is the generalization of fuzzy graphs and intuitionistic fuzzy graphs, SVNGs. In this paper we introduce some types of BSVNGs, such as subdivision BSVNGs, middle BSVNGs, total BSVNGs and bipolar single valued neutrosophic line graphs (BSVNLGs), also investigate the isomorphism, co weak isomorphism and weak isomorphism properties of subdivision BSVNGs, middle BSVNGs, total BSVNGs and BSVNLGs.

Community detection is a major issue in network analysis. This paper combines a socio-historical approach with an experimental reconstruction of programs to investigate the early automation of clique detection algorithms, which remains one of the unsolved NP-complete problems today. The research led by the archaeologist Jean-Claude Gardin from the 1950s on non-numerical information and graph analysis is retraced to demonstrate the early contributions of social sciences and humanities. The limited recognition and reception of Gardin's innovative computer application to the (...) humanities are addressed through two factors, in addition to the effects of historiography and bibliographies on the recording, discoverability, and reuse of scientific productions: (1) funding policies, evidenced by the transfer of research effort on graph applications from temporary interdisciplinary spaces to disciplinary organizations related to the then-emerging field of computer science; and (2) the erratic careers of algorithms, in which efficiency, flaws, corrections, and authors’ status, were determining factors. (shrink)

Many collective decision making problems have a combinatorial structure: the agents involved must decide on multiple issues and their preferences over one issue may depend on the choices adopted for some of the others. Voting is an attractive method for making collective decisions, but conducting a multi-issue election is challenging. On the one hand, requiring agents to vote by expressing their preferences over all combinations of issues is computationally infeasible; on the other, decomposing the problem into several elections on smaller (...) sets of issues can lead to paradoxical outcomes. Any pragmatic method for running a multi-issue election will have to balance these two concerns. We identify and analyse the problem of generating an agenda for a given election, specifying which issues to vote on together in local elections and in which order to schedule those local elections. (shrink)

We recall and improve our 2019 and 2020 concepts of n-SuperHyperGraph, Plithogenic nSuperHyperGraph, n-Power Set of a Set, and we present some application from the real world. The nSuperHyperGraph is the most general form of graph today and it is able to describe the complex reality we live in, by using n-SuperVertices (groups of groups of groups etc.) and nSuperHyperEdges (edges connecting groups of groups of groups etc.).

I examine to what extent accounts of mechanisms based on formal interventionist theories of causality can adequately represent biological mechanisms with complex dynamics. Using a differential equation model for a circadian clock mechanism as an example, I first show that there exists an iterative solution that can be interpreted as a structural causal model. Thus, in principle, it is possible to integrate causal difference-making information with dynamical information. However, the differential equation model itself lacks the right modularity properties for a (...) full integration. A formal mechanistic model will therefore have to leave out either noncausal or causal explanatory relations. (shrink)

A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph <D> induced by D is connected. A connected domination number of G, denoted by γ_c(G), is the minimum cardinality of a connected dominating set D. The triple repetition sequence (...) denoted by {S_n:n ϵ Z+} is a sequence of positive integers which is repeated thrice, i.e., {S_n}={1,1,1,2,2,2,3,3,3, ...}. In this paper, we construct a combinatorial explicit formula for the triple repetition sequence of connected domination numbers of a triangular grid graph. (shrink)

We analyze a solitaire game in which a demon rearranges some cards after each move. The graph edge coloring theorems of K˝onig (1931) and Vizing (1964) follow from the winning strategies developed.

This paper presents an analysis of Seneca's 58th letter to Lucilius and Porphyry's Isagoge, which were the origin of the tree diagrams that became popular in philosophy and logic from the early Middle Ages onwards. These diagrams visualise the extent to which a concept can be understood as a category, genus, species or individual and what the method of dihairesis (division) means. The paper explores the dissimilarities between Seneca's and Porphyry's tree structures, scrutinising them through the perspective of modern (...) class='Hi'>graph theory. Although traditional trees can be interpreted in a modern way, their terms and definitions defy modern standardisation. These distinctions are not only useful for differentiating between Seneca's and Porphyry's trees, but also for comprehending the evolution of this philosophical tradition. Thus the paper highlights the continued significance of these tree diagrams in analysing concepts and categories in philosophy and structuring objects and information in modern fields such as artificial intelligence, computer science, bioinformatics, graph theory, and many more. (shrink)

This paper will be concerned with hard choices—that is, choice situations where an agent cannot make a rationally justified choice. Specifically, this paper asks: if an agent cannot optimize in a given situation, are they facing a hard choice? A pair of claims are defended in light of this question. First, situations where an agent cannot optimize because of incompleteness of the binary preference or value relation constitute a hard choice. Second, situations where agents cannot optimize because the binary preference (...) or value relation violates acyclicity do not constitute a hard choice. (shrink)

In this article, we first provide a modified definition of SuperHyperGraphs (SHG) and we call it Restricted SuperHyperGraphs (R-SHG). We then generalize the R-SHG to the neutrosophic graphs and then define the corresponding trees. In the following, we examine the Helly property for subtrees of SuperHyperGraphs.

The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality -- these are the so-called "dangerous" directed graphs. Building on Rabern, et. al (2013) we reformulate this problem in terms of fixed points of certain functions, thereby boiling it down to get (...) a purely mathematical problem. (shrink)

Necessity is a touchstone issue in the thought of Charles Peirce, not least because his pragmatist account of meaning relies upon modal terms. We here offer an overview of Peirce’s highly original and multi-faceted take on the matter. We begin by considering how a self-avowed pragmatist and fallibilist can even talk about necessary truth. We then outline the source of Peirce’s theory of representation in his three categories of Firstness, Secondness and Thirdness, (monadic, dyadic and triadic relations). These have modal (...) purport insofar as the first category corresponds to possibility, the second to mechanical necessity and the third to a kind of semantic or intentional necessity. We then turn to Peirce’s explicit modal epistemology and show how it began as information-relative, with different modalities (e.g. logical, physical, practical) distinguished in terms of respective ‘designated states of information’, and shifted later in his life towards a more robust realism founded in direct perception of ideas in their relations. We then turn to Peirce’s formal logic, focusing on his diagrammatic system of Existential Graphs where he did his most serious logical research. Finally we discuss Peirce’s modal metaphysics and its implications for determinism and realism about universals. (shrink)

Mind, according to cognitive neuroscience, is a set of brain functions. But, unlike sets, our minds are cohesive. Moreover, unlike the structureless elements of sets, the contents of our minds are structured. Mutual relations between the mental contents endow the mind its structure. Here we characterize the structural essence and the logical form of the mind by focusing on thinking. Examination of the relations between concepts, propositions, and syllogisms involved in thinking revealed the reflexive graph structure of the conceptual (...) mind. Objective logic of the conceptual mind is calculated from its structure. Noteworthy features of the logic of conceptual mind are: degrees of truth, varieties of negation, admission of contradiction, and the failure of a de Morgan's law. Furthermore, cohesion of the conceptual mind follows from its reflexive graph structure. Our characterization of the structure and logic of mind constitutes a substantial refinement of the contemporary cognitive neuroscientific conceptualization of the mind as a set. (shrink)

In this ninth book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, – in email messages to research colleagues, or replies, and personal notes, some handwritten on the planes to, and from international conferences, about topics on Neutrosophy and its applications, such as: Neutrosophic Bipolar Set, Linguistic Neutrosophic Set, Neutrosophic Resonance Frequency, n-ary HyperAlgebra, n-ary NeutroHyperAlgebra, n-ary AntiHyperAlgebra, Plithogenic Crisp Graph, Plithogenic Fuzzy Graph, Plithogenic Intuitionistic Fuzzy Graph, Plithogenic (...) Neutrosophic Graph, Plithogenic Real Number Graph, Plithogenic Complex Number Graph, Plithogenic Neutrosophic Number Graph, and many more. -/- Exchanging ideas with: Tareq Al-Shami, Riad Khidr Al-hamido, Mohammad Akram, B. De Baets, Robert Neil Boyd, Said Broumi, Terman Frometa-Castillo, Yilmaz Ceven, D. Dubois, Harish Garg, L. Godo, Erik Gonzalez, Yanhui Guo, Mohammad Hamidi, E. Hüllermeier, W. B. Vasantha Kandasamy, Mary Jansi, Nivetha Martin, Mani Parimala, Akbar Rezaei, Bouzina Salah, Christy Vincent, Jun Ye.‬‬‬. (shrink)

The graph tong同and its associated concepts, such as da-tong (Great tong大同) and xuan-tong (mystic or dark tong玄同), have played important roles in the development of Chinese philosophy. Yet tong has received scant attention from either western or eastern scholarships. This paper is a first attempt to remedy such regret. Unlike usual understandings of tong as sameness or unity, this paper presents a nuanced account from early China, that is, ‘difference to one,’ a definition from the Mozi墨子. This definition can (...) be supported from etymological, textual, and lexical evidence. ‘Difference to one’ should not be solely attributed to a Mohist understanding; it in fact represents a common understanding of tong across philosophical streams in early China. This nuanced account provides new insights into the concept of tong in early philosophical texts, and furthermore breaks solid grounds for further studies of tong and its associated concepts. (shrink)

Special issue in honour of Landon Rabern. This special issue of Discrete Mathematics is dedicated to his memory, as a tribute to his many research achievements. It contains 10 new articles written by his collaborators, friends, and colleagues that showcase his interests.

Should you be willing to forego any sure good for a tiny probability of a vastly greater good? Fanatics say you should, anti-fanatics say you should not. Anti-fanaticism has great intuitive appeal. But, I argue, these intuitions are untenable, because satisfying them in their full generality is incompatible with three very plausible principles: acyclicity, a minimal dominance principle, and the principle that any outcome can be made better or worse. This argument against anti-fanaticism can be turned into a positive argument (...) for a weak version of fanaticism, but only from significantly more contentious premises. In combination, these facts suggest that those who find fanaticism counterintuitive should favor not anti-fanaticism, but an intermediate position that permits agents to have incomplete preferences that are neither fanatical nor anti-fanatical. (shrink)

In solving judgment aggregation problems, groups often face constraints. Many decision problems can be modelled in terms the acceptance or rejection of certain propositions in a language, and constraints as propositions that the decisions should be consistent with. For example, court judgments in breach-of-contract cases should be consistent with the constraint that action and obligation are necessary and sufficient for liability; judgments on how to rank several options in an order of preference with the constraint of transitivity; and judgments on (...) budget items with budgetary constraints. Often more or less demanding constraints on decisions are imaginable. For instance, in preference ranking problems, the transitivity constraint is often contrasted with the weaker acyclicity constraint. In this paper, we make constraints explicit in judgment aggregation by relativizing the rationality conditions of consistency and deductive closure to a constraint set, whose variation yields more or less strong notions of rationality. We review several general results on judgment aggregation in light of such constraints. (shrink)

A biologically unavoidable sequence is an infinite gender sequence which occurs in every gendered, infinite genealogical network satisfying certain tame conditions. We show that every eventually periodic sequence is biologically unavoidable (this generalizes König's Lemma), and we exhibit some biologically avoidable sequences. Finally we give an application of unavoidable sequences to cellular automata.

In “The Irrelevance of the Diachronic Money-Pump Argument for Acyclicity,” The Journal of Philosophy CX, 8 (August 2013), 460-464, Johan E. Gustafsson contends that if Davidson, McKinsey and Suppes’ diachronic money-pump argument in their "Outlines of a Formal Theory of Value, I," Philosophy of Science 22 (1955), 140-160 is valid, so is the synchronic argument Gustafsson himself offers. He concludes that the latter renders irrelevant diachronic choice considerations in general, and the two best-known diachronic solutions to the money pump problem (...) in particular. I argue here that this reasoning is incorrect, and that Gustafsson’s synchronic argument is faulty on independent grounds. Specifically, it is based on a false analogy between the derivation of a synchronic ordinal ranking from a transitive series of pairwise comparisons, and the putative derivation of such a ranking from an intransitive series. The latter is not possible under the assumption of revealed preference theory, and is highly improbable even if that assumption is rejected. Moreover, Gustafsson’s argument raises issues of fidelity to the historical texts that must be addressed. I conclude that the money pump, and cyclical choice more generally, are necessarily diachronic; and therefore that the two best-known diachronic solutions to the money pump problem remain relevant. (shrink)

This paper will be concerned with hard choices—that is, choice situations where an agent cannot make a rationally justified choice. Specifically, this paper asks: if an agent cannot optimize in a given situation, are they facing a hard choice? A pair of claims are defended in light of this question. First, situations where an agent cannot optimize because of incompleteness of the binary preference or value relation constitute a hard choice. Second, situations where agents cannot optimize because the binary preference (...) or value relation violates acyclicity do not constitute a hard choice. (shrink)

The difference principle, introduced by Rawls (1971, 1993), is generally interpreted as leximin, but this is not how he intended it. Rawls explicitly states that the difference principle requires that aggregate benefits (e.g., average or total) to those in the least advantaged group be given lexical priority over benefits to others, where the least advantaged group includes more than the strictly worst off individuals. We study the implications of adopting different approaches to the definition of the least advantaged group and (...) show that, if acyclicity is required, several seemingly plausible approaches lead to something close to leximin. We then show that significant aggregation is possible, if the least advantaged group is defined as those with those with less benefits than some strictly positive transform of the lowest level of benefits. Finally, we discuss the implications of requiring that, in comparing two alternatives, the cutoff for the least advantaged group of one alternative be the same as that for the other alternative. (shrink)

Suppose that you prefer A to B, B to C, and C to A. Your preferences violate Expected Utility Theory by being cyclic. Money-pump arguments offer a way to show that such violations are irrational. Suppose that you start with A. Then you should be willing to trade A for C and then C for B. But then, once you have B, you are offered a trade back to A for a small cost. Since you prefer A to B, you (...) pay the small sum to trade from B to A. But now you have been turned into a money pump. You are back to the alternative you started with but with less money. This Element shows how each of the axioms of Expected Utility Theory can be defended by money-pump arguments of this kind. The Element also defends money-pump arguments from the standard objections to this kind of approach. This title is also available as Open Access on Cambridge Core. (shrink)