Concerning n-tactics in the countable-finite game

Journal of Symbolic Logic 56 (3):786-794 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1183743727

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

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

Finitary sketches.J. Adámek, P. T. Johnstone, J. A. Makowsky & J. Rosický - 1997 - Journal of Symbolic Logic 62 (3):699-707.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
ℵ0-categorical modules.Walter Baur - 1975 - Journal of Symbolic Logic 40 (2):213 - 220.
On atomic or saturated sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.
Mating strategies as game theory: Changing rules?Linda Mealey - 2000 - Behavioral and Brain Sciences 23 (4):613-613.
On countable simple unidimensional theories.Anand Pillay - 2003 - Journal of Symbolic Logic 68 (4):1377-1384.
Variations on a game of Gale (I): Coding strategies.Marion Scheepers - 1993 - Journal of Symbolic Logic 58 (3):1035-1043.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
On coherent families of finite-to-one functions.Piotr Koszmider - 1993 - Journal of Symbolic Logic 58 (1):128-138.

Analytics

Added to PP
2009-01-28

Downloads
16 (#904,500)

6 months
8 (#356,676)

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

Add more references