Page 1

Displaying 1 – 4 of 4

Showing per page

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

Alexis Bès (2002)

Fundamenta Mathematicae

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.

Currently displaying 1 – 4 of 4

Page 1