2000 character limit reached
Implicitly definable generalized quantifiers
Published 14 Oct 2014 in math.LO | (1410.3625v1)
Abstract: We give a new elementary proof of the main theorem of [Fef12]: Quantifiers implicitly definable in pure second-order logic equipped with Henkin semantics implies are (explicitly) definable in first-order logic.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.