Decision methods in the theory of ordinals

DOI10.1090/S0002-9904-1965-11384-2zbMath0207.30904MaRDI QIDQ5608006

J. Richard Buchi

Publication date: 1965

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Ordinal and cardinal numbers (03E10)

Related Items (19)

Tree-automatic scattered linear orders ⋮ Space-bounded OTMs and REG ∞ ⋮ Pumping for ordinal-automatic structures1 ⋮ On elementary theories of ordinal notation systems based on reflection principles ⋮ Finite automata and ordinals ⋮ Determinization of ordinal automata ⋮ Finite state automata and monadic definability of singular cardinals ⋮ Schützenberger and Eilenberg theorems for words on linear orderings ⋮ Decidability of second-order theories and automata on infinite trees ⋮ Constructivizations of Boolean algebras ⋮ Theories of automata on \(\omega\)-tapes: a simplified approach ⋮ Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages ⋮ Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes ⋮ Löwenheim numbers for skeletons of varieties ⋮ COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS ⋮ Tree acceptors and some of their applications ⋮ Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) ⋮ Logic over words on denumerable ordinals ⋮ Monadic second-order logic on tree-like structures

Cites Work

• The first order properties of products of algebraic systems
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Unnamed Item
• Unnamed Item

This page was built for publication: Decision methods in the theory of ordinals