Decision Methods in the Theory of Ordinals

  • J. Richard Büchi

Abstract

For an ordinal α, let RS(α), the restricted second order theory of [α, <], be the interpreted formalism containing the first order theory of [α, <] and quantification on monadic predicate variables, ranging over all subsets of α. For a cardinal γ, RS(α, γ) is like RS(α), except that the predicate variables are now restricted to range over subsets of α of cardinality less than γ. ω = ω 0 and ω 1 denote the first two infinite cardinals. In this note I will outline results concerning RS(α, ω 0), which were obtained in the Spring of 1964 (detailed proofs will appear in [8]), and the corresponding stronger results about RS(α, ω 1), which were obtained in the Fall of 1964.

Keywords

Congo 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. 1.
    J. R. Büchi, Weak second order arithmetic and finite automata, Z. Math. Logik Grundlagen Math. 6 (1960), 66–92.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    J. R. Büchi, On a decision method in restricted second order arithmetic, Proc. Int. Cong. Logic, Method, and Philos. Sci., 1960, Stanford Univ. Press, Stanford, Calif., 1962.Google Scholar
  3. 3.
    S. Feferman, Some recent work of Ehrenfeucht and Fraïssé, Summer Institute for Symbolic Logic, Cornell Univ., 1957, Commun. Research Div., Institute for Defense Analyses, 1960, pp. 201–209.Google Scholar
  4. 4.
    S. Feferman and R. L. Vaught, The first order properties of products of algebraic systems, Fund. Math. 47 (1959), 57–103.MathSciNetMATHGoogle Scholar
  5. 5.
    R. McNaughton, Reviews of Weak second order arithmetic and finite automata and On a decision method in restricted second order arithmetic by J. R. Büchi, J. Symb. Logic 28 (1963), 100–102.CrossRefGoogle Scholar
  6. 6.
    A. Ehrenfeucht, Application of games to some problems of mathematical logic, Bull. Acad. Polon. Sci. 5 (1957), 35–37.MathSciNetMATHGoogle Scholar
  7. 7.
    C. C. Elgot, Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc. 98 (1961), 21–51.MathSciNetCrossRefGoogle Scholar
  8. 8.
    J. R. Büchi, Transfinite automata recursions and weak second order theory of ordinals, Proc. Int. Cong. Logic, Method, and Philos. Sci., Jerusalem, 1964 (to appear).Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1990

Authors and Affiliations

  • J. Richard Büchi
    • 1
  1. 1.Ohio State UniversityUSA

Personalised recommendations