Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provides a rigorous way to transfer results between the two approaches, which should benefit both systems. * All authors contributed equally to this work. 1 Note that Matching logic was further developed in [6], where techniques from modal logic are employed for the theoretical development. s = φ for any w ∈ W s ; in this case we write M | s = φ . The deductive system of H Σ is recalled in 1 and the completeness theorem is proved in [9]. The hybridization of our many-sorted modal logic is developed using a combination of ideas and techniques from [1,2,3,5,7,8], but for this section we drew our inspiration mainly form [3]. We refer to [10] for some similar proofs of the results presented in this section.Hybrid logic is defined on top of modal logic by adding nominals, states variables and specific operators and binders. Nominals allow us to directly refer the worlds (states) of a model, since they are evaluated in singletons in any model. However, a nominal may refer different worlds in different models. The sorts will be denoted by s, t, . . . and by PROP = {PROP s } s∈S , NOM = {NOM s } s∈S and SVAR = {SVAR s } s∈S we will denote some countable S-sorted sets. The elements of PROP are ordinary propositional variables and they will be denoted p, q,. . .; the elements of NOM are called nominals and they will be denoted by j, k, . . .; the elements of SVAR are called state variables and they are denoted x, y, . . .. We shall assume that for any distinct sorts s = t ∈ S, the corresponding sets of propositional variables, nominals and state variables are distinct. A state symbol is a nominal or a state variable.Definition 1 (H Σ (∀) formulas). For any s ∈ S we define the formulas of sort s: φ s := p | j | y s | ¬φ s | φ s ∨ φ s | σ (φ s 1 , . . . , φ s n ) s | ∀x t φ s
