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.

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)

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)

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

Abstract: In developing societies, foreign direct investment is an invaluable tool for achieving economic growth by enhancing competitiveness through offering employment, transferring sophisticated technologies, boosting productivity and promoting infrastructure. The main objective of the paper is to examine the trends of foreign direct investment and economic growth in Africa, with specific reference to Nigeria’s experience in pre-recession period. The paper notes that foreign direct investment provides capital for investment, it enhances job creation and managerial skills, and possibly technology transfer. The (...) paper observe that prior to the economic recession, Nigeria experienced continued increased in foreign direct investment. The study is an empirical investigation, using a time series data between 1999-2014. The data collected was analyzed using table of frequency distribution, bar chart, graph and correlation analysis. The analysis shows that there is a high positive correlation relationship between FDI and economic growth in Nigeria during the period under study. Based on the results and findings, the paper recommend among others that for Nigeria to optimize the potential benefits of FDI, it is important that the government exercise fiscal discipline and control measures in its pattern of borrowing and spending. (shrink)

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)

This paper examines some of the methods animals and humans have of adapting their environment. Because there are limits on how many different tasks a creature can be designed to do well in, creatures with the capacity to redesign their environments have an adaptive advantage over those who can only passively adapt to existing environmental structures. To clarify environmental redesign I rely on the formal notion of a task environment as a directed graph where the nodes are states (...) and the links are actions. One natural form of redesign is to change the topology of this graph structure so as to increase the likelihood of task success or to reduce its expected cost, measured in physical terms. This may be done by eliminating initial states hence eliminating choice points; by changing the action repertoire; by changing the consequence function; and lastly, by adding choice points. Another major method for adapting the environment is to change its cognitive congeniality. Such changes leave the state space formally intact but reduce the number and cost of mental operations needed for task success; they reliably increase the speed, accuracy or robustness of performance. The last section of the paper describes several of these epistemic or complementary actions found in human performance. (shrink)

We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.

In the last several decades, a confluence of work in the social sciences, philosophy, statistics, and computer science has developed a theory of causal inference using directed graphs. This theory typically rests either explicitly or implicitly on two major assumptions.

The second volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents a deep exploration of the progress in uncertain combinatorics through innovative methodologies like graphization, hyperization, and uncertainization. This volume integrates foundational concepts from fuzzy, neutrosophic, soft, and rough set theory, among others, to further advance the field. Combinatorics and set theory, two central pillars of mathematics, focus on counting, arrangement, and the study of collections under defined rules. Combinatorics excels in handling (...) uncertainty, while set theory has evolved with concepts such as fuzzy and neutrosophic sets, which enable the modeling of complex real-world uncertainties by addressing truth, indeterminacy, and falsehood. These advancements, when combined with graph theory, give rise to novel forms of uncertain sets in "graphized" structures, including hypergraphs and superhypergraphs. Innovations such as Neutrosophic Oversets, Undersets, and Offsets, as well as the Nonstandard Real Set, build upon traditional graph concepts, pushing both theoretical and practical boundaries. The synthesis of combinatorics, set theory, and graph theory in this volume provides a robust framework for addressing the complexities and uncertainties inherent in both mathematical and real-world systems, paving the way for future research and application. In the first chapter, “A Review of the Hierarchy of Plithogenic, Neutrosophic, and Fuzzy Graphs: Survey and Applications”, the authors investigate the interrelationships among various graph classes, including Plithogenic graphs, and explore other related structures. Graph theory, a fundamental branch of mathematics, focuses on networks of nodes and edges, studying their paths, structures, and properties. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, representing the level of uncertainty. The Turiyam Neutrosophic Graph is introduced as an extension of both Neutrosophic and Fuzzy Graphs, while Plithogenic graphs offer a potent method for managing uncertainty. The second chapter, “Review of Some Superhypergraph Classes: Directed, Bidirected, Soft, and Rough”, examines advanced graph structures such as directed superhypergraphs, bidirected hypergraphs, soft superhypergraphs, and rough superhypergraphs. Classical graph classes include undirected graphs, where edges lack orientation, and directed graphs, where edges have specific directions. Recent innovations, including bidirected graphs, have sparked ongoing research and significant advancements in the field. Soft Sets and their extension to Soft Graphs provide a flexible framework for managing uncertainty, while Rough Sets and Rough Graphs address uncertainty by using lower and upper approximations to handle imprecise data. Hypergraphs generalize traditional graphs by allowing edges, or hyperedges, to connect more than two vertices. Superhypergraphs further extend this by allowing both vertices and edges to represent subsets, facilitating the modeling of hierarchical and group-based relationships. The third chapter, “Survey of Intersection Graphs, Fuzzy Graphs, and Neutrosophic Graphs”, explores the intersection graph models within the realms of Fuzzy Graphs, Intuitionistic Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. The chapter highlights their mathematical properties and interrelationships, reflecting the growing number of graph classes being developed in these areas. Intersection graphs, such as Unit Square Graphs, Circle Graphs, and Ray Intersection Graphs, are crucial for understanding complex graph structures in uncertain environments. The fourth chapter, “Fundamental Computational Problems and Algorithms for SuperHyperGraphs”, addresses optimization problems within the SuperHypergraph framework, such as the SuperHypergraph Partition Problem, Reachability, and Minimum Spanning SuperHypertree. The chapter also adapts classical problems like the Traveling Salesman Problem and the Chinese Postman Problem to the SuperHypergraph context, exploring how hypergraphs, which allow hyperedges to connect more than two vertices, can be used to solve complex hierarchical and relational problems. The fifth chapter, “A Short Note on the Basic Graph Construction Algorithm for Plithogenic Graphs”, delves into algorithms designed for Plithogenic Graphs and Intuitionistic Plithogenic Graphs, analyzing their complexity and validity. Plithogenic Graphs model multi-valued attributes by incorporating membership and contradiction functions, offering a nuanced representation of complex relationships. The sixth chapter, “Short Note of Bunch Graph in Fuzzy, Neutrosophic, and Plithogenic Graphs”, generalizes traditional graph theory by representing nodes as groups (bunches) rather than individual entities. This approach enables the modeling of both competition and collaboration within a network. The chapter explores various uncertain models of bunch graphs, including Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. In the seventh chapter, “A Reconsideration of Advanced Concepts in Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, and Chemical Graphs”, the authors extend several fuzzy graph classes to Neutrosophic graphs and analyze their properties. Neutrosophic Graphs, a generalization of fuzzy graphs, incorporate degrees of truth, indeterminacy, and falsity to model uncertainty more effectively. The eighth chapter, “Short Note of Even-Hole-Graph for Uncertain Graph”, focuses on Even-Hole-Free and Meyniel Graphs analyzed within the frameworks of Fuzzy, Neutrosophic, Turiyam Neutrosophic, and Plithogenic Graphs. The study investigates the structure of these graphs, with an emphasis on their implications for uncertainty modeling. The ninth chapter, “Survey of Planar and Outerplanar Graphs in Fuzzy and Neutrosophic Graphs”, explores planar and outerplanar graphs, as well as apex graphs, within the contexts of fuzzy, neutrosophic, Turiyam Neutrosophic, and plithogenic graphs. The chapter examines how these types of graphs are used to model uncertain parameters and relationships in mathematical and real-world systems. The tenth chapter, “General Plithogenic Soft Rough Graphs and Some Related Graph Classes”, introduces and explores new concepts such as Turiyam Neutrosophic Soft Graphs and General Plithogenic Soft Graphs. The chapter also examines models of uncertain graphs, including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Graphs, all designed to handle uncertainty in diverse contexts. The eleventh chapter, “Survey of Trees, Forests, and Paths in Fuzzy and Neutrosophic Graphs”, provides a comprehensive study of Trees, Forests, and Paths within the framework of Fuzzy and Neutrosophic Graphs. This chapter focuses on classifying and analyzing graph structures like trees and paths in uncertain environments, contributing to the ongoing development of graph theory in the context of uncertainty. (shrink)

Shared conceptualization, in the sense we take it here, is as recent a notion as the Semantic Web, but its relevance for a large variety of fields requires efficient methods of extraction and representation for both quantitative and qualitative data. This notion is particularly relevant for the investigation into, and construction of, semantic structures such as knowledge bases and taxonomies, but given the required large, often inaccurate, corpora available for search we can get only approximations. We see fuzzy description logic (...) as an adequate medium for the representation of human semantic knowledge and propose a means to couple it with fuzzy semantic networks via the propositional Łukasiewicz fuzzy logic such that these suffice for decidability for queries over a semantic-knowledge base such as “to what degree of sharedness does it entail the instantiation C(a) for some concept C” or “what are the roles R that connect the individuals a and b to degree of sharedness ε.” . (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)

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.

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)

Charles Peirce famously divided all signs into icons, indices and symbols. As recent decades have seen mainstream analytic philosophy of language broaden its traditional focus on symbols to recognise the "essential indexical", can the moral be extended to icons? Is there an “essential icon”? If so, what exactly would be "essential" about it? I argue that essential iconicity does exist, and a prime example is logical form, insofar as it cannot be discursively described, only 'shown'. Danielle Macbeth’s radical new “expressivist” (...) interpretation of Frege’s logic and Charles Peirce’s existential graphs are mobilized in support of this claim, which offers an original new direction to the foundations of logic. (shrink)

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.

Bioinformatics scientists often describe their own scientific activities as the practice of working with large amounts of data using computing devices. An essential part of their self-identification is also the development of ways to visually represent the results of this work. Some of these methods are aimed at building convenient representations of data and demonstrating patterns present in them (graphics, diagrams, graphs). Others are ways of visualizing objects that are not directly accessible to human perception (microphotography, X-ray). Both the construction (...) of visualizations and (especially) the creation of new computer visualization methods are considered in bioinformatics as significant scientific achievements. Representations of the three-dimensional structure of protein molecules play a special role in the inquiries of bioinformatics scientists. 3D-visualization of a macromolecule, on the one hand, is, like a graph, a representation of the results of computer processing of data arrays obtained by material methods – spatiotemporal coordinates of structural elements of the molecule. On the other hand, like microphotography, these 3D structures should serve as accurate representations of specific scientific objects. This leads to the parallel existence of two contradictory epistemic regimes: creative arbitrariness in making convenient, communicatively successful models, is combined with commitment to the object “as it really is”. The paradox is reinforced by the fact that the scientific study of objects in question (determining the properties of the structure, its functions, comparison with other structures) by means of computers does not require visualization at all. Its obviously high value for bioinformatics does not look justified if we take into account the prominent artificiality and artistry of the resulting images. However, the status of these images becomes clearer if we relate them to earlier notions of the role of the visual in scientific discovery. The highest estimation of visualization as the final result of scientific research was characteristic of Renaissance science. The artistic representation of ideal essential properties, instead of a strict correspondence to a particular biological object, is an epistemic virtue typical of the naturalists of the 17th and 18th centuries. Both suggested a close collaboration between the scientist and the artist; and standards for visualizing macromolecules in bioinformatics grow out of a similar collaboration (Geis’ drawings). The desire for maximum accuracy and detail inherits the regulation of “mechanical objectivity” (as Daston and Galison put it into words), for which it is also important to eliminate humans from the image production process (in bioinformatics, to transfer these functions to computer programs). Thus, 3D-visualization of protein structures bears traces of historically different value orientations, but the scientific practice of the 20th and 21st centuries, supplemented by computer technologies, allows them to be intertwined in particular disciplinary units. (shrink)

The article reveals the characteristics of entrepreneurship development in the conditions of modern challenges. The aim of the research is to analyze the prospects of entrepreneurship development in both global and national dimensions. A critical analysis of the content of scientific literature of modern scientists, whose works are dedicated to the study of the peculiarities of entrepreneurship development in the conditions of modern challenges, indicates the insufficiency of their study in the period of the Covid-19 pandemic and the escalation of (...) Russia's war against Ukraine. The relevance of the researched topic is determined by the importance of studying the trends in entrepreneurship development and the factors that determine its prospects in both global and national dimensions. The methodological basis of the research is a set of the following methods aimed at solving the respective tasks: analysis and grouping – for the distribution of the countries worldwide based on directions of entrepreneurship development management, according to the level of GDP per capita; survey – for the distribution of countries worldwide based on the opportunities for starting own business in the next 6 months, level of entrepreneurial activity at the early stages of business establishment, consideration of social consequences by entrepreneurs, and familiarity of entrepreneurs with the goals of sustainable development; methods of analysis, tabular and relative differences methods – for determining the state of entrepreneurship in Ukraine; cartographic and graph-analytical – for determining prospective business expectations in Ukraine in 2023; generalization and analytical methods ‒ for summarizing conclusions and recommendations regarding the obtained research data. The scientific novelty of the research results is a scientific-methodical approach. The application of the approach allows obtaining a set of conclusions regarding the prospects of the further development of entrepreneurship in global and national dimensions. These findings can serve as a basis for developing further recommendations to stimulate its development. The obtained research results can be valuable for entrepreneurial structures and government organizations that pursue their own objectives in assessing the prospects of entrepreneurial activities in the conditions of modern challenges. (shrink)

A new strategy for moving forward in the characterization of the Global Neuronal Workspace (GNW) is proposed. According to Dehaene, Changeux and colleagues, broadcasting is the main function of the GNW. However, the dynamic network properties described by recent graph-theoretic GNW models are consistent with many large-scale communication processes that are different from broadcasting. We propose to apply a different graph-theoretic approach, originally developed for optimizing information dissemination in communication networks, which can be used to identify the pattern (...) of frequency and phase-specific directed functional connections that the GNW would exhibit only if it were a broadcasting network. (shrink)

The article analyzes and presents the results of international experience of integration development in the field of tourism and hospitality, modern and efficient methods of integration in the field of tourism. The effective ways of realization of integration development programs at tourist enterprises and hotel chains are determined. The main objectives of integration processes in the field of tourism are also defined. The analysis of the most famous multinational tour operators and the largest hotel chains in the world in the (...) form of a table and graph is shown. The processes that take place at the expense of integration processes in the tourism business are analyzed and identified. A promising direction for further research is the economic feasibility of the feasibility of international integration in the tourism sector and ways to improve the strategies of integration management. (shrink)

The third volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents an in-depth exploration of the cutting-edge developments in uncertain combinatorics and set theory. This comprehensive collection highlights innovative methodologies such as graphization, hyperization, and uncertainization, which enhance combinatorics by incorporating foundational concepts from fuzzy, neutrosophic, soft, and rough set theories. These advancements open new mathematical horizons, offering novel approaches to managing uncertainty within complex systems. Combinatorics, a discipline focused on counting, arrangement, (...) and structure, often faces challenges when uncertainty is present. Set theory, which underpins combinatorial problems, has evolved to tackle these challenges. The introduction of fuzzy and neutrosophic sets has expanded the toolkit for modeling uncertainty by incorporating elements of truth, indeterminacy, and falsehood into decision-making processes. These innovations seamlessly intersect with graph theory, providing new ways to represent uncertain structures through "graphized" forms such as hypergraphs and superhypergraphs. This volume also introduces advanced concepts like Neutrosophic Oversets, Undersets, and Offsets, which push the boundaries of classical graph theory and offer deeper insights into the mathematical and practical challenges posed by real-world systems. By blending combinatorics, set theory, and graph theory, the authors have created a robust framework for addressing uncertainty in both mathematical systems and their real-world applications. This foundation sets the stage for future breakthroughs in combinatorics, set theory, and related fields. Each chapter in this volume contributes both theoretical foundations and practical applications, demonstrating the power of integrating graph theory, set theory, and uncertainty models. The new ideas, algorithms, and mathematical tools presented here will drive the future of combinatorial research and its applications in uncertain environments. In the first chapter, “Introduction to Upside-Down Logic: Its Deep Relation to Neutrosophic Logic and Applications”, the authors present Upside-Down Logic, a novel logical framework that systematically transforms truths into falsehoods and vice versa, based on contextual shifts. Introduced by F. Smarandache, this paper provides a mathematical definition of Upside-Down Logic, including applications related to the Japanese language. The chapter also introduces Contextual Upside-Down Logic, an extension that adjusts logical connectives alongside flipped truth values, as well as Indeterm-Upside-Down Logic and Certain Upside-Down Logic to address indeterminacy. A simple algorithm is also proposed to demonstrate the computational aspects of this logic. In the second chapter, “Local-Neutrosophic Logic and Local-Neutrosophic Sets: Incorporating Locality with Applications”, the authors introduce Local-Neutrosophic Logic and Local-Neutrosophic Sets, which integrate the concept of locality into Neutrosophic Logic. By defining locality as the influence of immediate surroundings on an object or system, this chapter explores how it affects indeterminacy in real-world problems. The paper also examines potential applications and provides mathematical definitions for these new concepts. The third chapter, “A Review of Fuzzy and Neutrosophic Offsets: Connections to Some Set Concepts and Normalization Function”, extends the concept of offsets in uncertain set-theoretic frameworks, such as Fuzzy Sets, Neutrosophic Sets, and Plithogenic Sets. This chapter introduces several advanced types of offsets, including Nonstationary Fuzzy Offset, Multi-valued Plithogenic Offset, and Subset-valued Neutrosophic Offset, offering deeper insights into handling uncertainty in mathematical models. In the fourth chapter, “Review of Plithogenic Directed, Mixed, Bidirected, and Pangene OffGraph”, the authors build upon Plithogenic Graphs to propose extensions such as Plithogenic Directed OffGraph, Plithogenic BiDirected OffGraph, and Plithogenic Mixed OffGraph. These new concepts, including the Plithogenic Pangene OffGraph, are explored in detail, with a focus on their mathematical properties and potential applications in uncertain graph theory. The fifth chapter, “Short Note on Neutrosophic Closure Matroids”, explores the extension of matroid concepts into Neutrosophic and Turiyam Neutrosophic set theories, introducing Neutrosophic closure matroids. This concept integrates uncertainty, indeterminacy, and liberal states into matroid theory, enhancing its applicability in optimization and combinatorial problems. In the sixth chapter, “Some Graph Parameters for Superhypertree-width and Neutrosophic Tree-width”, the authors discuss graph parameters such as Superhypertree-width and Neutrosophic tree-width. These parameters play a crucial role in the study of graph characteristics, particularly in algorithms and real-world applications. The chapter explores the generalization of hypergraphs to SuperHyperGraphs and examines how these concepts extend tree-width parameters within the context of Neutrosophic logic. (shrink)

The article analyzes and presents the results of international experience of integration development in the field of tourism and hospitality, modern and efficient methods of integration in the field of tourism. The effective ways of realization of integration development programs at tourist enterprises and hotel chains are determined. The main objectives of integration processes in the field of tourism are also defined. The analysis of the most famous multinational tour operators and the largest hotel chains in the world in the (...) form of a table and graph is shown. The processes that take place at the expense of integration processes in the tourism business are analyzed and identified. A promising direction for further research is the economic feasibility of the feasibility of international integration in the tourism sec. (shrink)

Simple regression (regression analysis with a single explanatory variable), and multiple regression (regression models with multiple explanatory variables), typically correspond to very different biological questions. The former use regression lines to describe univariate associations. The latter describe the partial, or direct, effects of multiple variables, conditioned on one another. We suspect that the superficial similarity of simple and multiple regression leads to confusion in their interpretation. A clear understanding of these methods is essential, as they underlie a large range of (...) procedures in common use in biology. Beyond simple and multiple regression in their most basic forms, understanding the key principles of these procedures is critical to understanding, and properly applying, many methods, such as mixed models, generalised models, and causal inference using graphs (including path analysis and its extensions). A simple, but careful, look at the distinction between these two analyses is valuable in its own right, and can also be used to clarify widely-held misconceptions about collinearity (correlations among explanatory variables). There is no general sense in which collinearity is a problem. We suspect that the perception of collinearity as a hindrance to analysis stems from misconceptions about interpretation of multiple regression models, and so we pursue discussions about these misconceptions in this light. In particular, collinearity causes multiple regression coefficients to be less precisely estimated than corresponding simple regression coefficients. This should not be interpreted as a problem, as it is perfectly natural that direct effects should be harder to characterise than univariate associations. Purported solutions to the perceived problems of collinearity are detrimental to most biological analyses. (shrink)

Conceptual models as representations of real-world systems are based on diverse techniques in various disciplines but lack a framework that provides multidisciplinary ontological understanding of real-world phenomena. Concurrently, systems’ complexity has intensified, leading to a rise in developing models using different formalisms and diverse representations even within a single domain. Conceptual models have become larger; languages tend to acquire more features, and it is not unusual to use different modeling languages for different components. This diversity has caused problems with consistency (...) between models and incompatibly with designed systems. Two main solutions have been adopted over the last few years: (1) A currently dominant technology-based solution tries “to harmonize or unify” models, e.g., unifies EER and UML. This solution would solidify modeling achievements, reaping benefits from huge investments over the last thirty years. (2) A less prevalent solution is to pursuit deeper roots that reveal unifying modeling principles and apparatuses. An example of the second method is a “category theory”-based approach that utilizes the strengths of the graph and set theory, along with other topological tools. This manuscript is a sequel in a research venture that belongs to the second approach and uses a model called thinging machines (TMs) founded on Stoic ontology and Lupascian logic. TM modeling contests the thesis that there is no universal approach that covers all aspects of an application, and the paper demonstrates that pursuing such universality is anything but a dead-end method. This paper continues in this direction, with emphasis on TM foundation (e.g., existence and subsistence of things) and exemplifies this pursuit by proposing an alternative representation of set theory. (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)

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)

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)

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)

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)

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)

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.

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.

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)

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.

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)

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.

The direct social perception thesis claims that we can directly perceive some mental states of other people. The direct perception of mental states has been formulated phenomenologically and psychologically, and typically restricted to the mental state types of intentions and emotions. I will compare DSP to another account of mindreading: dual process accounts that posit a fast, automatic “Type 1” form of mindreading and a slow, effortful “Type 2” form. I will here analyze whether dual process accounts’ Type 1 mindreading (...) serves as a rival to DSP or whether some Type 1 mindreading can be perceptual. I will focus on Apperly and Butterfill’s dual process account of mindreading epistemic states such as perception, knowledge, and belief. This account posits a minimal form of Type 1 mindreading of belief-like states called registrations. I will argue that general dual process theories fit well with a modular view of perception that is considered a kind of Type 1 process. I will show that this modular view of perception challenges and has significant advantages over DSP’s phenomenological and psychological theses. Finally, I will argue that if such a modular view of perception is accepted, there is significant reason for thinking Type 1 mindreading of belief-like states is perceptual in nature. This would mean extending the scope of DSP to at least one type of epistemic state. (shrink)

The authors argue against direction of fit accounts of the distinction between belief and desire.

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)

Modern physics has provided a range of motivations for holding time to be fundamentally undirected. But how does a temporally adirectional metaphysics, or ‘C-theory’ of time, fit with the time of experience? In this chapter, I look at what kind of problem human time poses for C-theories. First, I ask whether there is a ‘hard problem’ of human time: whether it is in principle impossible to have the kinds of experience we do in a temporally adirectional world. Second I consider (...) the ‘easy problem’: how specific directed aspects of our temporal experience are to be explained by C-theorists. This leads to a greater issue: is there such a thing as an experience of time direction at all to even be explained? I show how the kinds of experience we have that we typically associate with the idea of time being directed can be accommodated within a directionless picture of time. (shrink)

I argue that the concept of direction of fit is best seen as picking out a certain inferential property of a psychological attitude. The property in question is one that believing shares with assuming and fantasizing and fails to share with desire. Unfortunately, the standard analysis of DOF obscures this fact because it conflates two very different properties of an attitude: that in virtue of which it displays a certain DOF, and that in virtue of which it displays certain revision (...) conditions. I claim that the latter corresponds with the aim of an attitude, not its DOF. In order to remedy this failure of the standard analysis, I offer an alternative account of DOF, which I refer to as the two-content analysis. (shrink)

In the past couple of decades, there were a few major attempts to establish the thesis of pragmatic infringement – that a significant pragmatic ingredient figures significantly in the truth-conditions for knowledge-ascriptions. As candidates, epistemic contextualism and Relativism flaunted conversational standards, and Stanley's SSI promoted stakes. These conceptions were propelled first and foremost by obviously pragmatic examples of knowledge ascriptions that seem to require a pragmatic component in the truth-conditions of knowledge ascriptions in order to be accounted for. However, if (...) such examples can be adequately explained purely pragmatically, the need that such examples seem to invoke in such a pragmatic component is undermined. Here I lay out a new pragmatic account – of action-directed pragmatics, offering a different account of such examples and their pragmatic flavor. If adequate, it obviates the above need for pragmatic enrichment. Specifically, I develop and I argue for a well-entrenched pragmatic feature – that of a steering role. The assertions of knowledge ascriptions and their denials as well as of simple assertions (that don't invoke knowledge) play a pragmatic role of steering audiences in joint deliberational setups toward, or away from, the speaker's preferred action (as well as in assertions of 'I am sure', of epistemic modals, taste assertions, causal assertions, and more.) Various features and consequences of this account are drawn. Specifically, I explain why in the bank example (and related ones) the husband, in denying the knowledge ascription, neither lies nor misleads. (shrink)

In this chapter I defend a methodological view about how we should conduct substantive ethical inquiries in the fields of normative and practical ethics. I maintain that the direct plausibility and implausibility of general ethical principles – once fully clarified and understood – should be foundational in our substantive ethical reasoning. I argue that, in order to expose our ethical intuitions about particular cases to maximal critical scrutiny, we must determine whether they can be justified by directly plausible principles. To (...) expose apparently plausible principles to maximal critical scrutiny, we must determine whether their direct plausibility can survive careful clarification of what they are really saying. This means that intuitions about cases are useful only in (a) suggesting principles that must stand on their own two feet, and (b) illustrating or otherwise helping us clarify what a principle is really saying. We should not reject principles that seem most directly plausible after we have fully clarified their content simply because they conflict with our intuitions about cases, because to do so is to side with uncritical prejudices over the teachings of critical scrutiny. (shrink)

When an agent’s motivation is sensitive to how his supervisor thinks about the agent’s competence, the supervisor has to take into account both informational and expressive contents of her message to the agent. This paper shows that the supervisor can credibly express her trust in the agent’s ability only by being un- clear about what to do. Suggesting what to do, i.e., “directives,” could reveal the supervisor’s “distrust” and reduce the agent’s equilibrium effort level even though it provides useful information (...) about the decision environment. There is also an equilibrium in which directives are neutral in expressive content. However, it is shown that neologism proofness favors equilibria in which directives are double- edged swords. (shrink)

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)

Direct Social Perception (DSP) is the idea that we can non-inferentially perceive others’ mental states. In this paper, I argue that the standard way of framing DSP leaves the debate at an impasse. I suggest two alternative interpretations of the idea that we see others’ mental states: others’ mental states are represented in the content of our perception, and we have basic perceptual beliefs about others’ mental states. I argue that the latter interpretation of DSP is more promising and examine (...) the kinds of mental states that plausibly could satisfy this version of DSP. (shrink)

Moral enhancement is an ostensibly laudable project. Who wouldn’t want people to become more moral? Still, the project’s approach is crucial. We can distinguish between two approaches for moral enhancement: direct and indirect. Direct moral enhancements aim at bringing about particular ideas, motives or behaviors. Indirect moral enhancements, by contrast, aim at making people more reliably produce the morally correct ideas, motives or behaviors without committing to the content of those ideas, motives and/or actions. I will argue, on Millian grounds, (...) that the value of disagreement puts serious pressure on proposals for relatively widespread direct moral enhancement. A more acceptable path would be to focus instead on indirect moral enhancements while staying neutral, for the most part, on a wide range of substantive moral claims. I will outline what such indirect moral enhancement might look like, and why we should expect it to lead to general moral improvement. (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 paper, I show that we should understand the direction of fit of beliefs and desires in normative terms. After rehearsing a standard objection to Michael Smith’s analysis of direction of fit, I raise a similar problem for Lloyd Humberstone’s analysis. I go on to offer my own account, according to which the difference between beliefs and desires is determined by the normative relations such states stand in. I argue that beliefs are states which we have reason to change (...) in light of the world, whereas desires are states that give us reason to change the world. After doing this, I show how the view avoids various objections, including two from David Sobel and David Copp. The paper ends by briefly discussing the relevance of the view to the Humean theory of motivation. (shrink)