446 search results - page 59 / 90 » A Combinatorial Theorem for Trees |
APAL
2006
14 years 12 months ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
COMBINATORICS
2002
14 years 11 months ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
119
click to vote
CADE
2005
Springer
16 years 4 days ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
109
click to vote
TABLEAUX
1999
Springer
15 years 4 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
101
click to vote
CADE
1994
Springer
15 years 3 months ago
1994
Springer
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical ...