profile picture

Katie John

Mount Royal University
 More details
Calgary, Alberta, Canada
  •  10
    The complexity of random ordered structures
    with Joel Spencer
    Annals of Pure and Applied Logic 152 (1-3): 174-179. 2008.
    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 2…Read more
    Logic and Philosophy of Logic
  •  18
    The timing of attentional modulation of visual processing as indexed by ERPs
    with Alberto Zani, Alice Mado Proverbio, I. Laurent, and R. Geraint
    In Laurent Itti, Geraint Rees & John K. Tsotsos (eds.), Neurobiology of Attention, Academic Press. 2005.
    Aspects of Consciousness
  •  25
    The complexity of random ordered structures
    with Joel H. Spencer
    Annals of Pure and Applied Logic 152 (1): 174-179. 2008.
    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 2…Read more
    Science, Logic, and Mathematics
  • Lukacs: Soul and Form (edited book)
    Columbia University Press. 2010.
    Eastern European Philosophy