Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation,
2013
University of New Mexico
Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors bring out how sets in algebraic structure can be used to construct most generalized algebraic structures, like set linear algebra/vector space, set ideals in rings and semigroups. This sort of study is not only innovative but infact very helpful in cases instead of working with a large data we can work with a considerably small data. Thus instead of working with a vector space or a linear algebra V over a field F we can work with a subset in V and a needed subset in F, this can save both time and economy. The concept …
Filters Via Neutrosophic Crisp Sets,
2013
University of New Mexico
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.
More On Intuitionistic Neutrosophic Soft Sets,
2013
University of New Mexico
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.
Residuated Frames With Applications To Decidability,
2013
University of Denver
Residuated Frames With Applications To Decidability, Nikolaos Galatos, Peter Jipsen
Mathematics, Physics, and Computer Science Faculty Articles and Research
Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how frames provide a uniform treatment for semantic proofs of cut-elimination, the finite model property and the finite embeddability property, which imply the decidability of the equational/universal theories of the associated residuated lattice-ordered groupoids. In particular these techniques allow us to prove that the variety of involutive FL-algebras and several related varieties have the finite model property.
Solution Of Fuzzy System Of Linear Equations With Polynomial Parametric Form,
2012
National Institute of Technology,
Solution Of Fuzzy System Of Linear Equations With Polynomial Parametric Form, Diptiranjan Behera, S. Chakraverty
Applications and Applied Mathematics: An International Journal (AAM)
This paper proposed two new and simple solution methods to solve a fuzzy system of linear equations having fuzzy coefficients and crisp variables using a polynomial parametric form of fuzzy numbers. Related theorems are stated and proved. The proposed methods are used to solve example problems. The results obtained are also compared with the known solutions and are found to be in good agreement.
A Constructive Proof Of Fundamental Theory For Fuzzy Variable Linear Programming Problems,
2012
Islamic Azad University
A Constructive Proof Of Fundamental Theory For Fuzzy Variable Linear Programming Problems, A. Ebrahimnejad
Applications and Applied Mathematics: An International Journal (AAM)
Two existing methods for solving fuzzy variable linear programming problems based on ranking functions are the fuzzy primal simplex method proposed by Mahdavi-Amiri et al. (2009) and the fuzzy dual simplex method proposed by Mahdavi-Amiri and Nasseri (2007). In this paper, we prove that in the absence of degeneracy these fuzzy methods stop in a finite number of iterations. Moreover, we generalize the fundamental theorem of linear programming in a crisp environment to a fuzzy one. Finally, we illustrate our proof using a numerical example.
Ultra-Low Voltage Digital Circuits And Extreme Temperature Electronics Design,
2012
University of Arkansas, Fayetteville
Ultra-Low Voltage Digital Circuits And Extreme Temperature Electronics Design, Aaron J. Arthurs
Graduate Theses and Dissertations
Certain applications require digital electronics to operate under extreme conditions e.g., large swings in ambient temperature, very low supply voltage, high radiation. Such applications include sensor networks, wearable electronics, unmanned aerial vehicles, spacecraft, and energyharvesting systems. This dissertation splits into two projects that study digital electronics supplied by ultra-low voltages and build an electronic system for extreme temperatures. The first project introduces techniques that improve circuit reliability at deep subthreshold voltages as well as determine the minimum required supply voltage. These techniques address digital electronic design at several levels: the physical process, gate design, and system architecture. This dissertation analyzes …
On The Occasion Of Your Graduation,
2012
Saint Mary's University - Canada
On The Occasion Of Your Graduation, Robert Dawson
Journal of Humanistic Mathematics
A letter from an absent supervisor to a doctoral student about to graduate reveals a terrible secret.
Extended Pcr Rules For Dynamic Frames,
2012
University of New Mexico
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 …
Numerical Solution Of Interval And Fuzzy System Of Linear Equations,
2012
National Institute of Technology
Numerical Solution Of Interval And Fuzzy System Of Linear Equations, Suparna Das, S. Chakraverty
Applications and Applied Mathematics: An International Journal (AAM)
A system of linear equations, in general is solved in open literature for crisp unknowns, but in actual case the parameters (coefficients) of the system of linear equations contain uncertainty and are less crisp. The uncertainties may be considered in term of interval or fuzzy number. In this paper, a detail of study of linear simultaneous equations with interval and fuzzy parameter (triangular and trapezoidal) has been performed. New methods have been proposed for solving such systems. First, the methods have been tested for known problems viz. a circuit analysis solved in the literature and the results are found to …
A Novel Algorithm To Forecast Enrollment Based On Fuzzy Time Series,
2012
Mosul University
A Novel Algorithm To Forecast Enrollment Based On Fuzzy Time Series, Haneen T. Jasim, Abdul G. Jasim Salim, Kais I. Ibraheem
Applications and Applied Mathematics: An International Journal (AAM)
In this paper we propose a new method to forecast enrollments based on fuzzy time series. The proposed method belongs to the first order and time-variant methods. Historical enrollments of the University of Alabama from year 1948 to 2009 are used in this study to illustrate the forecasting process. By comparing the proposed method with other methods we will show that the proposed method has a higher accuracy rate for forecasting enrollments than the existing methods.
Computable Linear Orders And Turing Reductions,
2012
[email protected]
Computable Linear Orders And Turing Reductions, Whitney P. Turner
Master's Theses
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations.
From Velocities To Fluxions,
2012
Chapman University
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."
Prove It!,
2012
Pomona College
Prove It!, Kenny W. Moran
Journal of Humanistic Mathematics
A dialogue between a mathematics professor, Frank, and his daughter, Sarah, a mathematical savant with a powerful mathematical intuition. Sarah's intuition allows her to stumble into some famous theorems from number theory, but her lack of academic mathematical background makes it difficult for her to understand Frank's insistence on the value of proof and formality.
On The Logic Of Reverse Mathematics,
2012
[email protected]
On The Logic Of Reverse Mathematics, Alaeddine Saadaoui
Theses, Dissertations and Capstones
The goal of reverse mathematics is to study the implication and non-implication relationships between theorems. These relationships have their own internal logic, allowing some implications and non-implications to be derived directly from others. The goal of this thesis is to characterize this logic in order to capture the relationships between specific mathematical works. The results of our study are a finite set of rules for this logic and the corresponding soundness and completeness theorems. We also compare our logic with modal logic and strict implication logic. In addition, we explain two applications of S-logic in topology and second order arithmetic.
Completeness For The Coalgebraic Cover Modality,
2012
University of Oxford
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, …
Strongly Complete Logics For Coalgebras,
2012
Chapman University
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 …
Coalgebraic Logics (Dagstuhl Seminar 12411),
2012
TU Dortmund
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.
Neutrosophic Super Matrices And Quasi Super Matrices,
2012
University of New Mexico
Neutrosophic Super Matrices And Quasi Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors study neutrosophic super matrices. The concept of neutrosophy or indeterminacy happens to be one the powerful tools used in applications like FCMs and NCMs where the expert seeks for a neutral solution. Thus this concept has lots of applications in fuzzy neutrosophic models like NRE, NAM etc. These concepts will also find applications in image processing where the expert seeks for a neutral solution. Here we introduce neutrosophic super matrices and show that the sum or product of two neutrosophic matrices is not in general a neutrosophic super matrix. Another interesting feature of this book is …
Semigroup As Graphs,
2012
University of New Mexico
Semigroup As Graphs, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors study the zero divisor graph and unit graph of a semigroup. The zero divisor graphs of semigroups Zn under multiplication is studied and characterized.
