Help


[permalink] [id link]
+
Page "Put–call parity" ¶ 40
from Wikipedia
Edit
Promote Demote Fragment Fix

Some Related Sentences

** and Put-Call
** The Ancient Roots of Modern Financial Innovation: The Early History of Regulatory Arbitrage, Michael Knoll's history of Put-Call Parity

** and Parity
** Parity of a permutation, indicates whether a permutation has an even or odd number of inversions
** Parity function, a Boolean function whose value is 1 if the input vector has an odd number of ones
** Parity flag in computing, indicates if the number of set bits is odd or even in the binary representation of the result of the last operation
** Parity bit in computing, sets the parity of transmitted data for the purpose of error detection
** Parity file in data processing, created in conjunction with data files and used to check data integrity and assist in data recovery
** Parity or ECC ( including single device correction ) protection of memory components ( cache and system memory ), as well as memory bus ; bad cache line disabling ; memory scrubbing ; memory sparing ; bad page offlining ; redundant bit steering ; redundant array of independent memory ( RAIM ).

** and Arbitrage
** Arbitrage Relationships for Options, Prof. Thayer Watkins
** Option Arbitrage Relations, Prof. Campbell R. Harvey

** and Opportunity
** Office of Equal Employment Opportunity Affairs
** Director of Equal Employment Opportunity:
** Opportunity rover
** U. S. Equal Employment Opportunity Commission ( EEOC ) ( US ) – the branch of the U. S. government that enforces equal opportunity laws in workplaces.
** Department of the Interior Office for Equal Opportunity ( US )
** Subcommittee on Insurance, Housing and Community Opportunity
** Subcommittee on Insurance, Housing and Community Opportunity
** Subcommittee on Insurance, Housing and Community Opportunity
** Subcommittee on Housing and Community Opportunity
** Subcommittee on Housing and Community Opportunity
** Subcommittee on Insurance, Housing and Community Opportunity ( Ranking Member )
** Subcommittee on Insurance, Housing and Community Opportunity ( Chairwoman )
** United States House Financial Services Subcommittee on Housing and Community Opportunity
** Subcommittee on Insurance, Housing and Community Opportunity
** Subcommittee on Insurance, Housing and Community Opportunity
** Mars Exploration Rovers, Spirit and Opportunity
** Microsoft keynote speech: " The Future of Games: Unlocking the Opportunity " by J Allard, corporate vice president and chief XNA architect.
** Subcommittee on Insurance, Housing and Community Opportunity ;
** Subcommittee on Housing and Community Opportunity
** Subcommittee on Insurance, Housing and Community Opportunity
** Opportunity rover timeline for 2004 April
** Opportunity rover timeline for 2005 March
** Opportunity rover timeline for 2005 April
** Subcommittee on Economic Opportunity

** and .
** Eunectes murinus, the green anaconda, the largest species, is found east of the Andes in Colombia, Venezuela, the Guianas, Ecuador, Peru, Bolivia, Brazil and on the island of Trinidad.
** Eunectes notaeus, the yellow anaconda, a smaller species, is found in eastern Bolivia, southern Brazil, Paraguay and northeastern Argentina.
** Eunectes deschauenseei, the dark-spotted anaconda, is a rare species found in northeastern Brazil and coastal French Guiana.
** Eunectes beniensis, the Bolivian anaconda, the most recently defined species, is found in the Departments of Beni and Pando in Bolivia.
** Well-ordering theorem: Every set can be well-ordered.
** Tarski's theorem: For every infinite set A, there is a bijective map between the sets A and A × A.
** Trichotomy: If two sets are given, then either they have the same cardinality, or one has a smaller cardinality than the other.
** The Cartesian product of any family of nonempty sets is nonempty.
** König's theorem: Colloquially, the sum of a sequence of cardinals is strictly less than the product of a sequence of larger cardinals.
** Every surjective function has a right inverse.
** Zorn's lemma: Every non-empty partially ordered set in which every chain ( i. e. totally ordered subset ) has an upper bound contains at least one maximal element.
** Hausdorff maximal principle: In any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset.
** Tukey's lemma: Every non-empty collection of finite character has a maximal element with respect to inclusion.
** Antichain principle: Every partially ordered set has a maximal antichain.
** Every vector space has a basis.
** Every unital ring other than the trivial ring contains a maximal ideal.
** For every non-empty set S there is a binary operation defined on S that makes it a group.
** The closed unit ball of the dual of a normed vector space over the reals has an extreme point.
** Tychonoff's theorem stating that every product of compact topological spaces is compact.
** In the product topology, the closure of a product of subsets is equal to the product of the closures.
** If S is a set of sentences of first-order logic and B is a consistent subset of S, then B is included in a set that is maximal among consistent subsets of S. The special case where S is the set of all first-order sentences in a given signature is weaker, equivalent to the Boolean prime ideal theorem ; see the section " Weaker forms " below.
** Any union of countably many countable sets is itself countable.

0.196 seconds.