Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740 [Book Review]

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600010726

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,751

External links

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

Through your library

My notes

Similar books and articles

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. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
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. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
A computable ℵ 0 -categorical structure whose theory computes true arithmetic.Bakhadyr Khoussainov & Antonio Montalbán - 2010 - Journal of Symbolic Logic 75 (2):728-740.
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis. Journal of Mathematical Logic, vol. 6 (2006), no. 1, pp. 89–120. - Itay Neeman, The strength of Jullien’s indecomposability theorem. Journal of Mathematical Logic, vol. 8 (2008), no. 1, pp. 93–119. - Itay Neeman, Necessary use of induction in a reversal. Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 561–574. [REVIEW]Henry Towsner - 2014 - Bulletin of Symbolic Logic 20 (3):366-368.
Alexander Razborov, Flag algebras. Journal of Symbolic Logic, vol. 72 , no. 4, pp. 1239–1282.James Cummings - 2018 - Bulletin of Symbolic Logic 24 (1):107-108.
Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9, pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 , pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 , pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 , vol. 43 , pp. 572–600. [REVIEW]J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.
Mostowski A.. On recursive models of formalised arithmetic. Bulletin de l'Académie Polonaise des Sciences, Classe III, vol. 5 , pp. 705–710. [REVIEW]Solomon Feferman - 1958 - Journal of Symbolic Logic 23 (1):45-46.
Wilfried Sieg. Step by recursive step: Church's analysis of effective calculability. The bulletin of symbolic logic, vol. 3 , pp. 154–180. [REVIEW]Stewart Shapiro - 1999 - Journal of Symbolic Logic 64 (1):398-399.
Michael Morley. Countable models of ℵ1-categorical theories. Israel journal of mathematics, vol. 5 , pp. 65–72. - J. T. Baldwin and A. H. Lachlan. On strongly minimal sets. The journal of symbolic logic, vol. 36 ,pp. 79–96. [REVIEW]John W. Rosenthal - 1975 - Journal of Symbolic Logic 40 (4):636-637.

Analytics

Added to PP
2019-04-25

Downloads
24 (#1,069,417)

6 months
11 (#461,550)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references