Logic and Foundations Commons^™

Intuitionistic Neutrosophic Soft Set, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we study the concept of intuitionistic neutrosophic set of Bhowmik and Pal. We have introduced this concept in soft sets and defined intuitionistic neutrosophic soft set. Some definitions and operations have been introduced on intuitionistic neutrosophic soft set. Some properties of this concept have been established.

Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We develop the mathematical theory of epistemic updates with the tools of duality theory. We focus on the Logic of Epistemic Actions and Knowledge (EAK), introduced by Baltag-Moss-Solecki, without the common knowledge operator. We dually characterize the product update construction of EAK as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). As an application of this dual characterization, we …

Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

"Dynamic Logics (DLs) form a large family of nonclassical logics, and perhaps the one enjoying the widest range of applications. Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of quantum physics, belief revisions, knowledge updates, etc. In each of these areas, DL-formulas express properties of the model encoding the present state of affairs, as well as the pre- and post-conditions of a given action. Actions are semantically represented as transformations of one model into another, encoding the …

Nominal Regular Expressions For Languages Over Infinite Alphabets, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto

Engineering Faculty Articles and Research

We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nominal regular expressions, show how such expressions have natural interpretations in terms of languages over infinite alphabets, and give Kleene theorems to characterise their formal languages in terms of nominal automata.

Extended Pcr Rules For Dynamic Frames, Florentin Smarandache, Jean Dezert

Branch Mathematics and Statistics Faculty and Staff Publications

In most of classical fusion problems modeled from belief functions, the frame of discernment is considered as static. This means that the set of elements in the frame and the underlying integrity constraints of the frame are fixed forever and they do not change with time. In some applications, like in target tracking for example, the use of such invariant frame is not very appropriate because it can truly change with time. So it is necessary to adapt the Proportional Conflict Redistribution fusion rules (PCR5 and PCR6) for working with dynamical frames. In this paper, we propose an extension of …

From Velocities To Fluxions, Marco Panza

MPP Published Research

"Though the De Methodis results, for its essential structure and content, from a re-elaboration of a previous unfinished treatise composed in the Fall of 1666—now known, after Whiteside, as The October 1666 tract on fluxions ([22], I, pp. 400-448)—, the introduction of the term ‘fluxion’ goes together with an important conceptual change concerned with Newton’s understanding of his own achievements. I shall argue that this change marks a crucial step in the origins of analysis, conceived as an autonomous mathematical theory."

Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts.

Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the …

Applications Of Extenics To 2d-Space And 3d-Space, Florentin Smarandache, Victor Vladareanu

Branch Mathematics and Statistics Faculty and Staff Publications

In this article one proposes several numerical examples for applying the extension set to 2D- and 3D-spaces. While rectangular and prism geometrical figures can easily be decomposed from 2D and 3D into 1D linear problems, similarly for the circle and the sphere, it is not possible in general to do the same for other geometrical figures.

Non Associative Algebraic Structures Using Finite Complex Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Authors in this book for the first time have constructed nonassociative structures like groupoids, quasi loops, non associative semirings and rings using finite complex modulo integers. The Smarandache analogue is also carried out. We see the nonassociative complex modulo integers groupoids satisfy several special identities like Moufang identity, Bol identity, right alternative and left alternative identities. P-complex modulo integer groupoids and idempotent complex modulo integer groupoids are introduced and characterized. This book has six chapters. The first one is introductory in nature. Second chapter introduces complex modulo integer groupoids and complex modulo integer loops.

The Geometry Of Homological Triangles, Florentin Smarandache, Ion Patrascu

Branch Mathematics and Statistics Faculty and Staff Publications

This book is addressed to students, professors and researchers of geometry, who will find herein many interesting and original results. The originality of the book The Geometry of Homological Triangles consists in using the homology of triangles as a “filter” through which remarkable notions and theorems from the geometry of the triangle are unitarily passed. Our research is structured in seven chapters, the first four are dedicated to the homology of the triangles while the last ones to their applications. In the first chapter one proves the theorem of homological triangles (Desargues, 1636), one survey the remarkable pairs of homological …

Fuzzy Linguistic Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Amal

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we introduce the indeterminate models in information fusion, which are due either to the existence of some indeterminate elements in the fusion space or to some indeterminate masses. The best approach for dealing with such models is the neutrosophic logic.

Completeness For The Coalgebraic Cover Modality, Clemens Kupke, Alexander Kurz, Yde Venema

Engineering Faculty Articles and Research

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover modality depending on the type functor. Its semantics is defined in terms of a categorically defined relation lifting operation.

As the main contributions of our paper we introduce a derivation system, and prove that it provides a sound and complete axiomatization for the collection of coalgebraically valid inequalities. Our soundness and completeness proof is algebraic, …

Coalgebraic Logics (Dagstuhl Seminar 12411), Ernst-Erich Doberkat, Alexander Kurz

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 12411 “Coalgebraic Logics”. The seminar deals with recent developments in the area of coalgebraic logic, a branch of logics which combines modal logics with coalgebraic semantics. Modal logic finds its uses when reasoning about behavioural and temporal properties of computation and communication, coalgebras have evolved into a general theory of systems. Consequently, it is natural to combine both areas for a mathematical description of system specification. Coalgebraic logics are closely related to the broader categories semantics/formal methods and verification/logic.

Lagrange's Theory Of Analytical Functions And His Ideal Of Purity Of Method, Giovanni Ferraro, Marco Panza

MPP Published Research

We reconstruct essential features of Lagrange’s theory of analytical functions by exhibiting its structure and basic assumptions, as well as its main shortcomings. We explain Lagrange’s notions of function and algebraic quantity, and we concentrate on power-series expansions, on the algorithm for derivative functions, and the remainder theorem—especially on the role this theorem has in solving geometric and mechanical problems. We thus aim to provide a better understanding of Enlightenment mathematics and to show that the foundations of mathematics did not, for Lagrange, concern the solidity of its ultimate bases, but rather purity of method—the generality and internal organization of …

Neutrosophic Interval Bialgebraic Structures, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors for the first time introduce the notion of neutrosophic intervals and study the algebraic structures using them. Concepts like groups and fields using neutrosophic intervals are not possible. Pure neutrosophic intervals and mixed neutrosophic intervals are introduced and by the very structure of the interval one can understand the category to which it belongs. We in this book introduce the notion of pure (mixed) neutrosophic interval bisemigroups or neutrosophic biinterval semigroups. We derive results pertaining to them. The new notion of quasi bisubsemigroups and ideals are introduced. Smarandache interval neutrosophic bisemigroups are also introduced and …

Finite Neutrosophic Complex Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book for the first time the authors introduce the notion of real neutrosophic complex numbers. Further the new notion of finite complex modulo integers is defined. For every C(Zn) the complex modulo integer iF is such that 2 Fi = n – 1. Several algebraic structures on C(Zn) are introduced and studied. Further the notion of complex neutrosophic modulo integers is introduced. Vector spaces and linear algebras are constructed using these neutrosophic complex modulo integers. This book is organized into 5 chapters. The first chapter introduces real neutrosophic complex numbers. Chapter two introduces the notion of finite complex …

Algebraic Structures Using Super Interval Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The advantage of using super interval matrices is that one can build only one vector space using m × n interval matrices, but in case of super interval matrices we can have several such spaces depending on the partition on the interval matrix.

This book has seven chapters. Chapter one is introductory in nature, just introducing the super interval matrices or interval super matrices. In chapter two essential operations on super interval matrices are defined. Further in this chapter algebraic structures are defined on these super interval matrices using these operation. Using these super interval matrices semirings and semivector spaces …

Interval Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the notion of interval semirings are introduced. The authors study and analyse semirings algebraically. Methods are given for the construction of non-associative semirings using loops and interval semirings or interval loops and semirings. Another type of non-associative semirings are introduced using groupoids and interval semirings or interval groupoids and semirings. Examples using integers and modulo integers are given. Also infinite semirings which are semifields are given using interval semigroups and semirings or semigroups and interval semirings or using groups and interval semirings. Interval groups are introduced to construct interval group interval semirings, and properties related with them …

Interval Semigroups, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book we introduce the notion of interval semigroups using intervals of the form [0, a], a is real. Several types of interval semigroups like fuzzy interval semigroups, interval symmetric semigroups, special symmetric interval semigroups, interval matrix semigroups and interval polynomial semigroups are defined and discussed. This book has eight chapters. The main feature of this book is that we suggest 241 problems in the eighth chapter. In this book the authors have defined 29 new concepts and illustrates them with 231 examples. Certainly this will find several applications. The authors deeply acknowledge Dr. Kandasamy for the proof reading …

Dsm Super Vector Space Of Refined Labels, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of supermatrices of refined labels. Authors prove super row matrix of refined labels form a group under addition. However super row matrix of refined labels do not form a group under product; it only forms a semigroup under multiplication. In this book super column matrix of refined labels and m × n matrix of refined labels are introduced and studied. We mainly study this to introduce to super vector space of refined labels using matrices. We in this book introduce the notion of semifield of refined labels using which …

Problems With And Without … Problems!, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

This book is addressed to College honor students, researchers, and professors. It contains 136 original problems published by the author in various scientific journals around the world. The problems could be used to preparing for courses, exams, and Olympiads in mathematics. Many of these have a generalized form. For each problem we provide a detailed solution.

I was a professeur coopérant between 1982-1984, teaching mathematics in French language at Lycée Sidi EL Hassan Lyoussi in Sefrou, Province de Fès, Morocco. I used many of these problems for selecting and training, together with other Moroccan professors, in Rabat city, of the …

A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets, Florentin Smarandache, Mumtaz Ali

Branch Mathematics and Statistics Faculty and Staff Publications

Algebraic codes play a signifcant role in the minimisation of data corruption which caused by defects such as inference, noise channel, crosstalk, and packet loss. In this paper, we introduce soft codes (soft linear codes) through the application of soft sets which is an approximated collection of codes. We also discuss several types of soft codes such as type-1 soft codes, complete soft codes etc. Further, we construct the soft generator matrix and soft parity check matrix for the soft linear codes. Moreover, we develop two techniques for the decoding of soft codes.

Uniform And Partially Uniform Redistribution Rules, Florentin Smarandache, Jean Dezert

Branch Mathematics and Statistics Faculty and Staff Publications

This paper introduces two new fusion rules for combining quantitative basic belief assignments. These rules although very simple have not been proposed in literature so far and could serve as useful alternatives because of their low computation cost with respect to the recent advanced Proportional Conflict Redistribution rules developed in the DSmT framework.

Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Xinde Li, Jean Dezert, Florentin Smarandache, Xinhan Huang

Branch Mathematics and Statistics Faculty and Staff Publications

This paper proposes a new solution for reducing the number of sources of evidence to be combined in order to diminish the complexity of the fusion process required in some applications where the real-time constraint and strong computing resource limitation are of prime importance. The basic idea consists in selecting, among the whole set of sources of evidence, only the biggest subset of sources which are not too contradicting based on a criterion of Evidence Supporting Measure of Similarity (ESMS) in order to process solely the coherent information received. The ESMS criterion serves actually as a generic tool for outlier …

Contradiction Measures And Specificity Degrees Of Basic Belief Assignments, Florentin Smarandache, Arnaud Martin, Christophe Osswald

Branch Mathematics and Statistics Faculty and Staff Publications

In the theory of belief functions, many measures of uncertainty have been introduced. However, it is not always easy to understand what these measures really try to represent. In this paper, we re-interpret some measures of uncertainty in the theory of belief functions. We present some interests and drawbacks of the existing measures. On these observations, we introduce a measure of contradiction. Therefore, we present some degrees of non-specificity and Bayesianity of a mass. We propose a degree of specificity based on the distance between a mass and its most specific associated mass. We also show how to use the …

Neutrosophic Code, Mumtaz Ali, Florentin Smarandache, Munazza Naz, Muhammad Shabir

Branch Mathematics and Statistics Faculty and Staff Publications

The idea of neutrosophic code came into my mind at that time when i was reading the literature about linear codes and i saw that, if there is data transformation between a sender and a receiver. They want to send 11and 00 as codewords. They suppose 11 for true and 00 for false. When the sender sends the these two codewords and the error occurs. As a result the receiver received 01 or 10 instead of 11 and 00. This story give a way to the neutrosophic codes and thus we introduced neutrosophic codes over finite field in this paper.

G-Neutrosophic Space, Mumtaz Ali, Florentin Smarandache, Munazza Naz, Muhammad Shabir

Branch Mathematics and Statistics Faculty and Staff Publications

The Concept of a G-space came into being as a consequence of Group action on an ordinary set. Over the history of Mathematics and Algebra, theory of group action has emerged and proven to be an applicable and effective framework for the study of different kinds of structures to make connection among them.

Generalized Interval Neutrosophic Soft Set And Its Decision Making Problem, Said Broumi

Branch Mathematics and Statistics Faculty and Staff Publications

In this work, we introduce the concept of generalized interval neutrosophic soft set and study their operations. Finally, we present an application of generalized interval neutrosophic soft set in decision making problem.

Relation Liftings On Preorders And Posets, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.