Order:
Disambiguations
Joel Spencer [6]Joel H. Spencer [2]
See also
  1. An Anarchy of Man : Cartesian and Post-Cartesian Representations of the Self in Selected Western Literature.Joel Spencer - unknown
    This Master of Arts thesis is in two parts: a novel, An Anarchy of Man, and an exegesis which places the novel in relation to philosophical concerns about the self and the way those concerns are portrayed in selected works of Western literature. The novel is set in Canberra and Sydney and tells the story of the relationship between two characters: Joe and Gin. It explores the way we in the modern Western world think about ourselves and those around us. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2.  5
    Saharon Shelah. Primitive Recursive Bounds for van der Waerden Numbers. Journal of the American Mathematical Society, Vol. 1 , Pp. 683–697. [REVIEW]Joel Spencer - 1990 - Journal of Symbolic Logic 55 (2):887-888.
  3.  7
    Succinct Definitions in the First Order Theory of Graphs.Oleg Pikhurko, Joel Spencer & Oleg Verbitsky - 2006 - Annals of Pure and Applied Logic 139 (1):74-109.
    We say that a first order sentence A defines a graph G if A is true on G but false on any graph non-isomorphic to G. Let L ) denote the minimum length of such a sentence. We define the succinctness function s ) to be the minimum L ) over all graphs on n vertices.We prove that s and q may be so small that for no general recursive function f we can have f)≥n for all n. However, for (...))
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  5
    The Complexity of Random Ordered Structures.Joel Spencer & Katherine St John - 2008 - Annals of Pure and Applied Logic 152 (1-3):174-179.
    We show that for random bit strings, Up, with probability, image, the first order quantifier depth D) needed to distinguish non-isomorphic structures is Θ, with high probability. Further, we show that, with high probability, for random ordered graphs, G≤,p with edge probability image, D)=Θ, contrasting with the results for random graphs, Gp, given by Kim et al. [J.H. Kim, O. Pikhurko, J. Spencer, O. Verbitsky, How complex are random graphs in first order logic? Random Structures and Algorithms 26 119–145] of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  5.  10
    Zero-One Laws with Variable Probability.Joel Spencer - 1993 - Journal of Symbolic Logic 58 (1):1-14.
  6.  4
    The Complexity of Random Ordered Structures.Joel H. Spencer & Katherine St John - 2008 - Annals of Pure and Applied Logic 152 (1):174-179.
    We show that for random bit strings, Up, with probability, image, the first order quantifier depth D) needed to distinguish non-isomorphic structures is Θ, with high probability. Further, we show that, with high probability, for random ordered graphs, G≤,p with edge probability image, D)=Θ, contrasting with the results for random graphs, Gp, given by Kim et al. [J.H. Kim, O. Pikhurko, J. Spencer, O. Verbitsky, How complex are random graphs in first order logic? Random Structures and Algorithms 26 119–145] of (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark  
  7.  4
    Review: Saharon Shelah, Primitive Recursive Bounds for Van der Waerden Numbers. [REVIEW]Joel Spencer - 1990 - Journal of Symbolic Logic 55 (2):887-888.
  8. The Strange Logic of Random Graphs.Joel H. Spencer - 2001
    No categories
     
    Export citation  
     
    Bookmark