Transitive set

Results: 24



#Item
1Appendix A Sets, Relations and Functions Summary This chapter explains the basics of formal set notation, and gives an introduction to relations and functions. The chapter ends with a short account of the principle of pr

Appendix A Sets, Relations and Functions Summary This chapter explains the basics of formal set notation, and gives an introduction to relations and functions. The chapter ends with a short account of the principle of pr

Add to Reading List

Source URL: www.cs.otago.ac.nz

Language: English - Date: 2011-05-20 05:24:57
2Intuitionistic Sets and Ordinals Paul Taylor 1993 Abstract Transitive extensional well founded relations provide an intuitionistic notion of ordinals

Intuitionistic Sets and Ordinals Paul Taylor 1993 Abstract Transitive extensional well founded relations provide an intuitionistic notion of ordinals

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:52:19
3INFINITELY TRANSITIVE ACTIONS ON REAL AFFINE SUSPENSIONS ´ ERIC ´ KARINE KUYUMZHIYAN AND FRED MANGOLTE Abstract. A group G acts infinitely transitively on a set Y if for every positive integer m, its

INFINITELY TRANSITIVE ACTIONS ON REAL AFFINE SUSPENSIONS ´ ERIC ´ KARINE KUYUMZHIYAN AND FRED MANGOLTE Abstract. A group G acts infinitely transitively on a set Y if for every positive integer m, its

Add to Reading List

Source URL: math.univ-angers.fr

Language: English - Date: 2013-05-28 07:57:34
4Math Primer Andrzej Wasowski ˛  February 12, 2007 Please, report all the bugs you can spot to the author!

Math Primer Andrzej Wasowski ˛ February 12, 2007 Please, report all the bugs you can spot to the author!

Add to Reading List

Source URL: itu.dk

Language: English - Date: 2016-07-31 05:28:08
5Rationalizability of Choice Functions on General Domains Without Full Transitivity∗ Walter Bossert ´ D´epartement de Sciences Economiques and C.R.D.E.

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

Language: English - Date: 2014-07-01 09:03:00
6Jointly Combining Implicit Constraints Improves Temporal Ordering Nathanael Chambers and Dan Jurafsky Department of Computer Science Stanford University Stanford, CA 94305 {natec,jurafsky}@stanford.edu

Jointly Combining Implicit Constraints Improves Temporal Ordering Nathanael Chambers and Dan Jurafsky Department of Computer Science Stanford University Stanford, CA 94305 {natec,jurafsky}@stanford.edu

Add to Reading List

Source URL: cs.stanford.edu

Language: English - Date: 2008-09-30 12:05:11
7MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson  Problem: Given a proofnet in multiplicative linear

MLL normalization and transitive closure: circuits, complexity, and Euler tours Harry Mairson Problem: Given a proofnet in multiplicative linear

Add to Reading List

Source URL: www.cs.brandeis.edu

Language: English - Date: 2008-03-28 12:21:03
8Preferential Semantics using Non-smooth Preference Relations∗ XXX January 10, 2013  Abstract

Preferential Semantics using Non-smooth Preference Relations∗ XXX January 10, 2013 Abstract

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2013-01-11 03:16:39
9The Set Constraint/CFL Reachability Connection in Practice John Kodumal Alex Aiken

The Set Constraint/CFL Reachability Connection in Practice John Kodumal Alex Aiken

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-04-22 02:37:00
10A Computational Analysis of the Tournament Equilibrium Set

A Computational Analysis of the Tournament Equilibrium Set

Add to Reading List

Source URL: www.aaai.org

Language: English - Date: 2008-06-08 00:30:50