I'm looking for a formal, mathematically-minded introduction to contemporary generative grammar theory, where all the concepts, such as dominance, c-command, government, etc. are defined formally in mathematical terms.
An example for the kind of text I'm interested in is this set of notes.
This set of notes is great; however, I am looking for other texts, ideally at least two more, so that if one of them has an error or inconsistency, I can consult the others for a clarification.
For example, the concept of dominance as defined in the above set of notes (on p. 45) is irreflexive, i.e. a node doesn't dominate itself, but then later, in defining c-command (immediately following definition 6.50 on p. 521), it makes a distinction between proper and unqualified dominance. This is an inconsistency.
This was just one example; there are others, hence the quest for other texts.
It is crucial that the approach be mathematically-oriented, since it has been my experience with non-mathematical textbooks on generative grammar that they are simply not sufficiently precise.
For instance, when defining the concept of dominance most don't even address the question of whether they consider this relation to be reflexive or not, and the one reference that I found – let's call it UPENN – that did address this question, defines it as reflexive, in contradiction to the way this term is used elsewhere. Consequently, UPENN's definition of such concepts as c-command is different to those found elsewhere, for instance it is implied by UPENN's definition that a node doesn't c-command itself.