A coding of the countable linear orderings
Studia Logica 49 (4):585 - 590 (1990)
| Abstract | Associate to any linear ordering on the integers the mapping whose value on n is the cardinality of {kn; kn}: a purely combinatorial characterization for the mappings associated to the well-orderings is established. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
|
| Through your library | Configure |
James Loveys & Predrag Tanović (1996). Countable Models of Trivial Theories Which Admit Finite Coding. Journal of Symbolic Logic 61 (4):1279-1286.
Begoña Carrascal (1994). Caracterización en lenguajes lógicos infinitarios de los órdenes parciales diseminados contables. Theoria 9 (1):173-184.
Begoña Carrascal (1994). Caracterización En Lenguajes Lógicos Infinitarios de Los Órdenes Parciales Diseminados Contables. Theoria 9 (1):173-184.
Ursula Martin & Elizabeth Scott (1997). The Order Types of Termination Orderings on Monadic Terms, Strings and Monadic Terms, Strings and Multisets. Journal of Symbolic Logic 62 (2):624-635.
Su Gao (2001). Some Dichotomy Theorems for Isomorphism Relations of Countable Models. Journal of Symbolic Logic 66 (2):902-922.
Robert Bonnet & Matatyahu Rubin (1991). Elementary Embedding Between Countable Boolean Algebras. Journal of Symbolic Logic 56 (4):1212-1229.
Antonio Montalbán (2005). Up to Equimorphism, Hyperarithmetic Is Recursive. Journal of Symbolic Logic 70 (2):360 - 378.
Juha Oikkonen (1992). A Recursion Principle for Linear Orderings. Journal of Symbolic Logic 57 (1):82-96.
C. J. Ash (1991). A Construction for Recursive Linear Orderings. Journal of Symbolic Logic 56 (2):673-683.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

