Abstract
We investigate the logic L(αα) which allows the second-order quantifier "ααs' meaning "for almost all countable sets s." We prove Completeness, Compactness, and Omitting Types Theorems and develop a Gentzen-style proof theory for this logic, as well as for the infinitary version LA(αα). Relations with various sublogics like L(Q) are discussed. © 1978.
Cite
CITATION STYLE
APA
Barwise, J., Kaufmann, M., & Makkai, M. (1978). Stationary logic. Annals of Mathematical Logic, 13(2), 171–224. https://doi.org/10.1016/0003-4843(78)90003-7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free