From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions

Details From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions

2011-11-20

arxiv.org/abs/1111.4611v1

Transactions on Computational Logic Volume 13 Number 3, 2012

Computer Science

Logic in Computer Science

Scientific paper

Permissive-Nominal Logic (PNL) extends first-order predicate logic with term-formers that can bind names in their arguments. It takes a semantics in (permissive-)nominal sets. In PNL, the forall-quantifier or lambda-binder are just term-formers satisfying axioms, and their denotation is functions on nominal atoms-abstraction. Then we have higher-order logic (HOL) and its models in ordinary (i.e. Zermelo-Fraenkel) sets; the denotation of forall or lambda is functions on full or partial function spaces. This raises the following question: how are these two models of binding connected? What translation is possible between PNL and HOL, and between nominal sets and functions? We exhibit a translation of PNL into HOL, and from models of PNL to certain models of HOL. It is natural, but also partial: we translate a restricted subsystem of full PNL to HOL. The extra part which does not translate is the symmetry properties of nominal sets with respect to permutations. To use a little nominal jargon: we can translate names and binding, but not their nominal equivariance properties. This seems reasonable since HOL---and ordinary sets---are not equivariant. Thus viewed through this translation, PNL and HOL and their models do different things, but they enjoy non-trivial and rich subsystems which are isomorphic.

Affiliated with

Also associated with

No associations

Rating

From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129953