A metatheorem for constructions by finitely many workers

Journal of Symbolic Logic 55 (2):787-804 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274665

Other Versions

No versions found

Links

PhilArchive



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

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

Axiom systems for first order logic with finitely many variables.James S. Johnson - 1973 - Journal of Symbolic Logic 38 (4):576-578.
Theories with finitely many models.Simon Thomas - 1986 - Journal of Symbolic Logic 51 (2):374-376.
Constructions by transfinitely many workers.Julia F. Knight - 1990 - Annals of Pure and Applied Logic 48 (3):237-259.
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.
On the Representation of Finitely Many-Valued Logics by Electric Circuits.Katuzi Ono & Toshihiko Kurihara - 1957 - Journal of Symbolic Logic 22 (1):102.
Coding a family of sets.J. F. Knight - 1998 - Annals of Pure and Applied Logic 94 (1-3):127-142.
Reverse mathematics of first-order theories with finitely many models.David R. Belanger - 2014 - Journal of Symbolic Logic 79 (3):955-984.
Ash C. J. and Knight J.. Computable structures and the hyperarithmetical hierarchy. Studies in logic and the foundations of mathematics, vol. 144. Elsevier, Amsterdam etc. 2000, xv + 346 pp. [REVIEW]Valentina Harizanov - 2001 - Bulletin of Symbolic Logic 7 (3):383-385.
Analytic and coanalytic families of almost disjoint functions.Bart Kastermans, Juris Steprāns & Yi Zhang - 2008 - Journal of Symbolic Logic 73 (4):1158-1172.

Analytics

Added to PP
2009-01-28

Downloads
43 (#521,582)

6 months
13 (#265,352)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.
A general framework for priority arguments.Steffen Lempp & Manuel Lerman - 1995 - Bulletin of Symbolic Logic 1 (2):189-201.
Constructions by transfinitely many workers.Julia F. Knight - 1990 - Annals of Pure and Applied Logic 48 (3):237-259.

Add more citations

References found in this work

No references found.

Add more references