The following pages link to J. M. Plotkin (Q590477):
Displaying 50 items.
- No decreasing sequence of cardinals (Q283108) (← links)
- Structures associated with real closed fields and the axiom of choice (Q330194) (← 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)
- (Q588671) (redirect page) (← links)
- Global square sequences in extender models (Q636337) (← links)
- Large ordinals (Q675870) (← links)
- The covering lemma up to a Woodin cardinal (Q678765) (← links)
- On a question of Silver about gap-two cardinal transfer principles (Q684222) (← links)
- More on simple forcing notions and forcings with ideals (Q685060) (← 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)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator (Q795031) (← links)
- A decidable Ehrenfeucht theory with exactly two hyperarithmetic models (Q810001) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Some partition relations for ideals on \(P_{\kappa}\lambda\) (Q810017) (← 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)
- Decidability in elementary analysis. II (Q912081) (← links)
- Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) (Q912082) (← links)
- Notes on monadic logic. Part B: Complexity of linear orders in ZFC (Q912091) (← links)
- More on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\) (Q916645) (← links)
- Non-totally transcendental unidimensional theories (Q922524) (← 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)
- A decidable fragment of predicate calculus (Q1066880) (← links)
- Equivalents of the axiom of choice. 2nd ed (Q1068821) (← links)
- The decidable normal modal logics are not recursively enumerable (Q1072542) (← links)
- S-forcing. IIa: Adding diamonds and more applications: Coding sets, Arhangel'skii's problem and \({\mathcal L}[Q_ 1^{<\omega},Q^ 1_ 2]\). (With an appendix by John P. Burgess) (Q1094419) (← links)
- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator (Q1096608) (← links)
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed (Q1096622) (← links)
- Categoricity and generalized model completeness (Q1098836) (← links)
- Notes on monadic logic. A: Monadic theory of the real line (Q1115431) (← 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)
- ZF and Boolean algebra (Q1240238) (← links)
- Correction to: ZF and Boolean Algebra (Q1240239) (← links)
- The model companion of width-two orders (Q1267599) (← links)
