Jump to content

Computable model theory

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Grahamec (talk | contribs) at 02:51, 5 June 2007 (References). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Computable model theory is a branch of model theory which deals with questions of computability as they apply to model-theoretical structures. 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.

Computable model theory introduces the ideas of computable and decidable 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.

References

  • Harizanov, V. S. "Pure Computable Model Theory" Handbook of Recursive Mathematics: Volume 1: Recursive Model Theory (Studies in Logic and the Foundations of Mathematics). Ed. Iurii Leonidovich Ershov. North Holland, 1998 ISBN 978-0444500038