# Henkin vs. "Full" Semantics for Second-order Logic and Multi-Sorted First Order Interpretations

In this paper by Jeff Ketland, he notes:

With Henkin semantics, the Completeness, Compactness and Löwenheim-Skolem Theorems all hold, because Henkin structures can be re-interpreted as many-sorted first-order structures.

What is it about the full semantics for second-order logic that defies re-interpretation into a many-sorted first-order logic?

• You might find these references interesting: plato.stanford.edu/entries/logic-higher-order/… , as well as here for background plato.stanford.edu/entries/logic-higher-order/… Basically translating SOL with Henkin/general semantics into (many-sorted) FOL and back, citing the following as a reference: Manzano, María, 1996, Extensions of First Order Logic, (Cambridge Tracts in Theoretical Computer Science 19), Cambridge: Cambridge University Press. Jan 16 at 16:47

Many-sorted first-order logic does not place any internal, logical, requirement on the relationship of the domains of the various sorts. In particular, then, a two-sorted logic, with one sort running over "objects" and another sort running over "properties", places no particular logical requirement on the relationship of the domains. It doesn't require, for example, that if there are $\kappa$ objects, then there are $2^{\kappa}$ properties. By contrast, full semantics for second-order logic does require this, by requiring that the second-order quantifiers running over properties (thought of extensionally) do run over the full powerset of the domain of the first-order quantifiers -- indeed, that's what makes it "full"!

• Would it be correct to interpret this as analogous to Hilbert's quote about his axiomatization of Euclidean geometry (loosely translated): "One must always be able to replace points, lines, and planes, with tables, chairs, and beer mugs"? Jun 12, 2022 at 4:47

Full semantics differ from Henkin semantics In only one germane way: rather than considering arbitrary Henkin structures, full semantics considers only full structures. That shows immediately why e.g. the completeness theorem fails for full semantics:

• Completeness: A formula is provable in second order logic if and only if the formula holds in all Henkin structures

• Not every Henkin structure is a full structure, and there are formulas true in every full structure but not every Henkin structure

From the right point of view, it really is that straightforward.

• Yes, between yours and Peter's answer it is really straightforward. It's one of those things that, once pointed out, seems completely obvious. Jun 14, 2013 at 17:37