Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Neutrosophic logic (3)
- Display calculus (2)
- Mathematics (2)
- Ambiguity (1)
- Bias (1)
-
- Cardinal Number (1)
- Degree of membership (1)
- Dijkstra’s algorithm; Single valued neutrosophic number; Shortest path problem; Network (1)
- Dynamic epistemic logic (1)
- Epistemic Access (1)
- Explicit Definition (1)
- Graph theory (1)
- Implicit Definition (1)
- Infinity (1)
- Intuitive and formal reasoning (1)
- Logical Resource (1)
- Mathematical problems (1)
- Modularity (1)
- Multi-type proofsystem (1)
- Multi-type system (1)
- Neutrosophic measure (1)
- Neutrosophic overset (1)
- Neutrosophic probability (1)
- Neutrosophy (1)
- Nonstandard analysis (1)
- Normalized neutrosophic probability (1)
- Objectivity (1)
- PCR5 (1)
- Paradox (1)
- Problems (1)
- Publication
- Publication Type
Articles 1 - 14 of 14
Full-Text Articles in Other Mathematics
Computation Of Shortest Path Problem In A Network With Sv-Trapezoidal Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu
Computation Of Shortest Path Problem In A Network With Sv-Trapezoidal Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu
Branch Mathematics and Statistics Faculty and Staff Publications
In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosophic number. The proposed algorithm gives the shortest path length using score function from source node to destination node. Here the weights of the edges are considered to be single valued trapezoidal neutrosophic number. Finally, a numerical example is used to illustrate the efficiency of the proposed approach
Kolmogorov’S Axioms For Probabilities With Values In Hyperbolic Numbers, Daniel Alpay, M. E. Luna-Elizarrarás, Michael Shapiro
Kolmogorov’S Axioms For Probabilities With Values In Hyperbolic Numbers, Daniel Alpay, M. E. Luna-Elizarrarás, Michael Shapiro
Mathematics, Physics, and Computer Science Faculty Articles and Research
We introduce the notion of a probabilistic measure which takes values in hyperbolic numbers and which satisfies the system of axioms generalizing directly Kolmogorov’s system of axioms. We show that this new measure verifies the usual properties of a probability; in particular, we treat the conditional hyperbolic probability and we prove the hyperbolic analogues of the multiplication theorem, of the law of total probability and of Bayes’ theorem. Our probability may take values which are zero–divisors and we discuss carefully this peculiarity.
Exploring Argumentation, Objectivity, And Bias: The Case Of Mathematical Infinity, Ami Mamolo
Exploring Argumentation, Objectivity, And Bias: The Case Of Mathematical Infinity, Ami Mamolo
OSSA Conference Archive
This paper presents an overview of several years of my research into individuals’ reasoning, argumentation, and bias when addressing problems, scenarios, and symbols related to mathematical infinity. There is a long history of debate around what constitutes “objective truth” in the realm of mathematical infinity, dating back to ancient Greece (e.g., Dubinsky et al., 2005). Modes of argumentation, hindrances, and intuitions have been largely consistent over the years and across levels of expertise (e.g., Brown et al., 2010; Fischbein et al., 1979, Tsamir, 1999). This presentation examines the interrelated complexities of notions of objectivity, bias, and argumentation as manifested in …
Abstraction And Epistemic Economy, Marco Panza
Abstraction And Epistemic Economy, Marco Panza
MPP Published Research
Most of the arguments usually appealed to in order to support the view that some abstraction principles are analytic depend on ascribing to them some sort of existential parsimony or ontological neutrality, whereas the opposite arguments, aiming to deny this view, contend this ascription. As a result, other virtues that these principles might have are often overlooked. Among them, there is an epistemic virtue which I take these principles to have, when regarded in the appropriate settings, and which I suggest to call ‘epistemic economy’. My purpose is to isolate and clarify this notion by appealing to some examples concerning …
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram
Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram
Branch Mathematics and Statistics Faculty and Staff Publications
The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.
Multi-Type Display Calculus For Propositional Dynamic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
Multi-Type Display Calculus For Propositional Dynamic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.
Tool Support For Reasoning In Display Calculi, Samuel Balco, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
Tool Support For Reasoning In Display Calculi, Samuel Balco, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error prone. As an example, we implement the display calculus D.EAK of dynamic epistemic logic. Second, we provide embeddings of the calculus in the theorem prover Isabelle for formalising proofs about D.EAK. As a case study we show that the solution of the muddy children puzzle is derivable for any number of muddy children. Third, there is a set of meta-tools, …
Multi-Type Display Calculus For Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić
Multi-Type Display Calculus For Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić
Engineering Faculty Articles and Research
In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of proof systems for the generality of dynamic logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag-Moss-Solecki’s dynamic epistemic logic, and enjoys Belnap-style cut …
Nidus Idearum. Scilogs, Ii: De Rerum Consectatione, Florentin Smarandache
Nidus Idearum. Scilogs, Ii: De Rerum Consectatione, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this second book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …
Nidus Idearum. Scilogs, I: De Neutrosophia, Florentin Smarandache
Nidus Idearum. Scilogs, I: De Neutrosophia, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). In this first books of scilogs collected from my nest of ideas, one may find new and old questions and solutions, some of them already put at work, others …
Mathematics. Possible Subjects For The High School Entrance Examination And The Capacity Examination In Romania, Florentin Smarandache, Constantin Coanda, Ionuț Ivanescu
Mathematics. Possible Subjects For The High School Entrance Examination And The Capacity Examination In Romania, Florentin Smarandache, Constantin Coanda, Ionuț Ivanescu
Branch Mathematics and Statistics Faculty and Staff Publications
The present book tries to offer students and teachers knowledge evaluation tools for all the chapters from the current Romanian mathematics syllabus. In the evolution of teenagers, the phase of admission in high schools mobilizes particular efforts and emotions. The present workbook aims to be a permanent advisor in the agitated period starting with the capacity examination and leading to the admittance to high school. The tests included in this workbook have a complementary character as opposed to the many materials written with the purpose to support all those who prepare for such examinations and they refer to the entire …
Pcr5 And Neutrosophic Probability In Target Identification, Florentin Smarandache, Nassim Abbas, Youcef Chibani, Bilal Hadjadji, Zayen Azzouz Omar
Pcr5 And Neutrosophic Probability In Target Identification, Florentin Smarandache, Nassim Abbas, Youcef Chibani, Bilal Hadjadji, Zayen Azzouz Omar
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we use PCR5 in order to fusion the information of two sources providing subjective probabilities of an event A to occur in the following form: chance that A occurs, indeterminate chance of occurrence of A, chance that A does not occur.
Interval-Valued Neutrosophic Oversets, Neutrosophic Undersets, And Neutrosophic Offsets, Florentin Smarandache
Interval-Valued Neutrosophic Oversets, Neutrosophic Undersets, And Neutrosophic Offsets, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
We have proposed since 1995 the existence of degrees of membership of an element with respect to a neutrosophic set to also be partially or totally above 1 (over-membership), and partially or totally below 0 (under-membership) in order to better describe our world problems [published in 2007].
Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K
Strong Neutrosophic Graphs And Subgraph Topological Subspaces, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilantheral K
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined. Further special lattice graph of subgraphs of these graphs are defined and described. Several interesting properties using subgraphs of a strong neutrosophic graph are obtained. Several open conjectures are proposed. These new class of strong neutrosophic graphs will certainly find applications in NCMs, NRMs and NREs with appropriate modifications.