We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
This paper argues that exhaustification is empirically and theoretically important as a tool in the semantic description of various constructions in natural language. Discussion f...