Undecidability in algebra
The thesis first discusses first-order model theory and its key concepts, such as compactness, categoricity, and quantifier elimination. These concepts provide a method to construct complete theories. Afterwards, we examine the notion of incompleteness and Gödel's Incompleteness Theorems. Th...
Saved in:
Main Author: | Ng, Kieran Elodie |
---|---|
Other Authors: | Wu Guohua |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/175648 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
BEFORE THE ALGORITHM: PHILOSOPHY AND ITS UNDECIDABLES
by: CERA TAN YING JING
Published: (2024) -
Derrida and the "Death of God"
by: Calano, Mark Joseph T.
Published: (2024) -
Distribution of two equidistant prime numbers
by: Ke, Guanguan
Published: (2024) -
Some combinatorial and algebraic structures in the discrete and finite Heisenberg groups
by: Manalang, Rodman Flores
Published: (2018) -
Three ways of implementing the EM algorithm when parameters are not identifiable
by: Yung Cheung Kuk, A., et al.
Published: (2014)