Preliminaries Problem representation Search systems

First Page		Document Content
Date: 2015-04-29 02:58:54 Total order Finitary relation Graph Cartesian product Equivalence relation Transitive closure Mathematics Order theory Binary relation		Preliminaries Problem representation Search systems Add to Reading List Source URL: www.atomki.hu Download Document from Source Website File Size: 751,92 KB Share Document on Facebook

	10 Voting in Combinatorial Domains J´erˆome Langa and Lirong Xiab 10.1 Motivations and classes of problems This chapter addresses preference aggregation and voting on domains which are the Cartesian product (or sometim DocID: 1tQmi - View Document
	Internal Completeness of Categories of Domains Paul Taylor 1985 This paper was presented at Category Theory and Computer Programming bf 1, University of Surrey (Guildford), SeptemberIt was published in Springer-Ve DocID: 1rqwq - View Document
	Cartesian Closure for Stable Categories (draft) Paul Taylor DocID: 1rpTZ - View Document
	Classical Mechanics, Lecture 19 March 13, 2008 lecture by John Baez notes by Alex Hoffnung 1 DocID: 1pY2p - View Document
	The Trace Factorisation of Stable Functors Paul Taylor 1998 Abstract A functor is stable if it has a left adjoint on each slice. Such functors arise as forgetful functors from categories of models of disjunctive theories DocID: 1pEJ6 - View Document