Abstract
Abstract By limiting the range of the predicate variables in a second-order language, one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note, we provide an infinitary strongly complete axiomatization for several systems of this kind having the range of the predicate variables as a parameter. The completeness argument uses simple techniques from the theory of Boolean algebras. This article is dedicated to our friend John N. Crossley on the occasion of his 86th birthday.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
