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. (...) Chapter One considers the view of the self in the work of the philosopher Rene Descartes and explores how this view is portrayed in three contemporary Australia novels, and in An Anarchy of Man. Chapter Two examines post-Cartesian views of the self, especially those in the work of the philosopher Ludwig Wittgenstein, and then considers the way the self is portrayed in Proust's Remembrance of Things Past, and in my own An Anarchy of Man. Chapter Three examines postmodern conceptions of the self and considers how these conceptions are portrayed in the work of the contemporary American novelist Don DeLillo and in my own An Anarchy of Man. (shrink)

The study of random graphs was begun in the 1960s and now has a comprehensive literature. This excellent book by one of the top researchers in the field now joins the study of random graphs (and other random discrete objects) with mathematical logic. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures.

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 (...) the function q*=maxi≤nq, which is the least nondecreasing function bounding q from above, we have q*=)log*n, where log*n equals the minimum number of iterations of the binary logarithm sufficient to lower n to 1 or below.We show an upper bound qshrink)

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 (...) D)=log1/pn+O. (shrink)

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 (...) D)=log1/pn+O. (shrink)