Implicitly definable generalized quantifiers
Fredrik Engstr\"om

TL;DR
This paper provides a new elementary proof showing that quantifiers implicitly definable in second-order logic with Henkin semantics are also explicitly definable in first-order logic, simplifying understanding of their definability.
Contribution
It introduces a novel elementary proof of a key theorem relating implicit and explicit definability of quantifiers under Henkin semantics.
Findings
Implicitly definable quantifiers in second-order logic are explicitly definable in first-order logic.
The proof simplifies previous complex arguments.
Clarifies the relationship between second-order and first-order definability.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · Advanced Topology and Set Theory
