Motivated by the Ax-Kochen/Ershov principle, a large number of questions about henselian valued fields have been shown to reduce to analogous questions about the value group and residue field. In this paper, we investigate the burden of henselian valued fields in the threesorted Denef-Pas language. If T is a theory of henselian valued fields admitting relative quantifier elimination (in any characteristic), we show that the burden of T is equal to the sum of the burdens of its value group and residue field. As a consequence, T is NTP2 if and only if its residue field and value group are; the same is true for the statements “T is strong” and “T has finite burden.”

We consider two overlapping classes of fields, IAC and VAC, which are defined using valuation theory but which do not involve a distinguished valuation. Rather, each class is defined by a condition that quantifies over all possible valuations on the field. In his thesis, Hong asked whether these two classes are equal. In this paper, we give an example that negatively answers Hong's question. We also explore several situations in which the equivalence does hold with an additional assumption, including the case where every K' = K is IAC.

Midterm student feedback is a common process in post-secondary institutions that can lead to enhanced teaching practices and thereby potentially to higher ratings of instructional skills in summative course evaluations. At McMaster University, midterm student feedback is called a ‘Course Refinement’ and includes consultation with educational developers. As part of a multiphase study investigating teachers’ perceptions of the Course Refinement process and its impact, this analysis presents effective attributes of the process as an adaptation of Chickering and Gamson’s well-known ‘seven principles for good practice in undergraduate education’, as our findings align with their work. To our knowledge, this marks the first educational development adaptation of the ‘seven principles’.

The goal of this paper is to generalise Alex Rennet's proof of the non‐axiomatizability of the class of pseudo‐o‐minimal structures. Rennet showed that if is an expansion of the language of ordered fields and is the class of pseudo‐o‐minimal ‐structures (‐structures elementarily equivalent to an ultraproduct of o‐minimal structures) then is not computably axiomatizable. We give a general version of this theorem, and apply it to several classes of structures.