Nominal sets are a sets-based first-order denotation for variables in logic and programming. In this paper we extend nominal sets to two-level nominal sets. These preserve much of the behaviour of nominal sets—including notions of variable and abstraction—but they include a denotation for variables and meta-variables. Meta-variables are interpreted as infinite lists of distinct variable symbols...

Based on a more realistic description of the in-depth secondary electron generation than that of standard (constant loss) model, a new model for the e-induced secondary electron emission yield, d = f(E), is applied to account for the observed mean atomic number dependence of the reduced yield curves (RYC), d=dmax 1⁄4 f ðE0=E0maxÞ of a wide variety of inorganic insulators. It is next used to ext...

Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For computational applications such as programming and formal reasoning, it is desirable to develop constructive type theories for nominal logic which extend standard type theories for propositional, firstor higher-order logic. This has proven difficult, largely because ...

This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is an extension of ordinary equational logic with assertions about the freshness of names. It is shown to be both sound and complete for the support interpretation of freshness and equality provided by the Gabbay-Pitts nominal...