DocumentCode
2597600
Title
μ-definable sets of integers
Author
Lubarsky, Robert S.
Author_Institution
Franklin & Marshall Coll., Lancaster, PA, USA
fYear
1989
fDate
5-8 Jun 1989
Firstpage
343
Lastpage
352
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
Keywords
formal languages; set theory; μ-calculus; μ-definable sets of integers; integer sets; least fixed-point operator; positive inductive definitions; prenex normal form theorem; set theory; standard first-order finitary logic; Bismuth; Calculus; Educational institutions; Logic; Negative feedback; Reflection; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
Conference_Location
Pacific Grove, CA
Print_ISBN
0-8186-1954-6
Type
conf
DOI
10.1109/LICS.1989.39189
Filename
39189
Link To Document