Logic and Foundations Commons^™

Exploratory Modeling Of Tbi Data, Martin Zwick, Stephanie Kolakowsky-Hayner, Sadie Carney, Maya Balamane, Tracie Nettleton, D. Wright

Complex Systems Faculty Publications and Presentations

Most data analyses are confirmatory, but exploratory studies can find unexpected non-linear & many-variable interaction effects. The methodology of reconstructability analysis (RA) is explicitly designed for exploratory modeling. It analyzes both nominal and continuous (binned) variables, is easily interpretable, takes standard text input, is web-accessible, and is available for research use. This presentation reports some results of applying RA to data sets from Preece (auto accidents) and Wright (auto/motorcycle/bike accidents, hit pedestrians, and falls).

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.

Certain Operations On Bipolar Fuzzy Graph Structures, Muhammad Akram, Rabia Akmal

Applications and Applied Mathematics: An International Journal (AAM)

A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. A bipolar fuzzy graph structure is a generalization of a bipolar fuzzy graph. In this paper, we present several different types of operations, including composition, Cartesian product, strong product, cross product, and lexicographic product on bipolar fuzzy graph structures. We also investigate some properties of operations.

Set-Theoretic Mereology, Joel David Hamkins, Makoto Kikuchi

Publications and Research

We consider a set-theoretic version of mereology based on the inclusion relation ⊆ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of ∈ from ⊆, we identify the natural axioms for ⊆-based mereology, which constitute a finitely axiomatizable, complete, decidable theory. Ultimately, for these reasons, we conclude that this form of set-theoretic mereology cannot by itself serve as a foundation of mathematics. Meanwhile, augmented forms of set-theoretic mereology, such as that obtained by adding the singleton operator, are foundationally robust.

On The Conjugacy Problem For Automorphisms Of Trees, Kyle Douglas Beserra

Boise State University Theses and Dissertations

In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees. We expand on the results of Kechris, Louveau, and Friedman on the complexities of the isomorphism problem of classes of countable trees. We see in nearly all cases that the complexity of isomorphism of subtrees of a given regular countable tree is the same as the complexity of conjugacy of automorphisms of the same tree, though we present an example for which this does not hold.

Epistemic Considerations On Extensive-Form Games, Cagil Tasdemir

Dissertations, Theses, and Capstone Projects

In this thesis, we study several topics in extensive-form games. First, we consider perfect information games with belief revision with players who are tolerant of each other’s hypothetical errors. We bound the number of hypothetical non-rational moves of a player that will be tolerated by other players without revising the belief on that player’s rationality on future moves, and investigate which games yield the backward induction solution.

Second, we consider players who have no way of assigning probabilities to various possible outcomes, and define players as conservative, moderate and aggressive depending on the way they choose, and show that all …

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 …

A Generalization Of The Difference Of Slopes Test To Poisson Regression With Three-Way Interaction, Melinda Bierhals

Theses, Dissertations and Capstones

Linear regression models involving interaction can use the difference of slopes test to compare slopes for various situations. We will be generalizing this process to develop a procedure to compare rates in a Poisson regression model, allowing us to consider unbounded count data as opposed to continuous data. We will apply this process to an educational data set from a sample of students located in two different Los Angeles high schools. Our model will include a three-way interaction and address the following questions:

• Does language ability impact the relationship between math ability and attendance in the same way for …

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

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 …

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

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, …

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.

Neutrosophic Overset, Neutrosophic Underset, And Neutrosophic Offset. Similarly For Neutrosophic Over-/Under-/Off- Logic, Probability, And Statistics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic Over-/Under-/Off-Set and -Logic were defined for the first time by Smarandache in 1995 and published in 2007. They are totally different from other sets/logics/probabilities.

He extended the neutrosophic set respectively to Neutrosophic Overset {when some neutrosophic component is > 1}, Neutrosophic Underset {when some neutrosophic component is < 0}, and to Neutrosophic Offset {when some neutrosophic components are off the interval [0, 1], i.e. some neutrosophic component > 1 and other neutrosophic component < 0}.

This is no surprise with respect to the classical fuzzy set/logic, intuitionistic fuzzy set/logic, or classical/imprecise probability, where the values are not allowed outside the interval [0, 1], since our real-world has …

New Trends In Neutrosophic Theory And Applications - Vol. 1, Florentin Smarandache, Surapati Pramanik

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory was proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, …

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.

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.

Neutrosophic Set Approach To Algebraic Structures, Florentin Smarandache, Madad Khan, Fazal Tahir

Branch Mathematics and Statistics Faculty and Staff Publications

Real world is featured with complex phenomenons. As uncertainty is inevitably involved in problems arise in various elds of life and classical methods failed to handle these type of problems. Dealing with imprecise, uncertain or imperfect information was a big task for many years. Many modelswerepresentedinordertoproperlyincorporateuncertaintyintosystem description, LotA.Zadeh in 1965 introduced the idea of a fuzzy set. Zadeh replaced conventional characteristic function of classical crisp sets which takes on its values in f0;1g by membership function which takes on its values in closed interval [0;1]. Fuzzy set theory is conceptually a very powerful technique to deal with another aspect or …

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 …

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 …