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]

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

Abstract

Review by: Alexander G. Melnikov The Bulletin of Symbolic Logic, Volume 19, Issue 3, Page 400-401, September 2013

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,181

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

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.
Reviewed Work(S): An Introduction to the Philosophy of Mathematics by Mark Colyvan.Richard Pettigrew - 2013 - Association for Symbolic Logic: The Bulletin of Symbolic Logic 19 (3):396-397.
A New Spectrum of Recursive Models.André Nies - 1999 - Notre Dame Journal of Formal Logic 40 (3):307-314.

Analytics

Added to PP
2013-11-23

Downloads
10 (#881,336)

6 months
3 (#208,938)

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