Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts

For a pseudovariety of ordered semigroups, let be the class of sofic subshifts whose syntactic semigroup lies in . It is proved that if contains then is closed under taking shift equivalent subshifts, and conversely, if is closed under taking conjugate subshifts then contains and . Almost finite type subshifts are characterized as the irreducible elements of , which gives a new proof that the class of almost finite type subshifts is closed under taking shift equivalent subshifts.     

Kripke semantics for provability logic GLP

A well-known polymodal provability logic due to Japaridze is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic. This system plays an important role in some recent applications of provability algebras in proof theory. However, an obstacle in the study of is that it is incomplete w.r.t. any class of Kripke frames. In this paper we provide a complete Kripke semantics for . First, we isolate a certain subsystem of that is sound and complete w.r.t. a nice class of finite frames. Second, appropriate models for are defined as the limits of chains of finite expansions of models for . The techniques involves unions of n-elementary chains and inverse limits of Kripke models. All the results are obtained by purely modal-logical methods formalizable in elementary arithmetic.