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.

History

It 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.

Introduction

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.

gollark: You are unique in being very annoyed then regretting it, however.
gollark: Probably not though, lots of people are annoyed by me.
gollark: To wildly stereotype possibly incorrectly, something something bipolar disorder?
gollark: Factually incorrect.
gollark: We do have metahypercapitalistic parallelized arbitrage engines, of course.

See also

References

  • 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, 138, North Holland, pp. 3–114, ISBN 978-0-444-50003-8, MR 1673621.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.