Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán [Book Review]

Bulletin of Symbolic Logic 19 (3):400-401, (2013)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,283
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
A New Spectrum of Recursive Models.André Nies - 1999 - Notre Dame Journal of Formal Logic 40 (3):307-314.


Added to PP index

Total views
5 ( #1,027,065 of 2,271,259 )

Recent downloads (6 months)
3 ( #420,316 of 2,271,259 )

How can I increase my downloads?


My notes

Sign in to use this feature