Executable Set Theory and Arithmetic Encodings in Prolog

Details Executable Set Theory and Arithmetic Encodings in Prolog Executable Set Theory and Arithmetic Encodings in Prolog

2008-08-05

arxiv.org/abs/0808.0540v1

Computer Science

Logic in Computer Science

Unpublished draft

Scientific paper

The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete Prolog code is available at http://logic.csci.unt.edu/tarau/research/2008/pHFS.zip . First, ranking and unranking functions for some "mathematically elegant" data types in the universe of Hereditarily Finite Sets with Urelements are provided, resulting in arithmetic encodings for powersets, hypergraphs, ordinals and choice functions. After implementing a digraph representation of Hereditarily Finite Sets we define {\em decoration functions} that can recover well-founded sets from encodings of their associated acyclic digraphs. We conclude with an encoding of arbitrary digraphs and discuss a concept of duality induced by the set membership relation. In the process, we uncover the surprising possibility of internally sharing isomorphic objects, independently of their language level types and meanings.

Affiliated with

Also associated with

No associations

Rating

Executable Set Theory and Arithmetic Encodings in Prolog 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 Executable Set Theory and Arithmetic Encodings in Prolog, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Executable Set Theory and Arithmetic Encodings in Prolog will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549421