Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Neutrosophic logic (5)
- Algebraic structures (2)
- George Boole (2)
- Nominal sets (2)
- Algebraic models (1)
-
- Bol identity (1)
- Coalgebra (1)
- Coinduction (1)
- Commutative quantale (1)
- Conjunctive rule (1)
- Corecursion (1)
- Correlation Coefficient of Interval Neutrosophic Set (1)
- Counter-examples to Dempster rule (1)
- Counterexamples to Conjunctive rule (1)
- Cover modality (1)
- DSmT (1)
- Dempster rule (1)
- Duality (1)
- Dynamic Epistemic Logic (1)
- Enriched categories (1)
- Exact square (1)
- Filters (1)
- Fraenkel-Mostowski sets (1)
- Fuzzy neutrosophic model (1)
- Groupoid (1)
- Groupoids (1)
- Infinitary lambda calculus (1)
- Information fusion (1)
- Interval groups (1)
- Intuitionistic Dynamic Epistemic Logic (1)
Articles 1 - 18 of 18
Full-Text Articles in Other Mathematics
Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov
Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we present several counter-examples to the Conjunctive rule and to Dempster rule of combinations in information fusion.
Fuzzy Neutrosophic Models For Social Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy
Fuzzy Neutrosophic Models For Social Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book, authors give the notion of different neutrosophic models like, neutrosophic cognitive maps (NCMs), neutrosophic relational maps (NEMs), neutrosophic relational equations (NREs), neutrosophic bidirectional associative memories (NBAMs) and neutrosophic associative memories (NAMs) for socio scientists. This book has six chapters. The first chapter introduces the basic concepts of neutrosophic numbers and notions about neutrosophic graphs which are essential to construct these neutrosophic models. In chapter two we describe the concept of neutrosophic matrices and the essential operations related with them which are used in the study and working of these neutrosophic models. However the reader must be familiar …
Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
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
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.
Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts
Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts
Engineering Faculty Articles and Research
This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.
Subset Polynomial Semirings And Subset Matrix Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Polynomial Semirings And Subset Matrix Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors introduce the notion of subset polynomial semirings and subset matrix semirings. The study of algebraic structures using subsets were recently carried out by the authors. Here we define the notion of subset row matrices, subset column matrices and subset m × n matrices. Study of this kind is developed in chapter two of this book. If we use subsets of a set X; say P(X), the power set of the set X....
Hence if P(X) is replaced by a group or a semigroup we get the subset matrix to be only a subset matrix semigroup. If …
Subset Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors introduce the new notion of constructing non associative algebraic structures using subsets of a groupoid. Thus subset groupoids are constructed using groupoids or loops. Even if we use subsets of loops still the algebraic structure we get with it is only a groupoid. However we can get a proper subset of it to be a subset loop which will be isomorphic with the loop which was used in the construction of the subset groupoid. To the best of the authors’ knowledge this is the first time non associative algebraic structures are constructed using subsets. We get …
Subset Non Associative Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Non Associative Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The concept of non associative topological space is new and innovative. In general topological spaces are defined as union and intersection of subsets of a set X. In this book authors for the first time define non associative topological spaces using subsets of groupoids or subsets of loops or subsets of groupoid rings or subsets of loop rings. This study leads to several interesting results in this direction.
Over hundred problems on non associative topological spaces using of subsets of loops or groupoids is suggested at the end of chapter two. Also conditions for these non associative subset topological spaces …
Algebraic Structures Using Subsets, Florentin Smarandache, W.B Vasantha Kandasamy
Algebraic Structures Using Subsets, Florentin Smarandache, W.B Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The study of subsets and giving algebraic structure to these subsets of a set started in the mid 18th century by George Boole. The first systematic presentation of Boolean algebra emerged in 1860s in papers written by William Jevons and Charles Sanders Peirce. Thus we see if P(X) denotes the collection of all subsets of the set X, then P(X) under the op erations of union and intersection is a Boolean algebra. Next the subsets of a set was used in the construction of topological spaces. We in this book consider subsets of a semigroup or a group or a …
Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The study of groupoids is meager and we have recently introduced the new notion of subset groupoids and have studied them. It is interesting to keep on record that interval groupoids have been studied by us in 2010. Further when the subsets of a loop are taken they also form only a subset groupoid and not a subset loop. Thus we do not have the concept of subset interval loop they only form a subset interval groupoid. Special elements like subset interval zero divisors, subset interval idempotents and subset interval units are studied. Concept of subset interval groupoid homomorphism is …
Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy
Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce a new method of building algebraic structures on the interval [0, n). This study is interesting and innovative. However, [0, n) is a semigroup under product, × modulo n and a semigroup under min or max operation. Further [0, n) is a group under addition modulo n. We see [0, n) under both max and min operation is a semiring. [0, n) under + and × is not in general a ring. We define S = {[0, n), +, ×} to be a pseudo special ring as the distributive law is …
Filters Via Neutrosophic Crisp Sets, A. A. Salama, Florentin Smarandache
Filters Via Neutrosophic Crisp Sets, A. A. Salama, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.
Correlation Coefficient Of Interval Neutrosophic Set, Said Broumi, Florentin Smarandache
Correlation Coefficient Of Interval Neutrosophic Set, Said Broumi, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce for the first time the concept of correlation coefficients of interval valued neutrosophic set (INS for short). Respective numerical examples are presented.
Intuitionistic Neutrosophic Soft Set, Said Broumi, Florentin Smarandache
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.
More On Intuitionistic Neutrosophic Soft Sets, Said Broumi, Florentin Smarandache
More On Intuitionistic Neutrosophic Soft Sets, Said Broumi, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Intuitionistic Neutrosophic Soft Set theory proposed by S. Broumi and F. Samarandache [28], has been regarded as an effective mathematical tool to deal with uncertainties. In this paper new operations on intuitionistic neutrosophic soft sets have been introduced . Some results relating to the properties of these operations have been established. Moreover ,we illustrate their interconnections between each other.
Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil
Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil
Engineering Faculty Articles and Research
We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the “powerset monad” on categories, one is the preservation by T of “exactness” of certain squares. Both characterisations are generalisations of the “classical” results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks.
The results presented in this paper …
Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano
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 …
Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries
Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries
Engineering Faculty Articles and Research
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.