This article studies seriously actualistic quantified modal logics. A key component of the language is an abstraction operator by means of which predicates can be created out of complex formulas. This facilitates proof of a uniform substitution theorem: if a sentence is logically true, then any sentence that results from substituting a predicate abstract for each occurrence of a simple predicate abstract is also logically true. This solves a problem identified by Kripke early in the modern semantic study of quantified modal logic. A tableau proof system is presented and proved sound and complete with respect to logical truth. The main focus is on seriously actualistic T, an extension of T, but the results established hold also for systems based on other propositional modal logics. Following Menzel it is shown that the formal language studied also supports an actualistic account of truth simpliciter.