1 citations · 1 across the 7 of their papers we have counts for
7 papers
Set Turing Machines
Garvin Melles
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the cl…
A saturated model of an unsuperstable theory of cardinality greater than its theory has the small index property
Garvin Melles, Saharon Shelah
A model M of cardinality lambda is said to have the small index property if for every G subseteq Aut(M) such that [Aut(M):G] <= lambda there is an A subseteq M with |A|< lambda suc…
The Consistency of
Garvin Melles
This paper is a technical continuation of ``Natural Axiom Schemata Extending ZFC. Truth in the Universe?'' In that paper we argue that is a natural axiom schema for the univ…
Natural Internal Forcing Schemata Extending ZFC
Garvin Melles
Let V be the universe of sets and V_α the sets of rank \leqα. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large…
The automorphism group of a saturated model has a large dense free subgroup
Garvin Melles, Saharon Shelah
We prove that for a stable theory if is a saturated model of of cardinality where then has a dense free subgroup on generators. Th…
Forcing
Garvin Melles
Let be a transitive model of and let be a -complete Boolean algebra in (In general a proper class.) We define a generalized notion of forcing with such…