Requirement systems

Journal of Symbolic Logic 60 (1):222-245 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275519

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

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

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.
Chris Ash, Julia Knight, Mark Manasse, and Theodore Slaman. Generic copies of countable structures. Annals of pure and applied logic, vol. 42 , pp. 195–205. [REVIEW]Ivan N. Soskov - 1993 - Journal of Symbolic Logic 58 (3):1078-1079.
Jon Barwise and John Schlipf. On recursively saturated models of arithmetic. Model theory and algebra, A memorial tribute to Abraham Robinson, edited by D. H. Saracino and V. B. Weispfenning, Lecture notes in mathematics, vol. 498, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 42–55. - Patrick Cegielski, Kenneth McAloon, and George Wilmers. Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels. Logic Colloquium '80, Papers intended for the European summer meeting of the Association for Symbolic Logic, edited by D. van Dalen, D. Lascar, and T. J. Smiley, Studies in logic and the foundations of mathematics, vol. 108, North-Holland Publishing Company, Amsterdam, New York, and London, 1982, pp. 57–68. - Julia F. Knight. Theories whose resplendent models are homogeneous. Israel journal of mathematics, vol. 42 , pp. 151–161. - Julia Knight and Mark Nadel. Expansions of models and Turing degrees. The journal of symbolic logic, vol. 47 , pp. 58. [REVIEW]J. -P. Ressayre - 1987 - Journal of Symbolic Logic 52 (1):279-284.
David Marker. Degrees of models of true arithmetic. Proceedings of the Herbrand Symposium, Logic Colloquium '81, Proceedings of the Herbrand Symposium held in Marseilles, France, July 1981, edited by J. Stern, Studies in logic and the foundations of mathematics, vol. 107, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1982, pp. 233–242. - Julia Knight, Alistair H. Lachlan, and Robert I. Soare. Two theorems on degrees of models of true arithmetic. The journal of symbolic logic, vol. 49 , pp. 425–436. [REVIEW]Terrence S. Millar - 1987 - Journal of Symbolic Logic 52 (2):562-563.
Review: Thomas S. Knight, Questions and Universals. [REVIEW]Gerold Stahl - 1968 - Journal of Symbolic Logic 33 (4):612-613.
F. R. Drake. On McKinsey's syntactical characterizations of systems of modal logic. The journal of symbolic logic, vol. 27 no. 4 , pp. 400–406. [REVIEW]David Makinson - 1971 - Journal of Symbolic Logic 36 (4):691-692.
Robinson Julia. Definability and decision problems in arithmetic.Th Skolem - 1950 - Journal of Symbolic Logic 15 (1):68-69.
Robinson Julia. A note on primitive recursive functions. Ebd., S. 667–670.Rózsa Péter - 1957 - Journal of Symbolic Logic 22 (4):376-376.
V. L. MurskiĬ. Nondiscernible properties of finite systems of identity relations. Soviet mathematics, vol. 12 , pp. 183–186. , pp. 520–522.) - George F. McNulty. The decision problem for equational bases of algebras. Annals of mathematical logic, vol. 10 , pp. 193–259. - George F. McNulty. Undecidable properties of finite sets of equations. The journal of symbolic logic, vol. 41 , pp. 589–604. [REVIEW]S. Burris - 1982 - Journal of Symbolic Logic 47 (4):903-904.

Analytics

Added to PP
2009-01-28

Downloads
44 (#510,722)

6 months
17 (#179,160)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ramified systems.C. J. Ash & J. F. Knight - 1994 - Annals of Pure and Applied Logic 70 (3):205-221.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Labelling systems and R.E. structures.C. J. Ash - 1990 - Annals of Pure and Applied Logic 47 (2):99-119.

Add more references