Order:
Disambiguations
Robert E. Woodrow [5]Robert Woodrow [2]Ross Woodrow [1]R. E. Woodrow [1]
R. Woodrow [1]
  1.  33
    Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
    We give two examples. T 0 has nine countable models and a nonprincipal 1-type which contains infinitely many 2-types. T 1 has four models and an inessential extension T 2 having infinitely many models.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  22
    Ultrahomogeneous Structures.Bruce I. Rose & Robert E. Woodrow - 1981 - Mathematical Logic Quarterly 27 (2‐6):23-30.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  32
    Ultrahomogeneous Structures.Bruce I. Rose & Robert E. Woodrow - 1981 - Mathematical Logic Quarterly 27 (2-6):23-30.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  12
    Equimorphy: the case of chains.C. Laflamme, M. Pouzet & R. Woodrow - 2017 - Archive for Mathematical Logic 56 (7-8):811-829.
    Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we provide structure results for chains having less than continuum many isomorphism classes of equimorphic chains. We deduce as a corollary that any chain has either a single isomorphism class of equimorphic chains or infinitely many.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Reading Pictures: the Impossible Dream?Ross Woodrow - 2010 - Analysis and Metaphysics 9:62-75.
    In this paper I chart the seismic shift that has occurred over the past three decades in attitudes towards the interpretation of visual images. My strategy implies the argument that the reading of visual images would appear to be an inevitability given the accelerating change of attitudes towards pictures as containers of determinate knowledge. French critical theorists (Foucault, Barthes, Derrida et. al.) dominated debate on interpretation of text and image in the 1980s, where my survey begins. Michel Foucault dismissed the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  81
    A note on countable complete theories having three isomorphism types of countable models.Robert E. Woodrow - 1976 - Journal of Symbolic Logic 41 (3):672-680.
    With quantifier elimination and restriction of language to a binary relation symbol and constant symbols it is shown that countable complete theories having three isomorphism types of countable models are "essentially" the Ehrenfeucht example [4, $\s6$ ].
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  47
    Countable structures of given age.H. D. Macpherson, M. Pouzet & R. E. Woodrow - 1992 - Journal of Symbolic Logic 57 (3):992-1010.
    Let L be a finite relational language. The age of a structure M over L is the set of isomorphism types of finite substructures of M. We classify those ages U for which there are less than 2ω countably infinite pairwise nonisomorphic L-structures of age U.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  25
    A complete theory with arbitrarily large minimality ranks.Robert E. Woodrow & Julia F. Knight - 1983 - Journal of Symbolic Logic 48 (2):321-328.
    An example is given of a complete theory with minimal models of arbitrarily large minimality rank.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  74
    A Reduction Theorem for the Kripke–Joyal Semantics: Forcing Over an Arbitrary Category can Always be Replaced by Forcing Over a Complete Heyting Algebra. [REVIEW]Imants Barušs & Robert Woodrow - 2013 - Logica Universalis 7 (3):323-334.
    It is assumed that a Kripke–Joyal semantics \({\mathcal{A} = \left\langle \mathbb{C},{\rm Cov}, {\it F},\Vdash \right\rangle}\) has been defined for a first-order language \({\mathcal{L}}\) . To transform \({\mathbb{C}}\) into a Heyting algebra \({\overline{\mathbb{C}}}\) on which the forcing relation is preserved, a standard construction is used to obtain a complete Heyting algebra made up of cribles of \({\mathbb{C}}\) . A pretopology \({\overline{{\rm Cov}}}\) is defined on \({\overline{\mathbb{C}}}\) using the pretopology on \({\mathbb{C}}\) . A sheaf \({\overline{{\it F}}}\) is made up of sections of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark