Extending Partial Orders to Dense Linear Orders (1996)

Cached

Download Links

by Theodore A. Slaman , W. Hugh Woodin
Venue:Ann. Pure and Appl. Logic
Citations:4 - 0 self

Active Bibliography

The Hilbert problems and Hilbert’s Program – Stephen G. Simpson - 2008
7 EQUIVALENCE BETWEEN FRAÏSSÉ’S CONJECTURE AND JULLIEN’S THEOREM. – Antonio Montalbán - 2004
3 Finiteness theorems in stochastic integer programming – Matthias Aschenbrenner, Raymond Hemmecke - 2003
BQO is Π1 2-complete – Alberto Marcone - 1994
6 UP TO EQUIMORPHISM, HYPERARITHMETIC IS RECURSIVE – Antonio Montalbán
1 THE MAXIMAL LINEAR EXTENSION THEOREM IN SECOND ORDER ARITHMETIC – Alberto Marcone, Richard, A. Shore
9 On the logical strength of Nash-Williams’ theorem on transfinite sequences – Alberto Marcone - 1996
8 Reverse mathematics and the equivalence of definitions for well and better quasi-orders – Peter Cholak, Alberto Marcone, Reed Solomon - 2004
7 Separable Banach space theory needs strong set existence axioms – A. James Humphreys, Stephen G. Simpson - 1996
3 On Fraïssé’s conjecture for linear orders of finite Hausdorff rank – Alberto Marcone, Antonio Montalbán - 2007
Effectively Closed Sets and Graphs of Computable Real Functions – unknown authors - 2002
Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic—Lambda Calculus and Related Systems; Mechanical Theorem Proving General Terms: Theory – Robin Adams, Zhaohui Luo
Proving Programs Terminate using Well Orderings, Ramsey Theory – Exposition William Gasarch
12 Notions of computability at higher types I – John Longley - 2005
1 Kleene’s Amazing Second Recursion Theorem (Extended Abstract) – Yiannis N. Moschovakis
effective – Yiannis N. Moschovakis
5 The history and concept of computability – Robert I. Soare - 1999
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
flattening is a second-order – Santiago Figueira, Daniel Gorín, Rafael Grimson - 2013