Haven (graph theory): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
← Older edit
en>David Eppstein
→Definition: define => construct
 
Line 1: Line 1:
In [[set theory]], a discipline within mathematics, an '''admissible set''' is a [[transitive set]] <math> A\, </math> such that <math>\langle A,\in \rangle</math> is a [[model theory|model]] of [[Kripke–Platek set theory]] (Barwise 1975).
Greetings. The writer's title is Phebe and she feels comfortable when individuals use the full name. I am a meter reader. To gather badges is what her family and her enjoy. Years ago we moved to North Dakota.<br><br>Here is my page - [http://biztoc.com/mod/groups/topicposts.php?topic=1311479&group_guid=1311468 at home std test]
 
The smallest example of an admissible set is the set of [[hereditarily finite set]]s. Another example is the set of [[hereditarily countable set]]s.
 
==See also==
* [[Admissible ordinal]]
 
== References ==
 
* Barwise, Jon (1975). ''Admissible Sets and Structures: An Approach to Definability Theory'', Perspectives in Mathematical Logic, Volume 7, Springer-Verlag. [http://projecteuclid.org/euclid.pl/1235418470 Electronic version] on [[Project Euclid]].
 
[[Category:Set theory]]
 
 
{{settheory-stub}}

Latest revision as of 05:56, 3 January 2015

Greetings. The writer's title is Phebe and she feels comfortable when individuals use the full name. I am a meter reader. To gather badges is what her family and her enjoy. Years ago we moved to North Dakota.

Here is my page - at home std test

Retrieved from "https://en.formulasearchengine.com/index.php?title=Haven_(graph_theory)&oldid=248522"