Rationalizability of Choice Functions on General Domains Without Full Transitivity∗ Walter Bossert ´ D´epartement de Sciences Economiques and C.R.D.E.

First Page		Document Content
Date: 2014-07-01 09:03:00 Mathematical logic Binary relation Transitive relation Transitive set Transitive closure Maximal element Preference Transitivity Structure Mathematics Order theory Mathematical structures		Rationalizability of Choice Functions on General Domains Without Full Transitivity∗ Walter Bossert ´ D´epartement de Sciences Economiques and C.R.D.E. Add to Reading List Source URL: cis.ier.hit-u.ac.jp Download Document from Source Website File Size: 312,19 KB Share Document on Facebook

	Elements of Mathematical Logic Michael Meyling May 24, 2013 2 DocID: 1v8gE - View Document
	INL (instantial neighborhood logic) - tableau, sequent calculus, interpolation Junhua Yu () Tsinghua University (Beijing, China @ Steklov Mathematical Institute DocID: 1v7WD - View Document
	List of Publications Ofer Arieli Books 1. A.Avron, O.Arieli. A.Zamansky. Theory of Effective Propositional Paraconsistent Logics. Studies in Logic, volume 75 (sub-series: Mathematical Logic and Foundations), College Publ DocID: 1v75y - View Document
	DraftNot to be quoted or cited without permission. Evidence and the hierarchy of mathematical theories Charles Parsons It is a well-known fact of mathematical logic, by now developed in considerable detail, t DocID: 1uWo1 - View Document
	Title : The Cultural Red King Effect Published in : The Journal of Mathematical Sociology Author : Cailin O’Connor Address : Department of Logic and Philosophy of Science, University of California, Irvine, 3151 Social DocID: 1uOFQ - View Document