Stratified languages

Journal of Symbolic Logic 57 (4):1366-1376 (1992)
We consider arbitrary stratified languages. We study structures which satisfy the same stratified sentences and we obtain an extension of Keisler's Isomorphism Theorem to this situation. Then we consider operations which are definable by a stratified formula and modify the `type' of their argument by one; we prove that for such an operation F the sentence c = F(c) and the scheme $\varphi(c) \leftrightarrow \varphi(F(c))$ , where φ(x) varies among all the stratified formulas with no variable other than x free, imply the same stratified {c}-sentences
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275371
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,664
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Thomas Forster (1990). Permutations and Stratified Formulae a Preservation Theorem. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (5):385-388.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

396 ( #5,240 of 1,902,964 )

Recent downloads (6 months)

2 ( #324,600 of 1,902,964 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.