The following pages link to J. M. Plotkin (Q590477):
Displaying 50 items.
- No decreasing sequence of cardinals (Q283108) (← links)
- Bounded stationary reflection. II. (Q331046) (← links)
- Maximally embeddable components (Q377481) (← links)
- Independence, order, and the interaction of ultrafilters and theories (Q450953) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- Structural connections between a forcing class and its modal logic (Q498994) (← links)
- Square principles in \(\mathbb{P}_{\max}\) extensions (Q522300) (← links)
- Chains of saturated models in AECs (Q527325) (← links)
- Magidor-Malitz reflection (Q527330) (← links)
- Extender-based Magidor-Radin forcing (Q532622) (← links)
- Global square sequences in extender models (Q636337) (← links)
- Large ordinals (Q675870) (← links)
- On a question of Silver about gap-two cardinal transfer principles (Q684222) (← links)
- Techniques for approaching the dual Ramsey property in the projective hierarchy. (Q700582) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- The pointwise view of determinacy: arboreal forcings, measurability, and weak measurability (Q812501) (← links)
- Around Silver's theorem (Q816292) (← links)
- On finite models of regular identities (Q908902) (← links)
- Complexity ranks of countable models (Q998136) (← links)
- The Vaught conjecture: do uncountable models count? (Q998139) (← links)
- The Borel complexity of isomorphism for theories with many types (Q998140) (← links)
- Game ideals (Q1011753) (← links)
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed (Q1096622) (← links)
- The decision problem for \(\mathbf Z C(p^3)\)-lattices with \(p\) prime (Q1128176) (← links)
- The expected complexity of analytic tableaux analyses in propositional calculus (Q1168964) (← links)
- A patching lemma (Q1217122) (← links)
- Random graphs in the monadic theory of order (Q1306794) (← links)
- More forcing notions imply diamond (Q1354343) (← links)
- Localizations of infinite subsets of \(\omega\) (Q1354345) (← links)
- Evasion and prediction. IV. Strong forms of constant prediction (Q1407597) (← links)
- A characterization of permutation models in terms of forcing (Q1430902) (← links)
- On successors of Jónsson cardinals (Q1584016) (← links)
- Subtle cardinals and linear orderings (Q1840455) (← links)
- On the algebra of elementary embeddings of a rank into itself (Q1842231) (← links)
- Games played on partial isomorphisms (Q1879001) (← links)
- The simulation technique and its applications to infinitary combinatorics under the axiom of Blackwell determinacy. (Q1880135) (← links)
- Degrees of logics with Henkin quantifiers in poor vocabularies (Q1882566) (← links)
- Three-variable statements of set-pairing (Q1885036) (← links)
- Iterated class forcing (Q1901668) (← links)
- On variants of \(o\)-minimality (Q1919545) (← links)
- Decidability of fluted logic with identity (Q1924331) (← links)
- Special ultrafilters and cofinal subsets of \(({}^\omega \omega, <^*)\) (Q2204380) (← links)
- On singular stationarity. I: Mutual stationarity and ideal-based methods (Q2326660) (← links)
- Hindman's theorem is only a countable phenomenon (Q2413413) (← links)
- On the existence of permutations of infinite sets without fixed points in set theory without choice (Q2416465) (← links)
- Van Douwen's diagram for dense sets of rationals (Q2433746) (← links)
- Characterization of model Mirimanov-von Neumann cumulative sets (Q2462036) (← links)
- Distinguishing groupwise density numbers (Q2463449) (← links)
- A global wellordering of norms defined via Blackwell games (Q2490425) (← links)
- On pairs of free modules over a Dedekind domain (Q2580960) (← links)
