A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata

Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal μ-calculus extended with backwards modalities. In this paper, we present a very simple proof by way of Wadge games of the strictness of the hierarchy of Motowski indices of two-way alternating automata over trees.

Studies on Fuzzy Graphs

In this thesis an attempt to develop the properties of basic concepts in fuzzy graphs such as fuzzy bridges, fuzzy cutnodes, fuzzy trees and blocks in fuzzy graphs have been made. The notion of complement of a fuzzy graph is modified and some of its properties are studied. Since the notion of complement has just been initiated, several properties of G and G available for crisp graphs can be studied for fuzzy graphs also. Mainly focused on fuzzy trees defined by Rosenfeld in [10] , several other types of fuzzy trees are defined depending on the acyclicity level of a fuzzy graph. It is observed that there are selfcentered fuzzy trees. Some operations on fuzzy graphs and prove that complement of the union two fuzzy graphs is the join of their complements and complement of the join of two fuzzy graphs is union of their complements. The study of fuzzy graphs made in this thesis is far from being complete. The wide ranging applications of graph theory and the interdisciplinary nature of fuzzy set theory, if properly blended together could pave a way for a substantial growth of fuzzy graph theory.

A Study Of Frames In The Fuzzy And Intuitionist Fuzzy Contexts

The fuzzy set theory has a wider scope of applicability than classical set theory in solving various problems. Fuzzy set theory in the last three decades as a formal theory which got formalized by generalizing the original ideas and concepts in classical mathematical areas and as a very powerful modeling language, that can cope with a large fraction of uncertainties of real life situations. In Intuitionistic Fuzzy sets a new component degree of non membership in addition to the degree of membership in the case of fuzzy sets with the requirement that their sum be less than or equal to one. The main objective of this thesis is to study frames in Fuzzy and Intuitionistic Fuzzy contexts. The thesis proved some results such as ifµ is a fuzzy subset of a frame F, then µ is a fuzzy frame of F iff each non-empty level subset µt of µ is a subframe of F, the category Fuzzfrm of fuzzy frames has products and the category Fuzzfrm of fuzzy frames is complete. It define a fuzzy-quotient frame of F to be a fuzzy partition of F, that is, a subset of IF and having a frame structure with respect to new operations and study the notion of intuitionistic fuzzy frames and obtain some results and introduce the concept of Intuitionistic fuzzy Quotient frames. Finally it establish the categorical link between frames and intuitionistic fuzzy topologies.

Study on Fuzzy Ordered FuzzyTopological Spaces

In this study we combine the notions of fuzzy order and fuzzy topology of Chang and define fuzzy ordered fuzzy topological space. Its various properties are analysed. Product, quotient, union and intersection of fuzzy orders are introduced. Besides, fuzzy order preserving maps and various fuzzy completeness are investigated. Finally an attempt is made to study the notion of generalized fuzzy ordered fuzzy topological space by considering fuzzy order defined on a fuzzy subset.

Studies in Fuzzy Commutative Algebra

The main objective of this thesis was to extend some basic concepts and results in module theory in algebra to the fuzzy setting.The concepts like simple module, semisimple module and exact sequences of R-modules form an important area of study in crisp module theory. In this thesis generalising these concepts to the fuzzy setting we have introduced concepts of ‘simple and semisimple L-modules’ and proved some results which include results analogous to those in crisp case. Also we have defined and studied the concept of ‘exact sequences of L-modules’.Further extending the concepts in crisp theory, we have introduced the fuzzy analogues ‘projective and injective L-modules’. We have proved many results in this context. Further we have defined and explored notion of ‘essential L-submodules of an L-module’. Still there are results in crisp theory related to the topics covered in this thesis which are to be investigated in the fuzzy setting. There are a lot of ideas still left in algebra, related to the theory of modules, such as the ‘injective hull of a module’, ‘tensor product of modules’ etc. for which the fuzzy analogues are not defined and explored.

Studies on Fuzzy Matroitls and Related Topics

The doctoral thesis focuses on the Studies on fuzzy Matroids and related topics.Since the publication of the classical paper on fuzzy sets by L. A. Zadeh in 1965.the theory of fuzzy mathematics has gained more and more recognition from many researchers in a wide range of scientific fields. Among various branches of pure and applied mathematics, convexity was one of the areas where the notion of fuzzy set was applied. Many researchers have been involved in extending the notion of abstract convexity to the broader framework of fuzzy setting. As a result, a number of concepts have been formulated and explored. However. many concepts are yet to be fuzzified. The main objective of this thesis was to extend some basic concepts and results in convexity theory to the fuzzy setting. The concept like matroids, independent structures. classical convex invariants like Helly number, Caratheodoty number, Radon number and Exchange number form an important area of study in crisp convexity theory. In this thesis, we try to generalize some of these concepts to the fuzzy setting. Finally, we have defined different types of fuzzy matroids derived from vector spaces and discussed some of their properties.

Prediction of Key Symptoms of Learning Disabilities in School-Age Children Using Rough Sets

This paper highlights the prediction of learning disabilities (LD) in school-age children using rough set theory (RST) with an emphasis on application of data mining. In rough sets, data analysis start from a data table called an information system, which contains data about objects of interest, characterized in terms of attributes. These attributes consist of the properties of learning disabilities. By finding the relationship between these attributes, the redundant attributes can be eliminated and core attributes determined. Also, rule mining is performed in rough sets using the algorithm LEM1. The prediction of LD is accurately done by using Rosetta, the rough set tool kit for analysis of data. The result obtained from this study is compared with the output of a similar study conducted by us using Support Vector Machine (SVM) with Sequential Minimal Optimisation (SMO) algorithm. It is found that, using the concepts of reduct and global covering, we can easily predict the learning disabilities in children

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.

ONTIC: A Knowledge Representation System for Mathematics

Ontic is an interactive system for developing and verifying mathematics. Ontic's verification mechanism is capable of automatically finding and applying information from a library containing hundreds of mathematical facts. Starting with only the axioms of Zermelo-Fraenkel set theory, the Ontic system has been used to build a data base of definitions and lemmas leading to a proof of the Stone representation theorem for Boolean lattices. The Ontic system has been used to explore issues in knowledge representation, automated deduction, and the automatic use of large data bases.

Teoría de conjuntos aplicada a la caracterización matemática de unión de péptidos al HLA clase II

Las bases moleculares para el reconocimiento y la respuesta inmune están en la presentación de péptidos antigénicos. Se utilizaron la teoría de conjuntos y los datos experimentales para realizar una caracterización matemática de la región central de unión del péptido mediante la definición de 8 reglas asociadas a la unión al HLA clase II. Estas reglas se aplicaron a 4 péptidos promiscuos, 25 secuencias peptídicas naturales de la región central, de las cuales 13 presentaron unión, mientras que los demás no, y 19 péptidos sintéticos buscando diferenciar los péptidos. A excepción de uno, todos los péptidos de unión y no unión fueron caracterizados acertadamente. Esta metodología puede ser útil para escoger péptidos clave en el desarrollo de vacunas.

¿Es posible una gestión humana no funcionalista? Descripción de un modelo estratégico de gestión de personal

This paper describes a human management model as conceived in organizations that carry out a strategic direction of staff, based on a critical look of traditional management and some of its notions, such as the classical perspective of strategic addressing and human resources management. The privileged theoretical framework is the epistemological ground of the organizational theory and some of its sociological resources. In addition to the documentary review and the proposal of experts in consulting, a group of graphics made under the basic logicof set theory, designed from the analysis of several Colombian organizations, are presented. The main finding is that despite the efforts of executives, consultants and scholars to build management models different from functionalists, the way they have been thought in order to make them more strategic has made them still more functionalists that in the traditional approach. The strategic human management reproduces, with enormous power, the ideology of the macroeconomic model.

Economía matemática: antecedentes, evolución y algunos desarrollos recientes

Se presenta aquí, en forma breve, el origen de la matematización económica y el campo de la economía matemática. Un enfoque histórico inicial divide dicho campo en un primer periodo denominado marginalista, otro donde se utiliza la teoría de los conjuntos y modelos lineales y por último un periodo que integra los dos anteriores. Posteriormente, se analiza la evolución de la Teoría del Equilibrio General desde Quesnay, pasando por Walras y desarrollos posteriores hasta su culminación con los trabajos de Arrow, Debreu y sus contemporáneos. Finalmente, se describe la influencia de las matemáticas, en especial de la optimización dinámica, en la teoría macroeconómica y a otras áreas de la economía.