Decidability and definability results related to the elementary theory of ordinal multiplication

Alexis Bès

Fundamenta Mathematicae (2002)

  • Volume: 171, Issue: 3, page 197-211
  • ISSN: 0016-2736

Abstract

top
The elementary theory of ⟨α;×⟩, where α is an ordinal and × denotes ordinal multiplication, is decidable if and only if α < ω ω . Moreover if | r and | l respectively denote the right- and left-hand divisibility relation, we show that Th ω ω ξ ; | r and Th ω ξ ; | l are decidable for every ordinal ξ. Further related definability results are also presented.

How to cite

top

Alexis Bès. "Decidability and definability results related to the elementary theory of ordinal multiplication." Fundamenta Mathematicae 171.3 (2002): 197-211. <http://eudml.org/doc/286385>.

@article{AlexisBès2002,
abstract = {The elementary theory of ⟨α;×⟩, where α is an ordinal and × denotes ordinal multiplication, is decidable if and only if $α < ω^\{ω\}$. Moreover if $|_\{r\}$ and $|_\{l\}$ respectively denote the right- and left-hand divisibility relation, we show that Th $⟨ω^\{ω^\{ξ\}\};|_\{r\}⟩$ and Th $⟨ω^\{ξ\};|_\{l\}⟩$ are decidable for every ordinal ξ. Further related definability results are also presented.},
author = {Alexis Bès},
journal = {Fundamenta Mathematicae},
keywords = {decidability of ordinal multiplication},
language = {eng},
number = {3},
pages = {197-211},
title = {Decidability and definability results related to the elementary theory of ordinal multiplication},
url = {http://eudml.org/doc/286385},
volume = {171},
year = {2002},
}

TY - JOUR
AU - Alexis Bès
TI - Decidability and definability results related to the elementary theory of ordinal multiplication
JO - Fundamenta Mathematicae
PY - 2002
VL - 171
IS - 3
SP - 197
EP - 211
AB - The elementary theory of ⟨α;×⟩, where α is an ordinal and × denotes ordinal multiplication, is decidable if and only if $α < ω^{ω}$. Moreover if $|_{r}$ and $|_{l}$ respectively denote the right- and left-hand divisibility relation, we show that Th $⟨ω^{ω^{ξ}};|_{r}⟩$ and Th $⟨ω^{ξ};|_{l}⟩$ are decidable for every ordinal ξ. Further related definability results are also presented.
LA - eng
KW - decidability of ordinal multiplication
UR - http://eudml.org/doc/286385
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.