Related papers: A Unified Approach to Algebraic Set Theory

This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…

Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…

This paper deals with a new notion called fuzzy $\alpha$-cut and its properties. A notion called localic frame is also introduced. Algebraic structures arising out of the family of fuzzy $\alpha$-cuts have been investigated. It will be seen…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

For the first time, we have introduced the concept of N-groups, N-semigroups, N-loops, and N-groupoids. We also define a mixed N-algebraic structure. The main aim of this book is to attract young mathematicians to this interesting field. It…

The paper has a form of a talk on the given topic. It consists of three parts. The first part of the paper contains main notions, the second one is devoted to logical geometry, the third part describes types and isotypeness. The problems…

The work lays the foundations of the theory of changeable sets. In author opinion, this theory, in the process of it's development and improvement, can become one of the tools of solving the sixth Hilbert problem least for physics of…

This work provides a unified formalism for studying difference and (Hasse-) differential algebraic geometry, by introducing a theory of "iterative Hasse rings and schemes". As an application, Hasse jet spaces are constructed generally,…

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…

This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…

We employ techniques of machine-learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether AI can "learn" algebraic structures. Using finite groups and finite rings as a concrete playground, we…

A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occurs in abstract model theory, institution theory and in algebraic logic. Logic families…

Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…

An informal discussion of how the construction problem in algebraic geometry motivates the search for formal proof methods. Also includes a brief discussion of my own progress up to now, which concerns the formalization of category theory…

Category Theory provides us with a clear notion of what is an internal structure. This will allow us to focus our attention on a certain type of relationship between context and structure.

Answer set programming (ASP) is a paradigm for declarative problem solving where problems are first formalized as rule sets, i.e., answer-set programs, in a uniform way and then solved by computing answer sets for programs. The…

In this book, the authors define several new types of soft neutrosophic algebraic structures over neutrosophic algebraic structures and we study their generalizations. These soft neutrosophic algebraic structures are basically parameterized…

Program classification can be regarded as a high-level abstraction of code, laying a foundation for various tasks related to source code comprehension, and has a very wide range of applications in the field of software engineering, such as…

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

A discriminative structured analysis dictionary is proposed for the classification task. A structure of the union of subspaces (UoS) is integrated into the conventional analysis dictionary learning to enhance the capability of…