Persistently finite, persistently arithmetic theories-Reference-Cited by-同舟云学术

Persistently finite, persistently arithmetic theories

Published:1983 Issue:3 Volume:89 Page:487-492
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Ash C. J.,Millar T. S.

Abstract

The main result shows that a certain class of theories, the persistently finite, persistently arithmetic theories, have only arithmetic countable models.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1983-089-03/S0002-9939-1983-0715872-0/S0002-9939-1983-0715872-0.pdf

Reference7 articles.

1. Remarks on countable models;Benda, Miroslav;Fund. Math.,1973

2. Studies in Logic and the Foundations of Mathematics, Vol. 62;Keisler, H. Jerome,1971

3. Persistently finite theories with hyperarithmetic models;Millar, Terrence;Trans. Amer. Math. Soc.,1983

4. Foundations of recursive model theory;Millar, Terrence S.;Ann. Math. Logic,1978

5. Complete theories with a finite number of countable models;Peretjat′kin, M. G.;Algebra i Logika,1973

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. autostability of prime models under strong constructivizations;Algebra and Logic;2009-11

2. Pure Recursive Model Theory;Handbook of Computability Theory;1999

3. Chapter 1 Pure computable model theory;Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory;1998

4. Iterated expansions of models for countable theories and their applications;Algebra and Logic;1996

5. The Work of Anil Nerode: A Retrospective;Logical Methods;1993