Hostname: page-component-7bb8b95d7b-w7rtg Total loading time: 0 Render date: 2024-09-16T20:44:38.318Z Has data issue: false hasContentIssue false
  • English
  • Français

Second-order Ehrenfeucht games and the deciability of the second-order theory of an equivalence relation

Published online by Cambridge University Press:  09 April 2009

Richard L. Tenney
Richard L. Tenney
Affiliation:
University of MassachusettsComputer and Information Science Amherst 01002, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we extend a method of Ehrenfeucht and Fraissé to second-order theories and use this extension to prove the decidability of the second-order theory of an equivalence relation.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 20 , Issue 3 , November 1975 , pp. 323 - 331
Copyright
Copyright © Australian Mathematical Society 1975

References

Ehrenfeucht, A. (1961), ‘An application of games to the completeness problem for formalized theories’, Fundamenta Mathematicae 49, 129–141.CrossRefGoogle Scholar
Janiczak, A. (1953), ‘Undecidability of some simple formalized theories’, Fundamenta Mathematicae, 40, 131–139.Google Scholar
John, J. Le Torneau (1968), Decision Problems Related to the Concept of Operation (Ph.D. Thesis, Berkeley, 1968).Google Scholar
Nerode, Anil, Axiomatic Theories and Recursion Theory (unpublished).Google Scholar
Michael, O. Rabin (1969), ‘Decidability of second-order theories and automata on infinite trees’. Transactions of the American Mathematical Society 141, 1–35.Google Scholar