The language of Stratified Sets is confluent and strongly normalising

Research output: Contribution to journalArticle

12 Downloads (Pure)

Abstract

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.
Original languageEnglish
Article number12
JournalLogical Methods in Computer Science
Volume14
Issue number2
DOIs
Publication statusPublished - 22 May 2018

Fingerprint Dive into the research topics of 'The language of Stratified Sets is confluent and strongly normalising'. Together they form a unique fingerprint.

  • Cite this