Logic in Computer Science (LICS 1989)

Paper: μ-definable sets of integers (at LICS 1989)

Authors: Lubarsky, R.S.

Abstract

The μ-calculus is a language consisting of standard first-order finitary logic with a least fixed-point operator applicable to positive inductive definitions. The main theorem of this study is a set-theoretic characterization of the sets of integers definable in the μ-calculus. Another theorem used but not proved is a prenex normal form theorem for the μ-calculus

BibTeX

  @InProceedings{Lubarsky-definablesetsofinte,
    author = 	 {Lubarsky, R.S.},
    title = 	 {μ-definable sets of integers},
    booktitle =  {Proceedings of the Fourth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1989},
    year =	 1989,
    editor =	 {Rohit Parikh},
    month =	 {June}, 
    pages =      {343--352},
    location =   {Pacific Grove, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }