Computable model theory
Computable model theory is a branch of model theory which deals with questions of computability as they apply to model-theoretical structures. Computable model theory introduces the ideas of computable and decidable models and theories and one of the basic problems is discovering whether or not computable or decidable models fulfilling certain model-theoretic conditions can be shown to exist.
Computable model theory was developed almost simultaneously by mathematicians in the West, primarily located in the United States and Australia, and Soviet Russia during the middle of the 20th century. Because of the Cold War there was little communication between these two groups and so a number of important results were discovered independently.[1]
See also
[edit]References
[edit]- ^ Harizanov 1998, p. 4.
- Harizanov, V. S. (1998), "Pure Computable Model Theory", in Ershov, Iurii Leonidovich (ed.), Handbook of Recursive Mathematics, Volume 1: Recursive Model Theory, Studies in Logic and the Foundations of Mathematics, vol. 138, North Holland, pp. 3–114, ISBN 978-0-444-50003-8, MR 1673621.
 | This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |