Quantifiers in logic and proof-search using permissive-nominal terms and sets

Abstract

We investigate models of first-order logic designed to give semantics to reductive proofsearch systems, with special attention to the so-called γand δ-rules controlling quantifiers. The key innovation is the use of syntax and semantics with (finitely-supported) namesymmetry, in the style of nominal techniques.