We note that the Peircean and Ockhamist branching time logics, as well as their computational variants, have the finite model property and are decidable. Proofs of decidability of the respective logics can be found in e.g. Burgess (1980); Emerson and Sistla (1984); Gurevich and Shelah (1985); Emerson and Halpern (1985); Emerson (1990); Goldblatt (1992); Gabbay et al. (1994); Finger et al. (2002); and Demri et al. (2016).