Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Ryerson University

$13,000.00

Complexity and decidability of algebraic and relational structures

EF 2007-08

Résumé
This is a proposal to fund my ongoing research in universal algebra, which is a branch of pure mathematics. Broadly speaking, the main long-term goals of my proposed research are (1) to discover unifying patterns in various branches of mathematical knowledge, such as logic,algebra, and discrete mathematics; (2) to study these patterns at an appropriate level of generality; (3) to provide insight into global structure by studying phenomena that occur locally; and (4) to return something of the value to the general mathematical community, by either broadening the knowledge in the respective areas, or by finding multi-disciplinary applications. My research falls mostly within the boundaries of equational logic and its algorithmic aspects. The main object of study of equational logic are nonstandard versions of algebra (equational theories) and their abstract models. The general problem is to determine to what extent the models of these nonstandard versions of algebra can be described. In more detail, I am particularly interested in using the tools of combinatorial-geometric nature to study the local structure of algebras and relational structures; to determine to what extent the global structure will be influenced by this local behaviour; and whether such properties can be recognized algorithmically; and, if so, whether such an algorithm is computationally tractable. The research proposal is motivated, among other questions, by a long-standing open problem in the field of universal algebra, which is to characterize all finitely decidable locally finite varieties.   I aim to make a major contribution in my field of research by solving this problem using the methods of tame congruence theory and model theory.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
249684-2006
Name nom
Delic, Dejan
Department département
Mathematics
Organization id
43
Institution établissement
Ryerson University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2006
Award amount
13000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2912
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Logic
Research subject fr
Logique
Partie
2
Nb partie
5
Application title
Complexity and decidability of algebraic and relational structures
Keyword
NA
Application summary
This is a proposal to fund my ongoing research in universal algebra, which is a branch of pure mathematics. Broadly speaking, the main long-term goals of my proposed research are (1) to discover unifying patterns in various branches of mathematical knowledge, such as logic,algebra, and discrete mathematics; (2) to study these patterns at an appropriate level of generality; (3) to provide insight into global structure by studying phenomena that occur locally; and (4) to return something of the value to the general mathematical community, by either broadening the knowledge in the respective areas, or by finding multi-disciplinary applications. My research falls mostly within the boundaries of equational logic and its algorithmic aspects. The main object of study of equational logic are nonstandard versions of algebra (equational theories) and their abstract models. The general problem is to determine to what extent the models of these nonstandard versions of algebra can be described. In more detail, I am particularly interested in using the tools of combinatorial-geometric nature to study the local structure of algebras and relational structures; to determine to what extent the global structure will be influenced by this local behaviour; and whether such properties can be recognized algorithmically; and, if so, whether such an algorithm is computationally tractable. The research proposal is motivated, among other questions, by a long-standing open problem in the field of universal algebra, which is to characterize all finitely decidable locally finite varieties.   I aim to make a major contribution in my field of research by solving this problem using the methods of tame congruence theory and model theory.