The following pages link to (Q3910512):
Displaying 14 items.
- On elementary theories of ordinal notation systems based on reflection principles (Q281010) (← links)
- Saturation and elementary equivalence of \(C^\ast\)-algebras (Q490729) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) (Q783293) (← links)
- A portrait of Alfred Tarski (Q809989) (← links)
- On quantifier-rank equivalence between linear orders (Q964492) (← links)
- Stationary logic of ordinals (Q1062974) (← links)
- Recursive categoricity and recursive stability (Q1084103) (← links)
- Unifying threads in Alfred Tarski's work (Q1286341) (← links)
- Elimination of unbounded quantifiers for some poly-regular groups of infinite rank (Q2461190) (← links)
- Polyadic spaces and profinite monoids (Q2695361) (← links)
- Andrzej Mostowski and the Notion of a Model (Q4611699) (← links)
- From Choosing Elements to Choosing Concepts: The Evolution of Feferman’s Work in Model Theory (Q5214779) (← links)
- Some structural similarities between uncountable sets, powersets and the universe (Q6094140) (← links)
