Implicitly definable generalized quantifiers
classification
🧮 math.LO
keywords
definableimplicitlylogicquantifierselementaryequippedexplicitlyfef12
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.