Reducts of the random graph
Journal of Symbolic Logic 56 (1):176-181 (1991)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesD. Marker & A. Pillay (1990). Reducts of (C, +, ⋅) Which Contain +. Journal of Symbolic Logic 55 (3):1243-1251.
Ya'acov Peterzil (1993). Reducts of Some Structures Over the Reals. Journal of Symbolic Logic 58 (3):955-966.
Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Peter Spirtes (2005). Graphical Models, Causal Inference, and Econometric Models. Journal of Economic Methodology 12 (1):3-34.
James F. Lynch (1997). Infinitary Logics and Very Sparse Random Graphs. Journal of Symbolic Logic 62 (2):609-623.
J. F. Pabion (1982). Saturated Models of Peano Arithmetic. Journal of Symbolic Logic 47 (3):625-637.
Steve Warner (2001). The Cofinality of the Random Graph. Journal of Symbolic Logic 66 (3):1439-1446.
J. C. E. Dekker (1981). Twilight Graphs. Journal of Symbolic Logic 46 (3):539-571.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #234,650 of 556,837 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
