A Higher Order Theory of Well-Founded Sets (with Urelements)
نویسنده
چکیده
This is a modification of the pure set theory GS to admit urelements. Created 2010/10/08 Last Change Date: 2013/01/03 17:12:44 http://www.rbjones.com/rbjpub/pp/doc/t042.pdf Id: t042.doc,v 1.8 2013/01/03 17:12:44 rbj Exp c © Roger Bishop Jones; Licenced under Gnu LGPL
منابع مشابه
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The code, tested under GHC 6.6.1, is available at http://logic.csci.unt.edu/tarau/ research/2008/fSET.zip. We introduce ranking and unranking functions generalizing Ackermann’s encoding to the universe of...
متن کاملDecidability problems in Set/Hyperset Theory and an application to algorithm verification
It is known that the Axiom of Infinity can be stated, relative to the standard ZermeloFraenkel-von Neumann set theory ZF, as an assertion of very low structural complexity: namely, one which involves only universal restricted quantifiers, i.e., belongs to the Bernays-Schönfinkel-Ramsey class BSR. We will exhibit, in Part I, two similar assertions of existence of infinite sets [POT09]: both belo...
متن کاملA Higher Order Theory of Well-Founded Sets
An axiomatic development in ProofPower-HOL of a higher order theory of well-founded sets. This is similar to a higher order ZFC strengthened by the assertion that every set is a member of some other set which is a (standard) model of ZFC. Created 2007/09/25 Last Change Date: 2012-08-11 21:01:53 http://www.rbjones.com/rbjpub/pp/doc/t023.pdf Id: t023.doc,v 1.17 2012-08-11 21:01:53 rbj Exp c © Rog...
متن کاملExecutable Set Theory and Arithmetic Encodings in Prolog
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 SWI-Prolog tested 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 univer...
متن کاملFinal coalgebras as greatest fixed points in ZF set theory
A special final coalgebra theorem, in the style of Aczel (1988), is proved within standard Zermelo-Fraenkel set theory. Aczel’s Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions. Variant ordered pairs and tuples, of possibly infinite length, are special cases of variant functions. Analogues of Aczel’s solution and substitution lemma...
متن کامل