Searching for "The Combinatorial Principle." – sorted by Relevance.
-
ANNALS OF PURE AND APPLIED LOGIC
- models of the form L[B]. We generalize to L[E] some combinatorial principles that were shown by Jensen
- Add To MetaCart
-
principles RT
- The strength of combinatorial principles can be accessed by their density \Lambda Andrey
- Add To MetaCart
-
Parallel Strategies
- Computer Science, Prague, Czech Republic February 15, 2001 Abstract We consider some combinatorial
- Cited by 1 (0 self) – Add To MetaCart
-
A Complexity Gap for Tree-Resolution
- combinatorial principle either is "easy" i.e. has polynomial size tree-resolution proofs or is "di#cult" i
- Cited by 13 (2 self) – Add To MetaCart
-
Indexed Squares
- In this paper we study some variations on Jensen's celebrated combinatorial principle (variously pronounced
- Cited by 6 (3 self) – Add To MetaCart
-
Models with second order properties V: A general principle
- -10] and others of the same type. The unifying factor is a combinatorial principle which we present in terms of a
- Cited by 1 (1 self) – Add To MetaCart
-
Proof complexity of pigeonhole principles
- , is probably the most extensively studied combinatorial principle. In this survey we try to summarize what
- Cited by 7 (1 self) – Add To MetaCart
-
Squares, Scales and Stationary Reflection
- of mathematics. These results have led to the systematic study of several combinatorial principles that have
- Cited by 12 (5 self) – Add To MetaCart
-
Review of: The Architecture of the Language Faculty , Ray Jackendoff (Brandeis University) Cambridge, MA: The MIT Press (Linguistic Inquiry monographs, edited by Samuel Jay Keyser, volume 28), 1997, xvi+262 pp; paperbound, ISBN 0-262-60025-0
- for- mal primitives and combinatorial principles. Because representational modules cannot communicate
- Add To MetaCart
-
Cutting plane and Frege proofs
- -existence of polynomial size resolution proofs for the pigeonhole principle. By using combinatorial arguments related
- Cited by 4 (3 self) – Add To MetaCart

