Intermediate predicate logics determined by ordinals

Journal of Symbolic Logic 55 (3):1099-1124 (1990)
For each ordinal $\alpha > 0, L(\alpha)$ is the intermediate predicate logic characterized by the class of all Kripke frames with the poset α and with constant domain. This paper will be devoted to a study of logics of the form L(α). It will be shown that for each uncountable ordinal of the form α + η with a finite or a countable $\eta (> 0)$ , there exists a countable ordinal of the form β + η such that L(α + η) = L(β + η). On the other hand, such a reduction of ordinals to countable ones is impossible for a logic L(α) if α is an uncountable regular ordinal. Moreover, it will be proved that the mapping L is injective if it is restricted to ordinals less than ω ω , i.e. α ≠ β implies L(α) ≠ L(β) for each ordinal $\alpha,\beta
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274476
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,820
Through your library
References found in this work BETA
Ordered Sets R and Q as Bases of Kripke Models.Mitio Takano - 1987 - Studia Logica 46 (2):137 - 148.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
203 ( #22,465 of 2,210,137 )

Recent downloads (6 months)
5 ( #101,012 of 2,210,137 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature