2 research outputs found
The language of Stratified Sets is confluent and strongly normalising
We study the properties of the language of Stratified Sets (first-order logic
with and a stratification condition) as used in TST, TZT, and (with
stratifiability instead of stratification) in Quine's NF. We find that the
syntax forms a nominal algebra for substitution and that stratification and
stratifiability imply confluence and strong normalisation under rewrites
corresponding naturally to -conversion.Comment: arXiv admin note: text overlap with arXiv:1406.406
The language of Stratified Sets is confluent and strongly normalising
We study the properties of the language of Stratified Sets (first-order logic
with and a stratification condition) as used in TST, TZT, and (with
stratifiability instead of stratification) in Quine's NF. We find that the
syntax forms a nominal algebra for substitution and that stratification and
stratifiability imply confluence and strong normalisation under rewrites
corresponding naturally to -conversion