28 citations · 54 across the 12 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.LO2012
A computability theoretic equivalent to Vaught's conjecture
Antonio Montalban
We prove that, for every theory which is given by an sentence, has less than many countable models if and only if we have that, for ev…
math.LO2012★ 3 cited
Computing Maximal Chains
Alberto Marcone, Antonio Montalbán, Richard A. Shore
In 1967 Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that…