307 research outputs found

    A formalized general theory of syntax with bindings

    Get PDF
    We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying numbers of inputs, quotiented to alpha-equivalence and sorted according to a binding signature. The theory includes a rich collection of properties of the standard operators on terms, such as substitution and freshness. It also includes induction and recursion principles and support for semantic interpretation, all tailored for smooth interaction with the bindings and the standard operators

    Subnormalizers and solvability in finite groups

    Get PDF
    For a finite group GG, we study the probability sp(G)sp(G) that, given two elements x,yGx,y \in G, the cyclic subgroup x\langle x \rangle is subnormal in the subgroup x,y\langle x, y \rangle. This can be seen as an intermediate invariant between the probability that two elements generate a nilpotent subgroup and the probability that two elements generate a solvable subgroup. We prove that sp(G)1/6sp(G) \leq 1/6 for every nonsolvable group GG

    Subnormalizers and p-elements in finite groups

    Get PDF

    Recurrence of acute suppurative thyroiditis in a young man.

    Get PDF

    Bindings as bounded natural functors

    Get PDF
    We present a general framework for specifying and reasoning about syntax with bindings. Abstract binder types are modeled using a universe of functors on sets, subject to a number of operations that can be used to construct complex binding patterns and binding-aware datatypes, including non-well-founded and infinitely branching types, in a modular fashion. Despite not committing to any syntactic format, the framework is “concrete” enough to provide definitions of the fundamental operators on terms (free variables, alpha-equivalence, and capture-avoiding substitution) and reasoning and definition principles. This work is compatible with classical higher-order logic and has been formalized in the proof assistant Isabelle/HOL
    corecore