Hostname: page-component-cb9f654ff-r5d9c Total loading time: 0 Render date: 2025-08-18T12:09:06.050Z Has data issue: false hasContentIssue false
  • English
  • Français

Nonaxiomatizability results for infinitary systems

Published online by Cambridge University Press:  12 March 2014

Carol Karp
Carol Karp*
Affiliation:
University of Maryland
Get access Rights & Permissions [Opens in a new window]

Extract

Methods are being developed for treating questions of decidability in fewer than Ω steps, Ω being a regular nondenumerable cardinal. In this paper we consider the set-theoretical predicate Taut(x), “x is a tautology,” taken in the infinitary sense. In case x is hereditarily finite there is no question that it is decidable in finitely many steps. But what if x is infinite? We are not assuming that x is in any way constructive or even that the propositional formulas can be well-ordered, so it is not appropriate to treat this predicate as one of natural numbers or even as one of ordinals.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 32 , Issue 3 , 09 October 1967 , pp. 367 - 384
Copyright
Copyright © Association for Symbolic Logic 1967

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Chang, C. C., On the representation of α-complete Boolean algebras, Transactions of the American Mathematical Society, vol. 85 (1957), pp. 208–218.Google Scholar
[2]Karp, C., Languages with expressions of infinite length, North-Holland, Amsterdam, 1964, 183 pp.Google Scholar
[3]Kripke, S., Transfinite recursions on admissible ordinals (abstract), this Journal, vol. 29 (1964), p. 161.Google Scholar
[4]Lévy, A., A hierarchy of formulas in set theory, Memoirs of the American Mathematical Society, No. 57 (1965), 76 pp.Google Scholar
[5]Lévy, A. and Machover, M., Recursive functions of ordinal numbers, North-Holland, Amsterdam (forthcoming).Google Scholar
[6]Machover, M., The theory of transfinite recursion, Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 575–578.CrossRefGoogle Scholar
[7]Pierce, R. S., A generalization of atomic Boolean algebras, Pacific journal of mathematics, vol. 9 (1959), pp. 175–182.CrossRefGoogle Scholar
[8]Smith, E. C. jr., A distributivity condition for Boolean algebras, Annals of mathematics, vol. 64 (1956), pp. 551–561.CrossRefGoogle Scholar
[9]Takeuti, G., On the recursive functions of ordinal numbers, Journal of the Mathematical Society of Japan, vol. 12 (1960), pp. 119–128.CrossRefGoogle Scholar
[10]Tugué, T., On the partial recursive functions of ordinal numbers, Journal of the Mathematical Society of Japan, vol. 16 (1964), pp. 1–31.CrossRefGoogle Scholar