The PDF of the paper can be found here. My comment and understanding of the paper can be found in the essay Structure on Models and what follows are some other, mostly related, remarks.


Here I collect brief notes on particular topics connected or of particular interest for my First Bachelor Thesis Concept. On the same topic, see Halvorson, H. (2013), The semantic view, if plausible, is syntactic. For other papers by the same author, visit Hans Halvorson

Identity Crisis for Theories

In this part of the paper Halvorson presents three possible identity criteria for theories in the semantic view: for is a model .

  • exists s.t. is bij.
  • exists s.t. is bij. and .
  • These criteria, I believe, assume an intuition on , namely that it is no more than a set. For instance, if had some structure, like a partial order or the one of a group, one would define some equivalence relation as isomorphisms of such structures. For this reason I am interested in finding some further structure to so that some alternative equivalence relation as an isomorphism of such structures can be defined.
Partial Order

Following the usual construction of a maximally order set through the procedure of the Lindenbaum’s Lemma (see 7. Soundness and Completeness I, whose proof gives a practical grasp to the algorithm), one notices that for , is a partial order whose minimal element is and maximal elements of each chain are in . Following the previous reasonings one could now consider two other identity criteria for theories:

  • for isom.,

One might also consider: for isom., . Though clearly for is not defined since are only consistent sets, i.e. theories, but not structures. One could instead define:

  • for isom., It might be the case though that .

It would be then interesting to see whether , and are equivalent to one of the previously mentioned relation or if they are subject to the same critique.

Special Identities

Halvorson considers only those identity criteria that can be applied on all theories in full generality, just like the method I described above. Though, one might be willing, for some other reason, to consider only some theories in particular and define some equivalence relation not subject to Halvorson’s critique. I do not dive into the numerous possibilities here but want instead consider one precise method that goes in this direction which is strictly related to my First Bachelor Thesis Concept in particular to: Algebra on Worlds.

The thesis I want to argue for in part of my thesis is that, thanks to some structure on generators of ultrafilters, I am able to transfer such a structure up to ultraproducts (i.e. some models). For the sake of this comment, I will assume that there is some algebra on ultraproducts of a sequence of structures. More precisely I assume that there are some operations (of any arity) on is ultrafil. s.t. for any we have .

Now, in case ,

  • for is ultrafil. and operations .

The case rightfully seems not to be a probable one, though, since in we range on all and keep fixed, we might set , hence consider: is ultrafil. and its algebra. A relevant question here is: does hold for any theory?

If we have we can then define:

  • for is ultrafil..

Now back to the question, does hold for any theory? By Łos Theorem, for ultrafil. and , we have and since is ultrafil. , then hence, up to elem. equivalence, is ultrafil.. To get to a formal proof I should prove: (i) is ultrafil. and (ii) .

Technical Part

Here I summarise some of the results and definition that Halvorson states from page 191. is the language of the theory .

  • for , theories, preserving var. and arity of constants s.t. for each , p. 191 (Interpretation)
  • , interpretations s.t. , ( is weak inverse)
    • I don't see how concatenation of the functions can work here
  • interp. s.t. weak inv. of (, definitionally equivalent)
  • ,
    • |
    • there is a bij. s.t. . (p. 192bottom)
  • interp. s.t. weak inv. of , .
    • hence def.equiv. theories don’t have isom. models. (?)