-
25The complexity of random ordered structuresAnnals 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
-
18The timing of attentional modulation of visual processing as indexed by ERPsIn Laurent Itti, Geraint Rees & John K. Tsotsos (eds.), Neurobiology of Attention, Academic Press. 2005.
-
10The complexity of random ordered structuresAnnals 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
-
Mount Royal UniversityUndergraduate
Calgary, Alberta, Canada