Reviewed Work(s): Finite and algorithmic model theory by Javier Esparza; Christian Michaux; Charles Steinhorn

Association for Symbolic Logic: The Bulletin of Symbolic Logic (forthcoming)
  Copy   BIBTEX

Abstract

Review by: Michael Benedikt The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 112-115, March 2013

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,323

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On linearly ordered structures of finite rank.Alf Onshuus & Charles Steinhorn - 2009 - Journal of Mathematical Logic 9 (2):201-239.
On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.
The Boolean spectrum of an $o$-minimal theory.Charles Steinhorn & Carlo Toffalori - 1989 - Notre Dame Journal of Formal Logic 30 (2):197-206.
Definable types in o-minimal theories.David Marker & Charles I. Steinhorn - 1994 - Journal of Symbolic Logic 59 (1):185-198.
A note on nonmultidimensional superstable theories.Anand Pillay & Charles Steinhorn - 1985 - Journal of Symbolic Logic 50 (4):1020-1024.
A Silver-like Perfect Set Theorem with an Application to Borel Model Theory.Joël Combase - 2011 - Notre Dame Journal of Formal Logic 52 (4):415-429.

Analytics

Added to PP
2013-10-18

Downloads
20 (#772,058)

6 months
12 (#220,957)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references