Results for ' triangular grid graph'

207 found
Order:
  1. A Note on Triple Repetition Sequence of Domination Number in Graphs.Leomarich Casinillo, Emily Casinillo & Lanndon Ocampo - 2022 - Inprime: Indonesian Journal of Pure and Applied Mathematics 4 (2):72-81.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Nested Dissection for Sparse Null-Space Bases.Julio Michael Stern & Stephen Vavasis - 1993 - SIAM Journal of Matrix Analysis and Applications 14:766-775.
    The authors propose a nested dissection approach to finding a fundamental cycle basis in a planar graph. The cycle basis corresponds to a fundamental null-space basis of the adjacency matrix. This problem is meant to model sparse null-space basis computations occurring in a variety of settings. An O(n3/2) bound is achieved on the nullspace basis size (i.e., the number of nonzero entries in the basis), and an O(n log n) bound on the size in the special case of (...) graphs. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Bullrich Lineal Park, Buenos Aires-Narrow strip surrounded by traffic as urban green space.Natalia Penacini - 2009 - Topos: European Landscape Magazine 67:66.
    Prior to this intervention the site used to be a degraded fiscal property, that functioned as a bus yard, a police legal deposit, and a restaurant parking lot. Underneath it runs the Maldonado stream culvert, covered by a concrete slab at a depth of only -20cm. Next to the site is a 5m high railroad embankment. The plot is strategically located at the end of Juan B. Justo avenue and works as a gateway to the Tres de Febrero park (also (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Causal graphs and biological mechanisms.Alexander Gebharter & Marie I. Kaiser - 2014 - In Marie I. Kaiser, Oliver R. Scholz, Daniel Plenge & Andreas Hüttemann (eds.), Explanation in the special science: The case of biology and history. Dordrecht: Springer. pp. 55-86.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  5. A graph-theoretic account of logics.A. Sernadas, C. Sernadas, J. Rasga & Marcelo E. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1281-1320.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  6. Combing Graphs and Eulerian Diagrams in Eristic.Jens Lemanski & Reetu Bhattacharjee - 2022 - In Valeria Giardino, Sven Linker, Tony Burns, Francesco Bellucci, J. M. Boucheix & Diego Viana (eds.), Diagrammatic Representation and Inference. 13th International Conference, Diagrams 2022, Rome, Italy, September 14–16, 2022, Proceedings. Springer. pp. 97–113.
    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, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  92
    The Minimal Cognitive Grid+, Universal Cognition and Perceptual Performance.Selmer Bringsjord, Paul Bello & James Oswald - 2024 - Proceedings of Aisc 2024, Xx Conference of the Italian Association for Cognitive Science, Rome, Italy, September 18-20, 2024.
    Lieto’s Minimal Cognitive Grid (MCG) for assessing artificial agents, augmented as the method MCG+, has two implications: (1) MCG+ can advance the mathematical science of universal intelligence/cognition. (2) (a) pre-Lieto, this science lacks of coverage of perception; (b) heralded artificial agents of today are devoid of human-level perceptual intelligence.
    Download  
     
    Export citation  
     
    Bookmark  
  8. On graph-theoretic fibring of logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  9. (1 other version)Triangular Externalism.Sven Bernecker - 2013 - In Ernest Lepore & Kirk Ludwig (eds.), Blackwell Companion to Donald Davidson. Wiley-Blackwell. pp. 443-455.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  10. Structuralism, Modular Construction, and “Grid” As Universal Instruments for Building Designs.Klodjan Xhexhi - 2023 - International Journal of Advanced Natural Sciences and Engineering Researches 7:198-197.
    Structuralism can be defined as an important concept of using “units” as elements of form and space-giving, where the whole form is made not only up of a “texture”, a certain flexible grid, or an algorithm of shape-giving, but it depends also on the relationships created and how people use it. The hypothesis of this study is that “Modular Construction” can also have an aesthetically pleasing outlook and that modular housing can definitely have increasing importance in the future. Modular (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Triangular Acceleration Methods of Second Kind for Improving the Values of Integrals Numerically.Ali Hassan Mohammed & Shatha Hadier Theyab - 2019 - International Journal of Engineering and Information Systems (IJEAIS) 3 (4):45-60.
    Abstract: The aims of this study are to introduce acceleration methods that are called triangular acceleration methods, which come within the series of several acceleration methods that generally known as Al-Tememe's acceleration methods of the second kind which are discovered by (Ali Hassan Mohammed). These methods are useful in improving the results of determining numerical integrals of continuous integrands where the main error is of the forth order with respect to accuracy, partial intervals and the fasting of calculating the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. Isolated Single Valued Neutrosophic Graphs.Said Broumi, Assia Bakali, Mohamed Talea & Florentin Smarandache - 2015 - Neutrosophic Sets and Systems 11:74-78.
    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.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  13. True grid.Barry Smith - 2001 - In Daniel R. Montello (ed.), Spatial Information Theory: Foundations of Geographic Information Science. New York: Springer. pp. 14-27.
    The Renaissance architect, moral philosopher, cryptographer, mathematician, Papal adviser, painter, city planner and land surveyor Leon Battista Alberti provided the theoretical foundations of modern perspective geometry. Alberti’s work on perspective exerted a powerful influence on painters of the stature of Albrecht Dürer, Leonardo da Vinci and Piero della Francesca. But his Della pittura of 1435–36 contains also a hitherto unrecognized ontology of pictorial projection. We sketch this ontology, and show how it can be generalized to apply to representative devices in (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  14. Linguistic Graphs and their Applications.W. B. Vasantha Kandasamy, K. Ilanthenral & Florentin Smarandache - 2022 - Miami, FL, USA: Global Knowledge.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  15. The world as a graph: defending metaphysical graphical structuralism.Nicholas Shackel - 2011 - Analysis 71 (1):10-21.
    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, (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  16. Infinite graphs in systematic biology, with an application to the species problem.Samuel A. Alexander - 2013 - Acta Biotheoretica 61 (2):181--201.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  17. Uniform Single Valued Neutrosophic Graphs.S. Broumi, A. Dey, A. Bakali, M. Talea, F. Smarandache, L. H. Son & D. Koley - 2017 - Neutrosophic Sets and Systems 17:42-49.
    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.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  18. A Graph-theoretic Method to Define any Boolean Operation on Partitions.David Ellerman - 2019 - The Art of Discrete and Applied Mathematics 2 (2):1-9.
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  19. Self-graphing equations.Samuel Alexander - manuscript
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  20. Triangular functions of Al-Tememe Acceleration Methods of First Kind for Improving the Values of Integrals Numerically.Ali Hassan Mohammed & Asmahan Abed Yasir - 2019 - International Journal of Engineering and Information Systems (IJEAIS) 3 (4):60-65.
    Abstract: The main aim of this work is to introduce acceleration methods called a Trigonometric acceleration methods which are of series of numerated methods. In general, these methods named as AL-Tememe’s acceleration methods of first kind to his discoverer ''Ali Hassan Mohammed''. These are very beneficial to acceleration the numerical results for definite integrations with continuous integrands which are of 2nd order main error, with respect to the accuracy and the number of the used subintervals and the fasting obtaining results. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Coherentism via Graphs.Selim Berker - 2015 - Philosophical Issues 25 (1):322-352.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  22. The Minimal Cognitive Grid: A Tool to Rank the Explanatory Status of Cognitive Artificial Systems.Antonio Lieto - 2022 - Proceedings of AISC 2022.
    Download  
     
    Export citation  
     
    Bookmark  
  23. Novel Concepts on Domination in Neutrosophic Incidence Graphs with Some Applications.Florentin Smarandache, Siti Nurul Fitriah Mohamad & Roslan Hasni - 2023 - Journal of Advanced Computational Intelligence and Intelligent Informatics 27 (5).
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. The hardness of the iconic must: can Peirce’s existential graphs assist modal epistemology.Catherine Legg - 2012 - Philosophia Mathematica 20 (1):1-24.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  25. Graph of Socratic Elenchos.John Bova - manuscript
    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. -/- (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. Introduction to the n-SuperHyperGraph - the most general form of graph today.Florentin Smarandache - 2022 - Neutrosophic Sets and Systems 48 (1):483-485.
    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.).
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  27. Analyzing the Explanatory Power of Bionic Systems With the Minimal Cognitive Grid.Antonio Lieto - 2022 - Frontiers in Robotics and AI 9.
    In this article, I argue that the artificial components of hybrid bionic systems do not play a direct explanatory role, i.e., in simulative terms, in the overall context of the systems in which they are embedded in. More precisely, I claim that the internal procedures determining the output of such artificial devices, replacing biological tissues and connected to other biological tissues, cannot be used to directly explain the corresponding mechanisms of the biological component(s) they substitute (and therefore cannot be used (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. On walk entropies in graphs. Response to Dehmer and Mowshowitz.Ernesto Estrada, José A. de la Peña & Naomichi Hatano - 2016 - Complexity 21 (S1):15-18.
    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, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Special types of bipolar single valued neutrosophic graphs.Ali Hassan, Muhammad Aslam Malik, Said Broumi, Assia Bakali, Mohamed Talea & Florentin Smarandache - 2017 - Annals of Fuzzy Mathematics and Informatics 14 (1).
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  30. A Bipolar Single Valued Neutrosophic Isolated Graphs: Revisited.Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache & Mohsin Khan - 2017 - International Journal of New Computer Architectures and Their Applications 7 (3):89-94.
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  31. Assyrian Merchants meet Nuclear Physicists: History of the Early Contributions from Social Sciences to Computer Science. The Case of Automatic Pattern Detection in Graphs (1950s-1970s).Sébastien Plutniak - 2021 - Interdisciplinary Science Reviews 46 (4):547-568.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Problem 11402: Squares on Graphs.Catalin Barboianu - 2008 - The American Mathematical Monthly 115 (10):949.
    Download  
     
    Export citation  
     
    Bookmark  
  33. Ranking the cognitive plausibility of computational models of metaphors with the Minimal Cognitive Grid: a preliminary study.Alessio Donvito & Antonio Lieto - 2024 - Proceedings of Aisc 2024, Xx Conference of the Italian Association of Cognitive Science.
    Download  
     
    Export citation  
     
    Bookmark  
  34. Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections.Stephane Airiau, Ulle Endriss, Umberto Grandi, Daniele Porello & Joel Uckelman - 2011 - In Stephane Airiau, Ulle Endriss, Umberto Grandi, Daniele Porello & Joel Uckelman (eds.), {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011. pp. 18--23.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. On $${{{\mathcal {F}}}}$$-Systems: A Graph-Theoretic Model for Paradoxes Involving a Falsity Predicate and Its Application to Argumentation Frameworks.Gustavo Bodanza - 2023 - Journal of Logic, Language and Information 32 (3):373-393.
    $${{{\mathcal {F}}}}$$ -systems are useful digraphs to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and the one of Yablo can be analyzed with that tool to find graph-theoretic patterns. In this paper we studied this general model consisting of a set of sentences and the binary relation ‘ $$\ldots $$ affirms the falsity of $$\ldots $$ ’ among them. The possible existence of non-referential sentences was also considered. To model the sets of all (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. The Birth of Ontology and the Directed Acyclic Graph.Jobst Landgrebe - 2022 - Journal of Knowledge Structures and Systems 3 (1):72-75.
    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.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Constitutionalizing Connectivity: The Constitutional Grid of World Society.Poul F. Kjaer - 2018 - Journal of Law and Society 45 (S1):114-34.
    Global law settings are characterized by a structural pre-eminence of connectivity norms, a type of norm which differs from coherency or possibility norms. The centrality of connectivity norms emerges from the function of global law, which is to increase the probability of transfers of condensed social components, such as economic capital and products, religious doctrines, and scientific knowledge, from one legally structured context to another within world society. This was the case from colonialism and colonial law to contemporary global supply (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38.  70
    A genuinely introductory introduction to Peirce's Existential Graphs. [REVIEW]Marc Champagne - manuscript
    Download  
     
    Export citation  
     
    Bookmark  
  39.  93
    Thirty-nine exercises in Peirce's Existential Graphs, with solutions. [REVIEW]Marc Champagne - manuscript
    Download  
     
    Export citation  
     
    Bookmark  
  40. Hegel's Logic in the Light of Graph Theory.Adam Synowiecki, Krzysztof Kiwiel & John Dickson - 1973 - Dialectics and Humanism 1 (1):87-96.
    Download  
     
    Export citation  
     
    Bookmark  
  41. За игрой в карты с чертиком Визинга.Brian Rabern & Landon Rabern - 2023 - Kvant 2023 (10):2-6.
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  42. Neutrosophic Integer Programming Problem.Mai Mohamed, Mohamed Abdel-Basset, Abdel Nasser Zaied & Florentin Smarandache - 2017 - Neutrosophic Sets and Systems 15:3-7.
    In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered. The Neutrosophic Integer Programming Problem (NIP) is transformed into a crisp programming model, using truth membership (T), indeterminacy membership (I), and falsity membership (F) functions as well as single valued triangular neutrosophic numbers. To measure the efficiency of the model, we solved several numerical examples.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Introduction to Neutrosophic Restricted SuperHyperGraphs and Neutrosophic Restricted SuperHyperTrees and several of their properties.Masoud Ghods, Zahra Rostami & Florentin Smarandache - 2022 - Neutrosophic Sets and Systems 50 (1):480-487.
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  44. LA ESTRATEGIA DEL ALMA TRIPARTITA-THE STRATEGY OF THE TRIPARTITE SOUL.Jesús Antonio Marcos - 2020 - Estudios Filosóficos 69 (202):481-505.
    Abstract: Our soul, as Plato proposed, responds to the nature, functions and interaction of the three parts of which it is composed, without this preventing it from possessing a unitary character. His model of psychism respected the universal perception of the diversity of soul entities, but, by using the tools provided by Greek thought, he turned them into components of a process of opposition and dialectical ascent that reproduced within man the structure of the cosmos. The triangular systems of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Seneca’s and Porphyry’s Trees in Modern Interpretation.Jens Lemanski - 2023 - In Jens Lemanski & Ingolf Max (eds.), Historia Logicae and its Modern Interpretation. London: College Publications. pp. 61-87.
    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 (...) 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)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Charles Sanders Peirce on Necessity.Catherine Legg & Cheryl Misak - 2016 - In Adriane Rini, Edwin Mares & Max Cresswell (eds.), Logical Modalities from Aristotle to Carnap: The Story of Necessity. New York: Cambridge University Press. pp. 256-278.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Structural fixed-point theorems.Brian Rabern & Landon Rabern - manuscript
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. Difference to One: A Nuanced Early Chinese Account of Tong.Fan He - 2019 - Asian Philosophy 29 (2):116-127.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  49. Structure and Logic of Conceptual Mind.Venkata Rayudu Posina - manuscript
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. The identity of the categorical and the dispositional.Galen Strawson - 2008 - Analysis 68 (4):271-282.
    Suppose that X and Y can’t possibly exist apart in reality; then—by definition—there’s no real distinction between them, only a conceptual distinction. There’s a conceptual distinction between a rectilinear figure’s triangularity and its trilaterality, for example, but no real distinction. In fundamental metaphysics there is no real distinction between an object’s categorical properties and its dispositional properties. So too there is no real distinction between an object and its properties. And in fundamental metaphysics, for X and Y to be such (...)
    Download  
     
    Export citation  
     
    Bookmark   79 citations  
1 — 50 / 207