The following pages link to (Q4075450):
Displaying 50 items.
- Ehrenfeucht-Fraïssé games in finite set theory (Q963464) (← links)
- On the axiom of union (Q964450) (← links)
- Partial automorphism semigroups (Q998310) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- The strength of extensionality. I: Weak weak set theories with infinity (Q1006617) (← links)
- Patterns of resemblance of order 2 (Q1011757) (← links)
- The many faces of interpolation (Q1024113) (← links)
- The Craig interpolation theorem in abstract model theory (Q1024119) (← links)
- Uncountable admissibles. II: Compactness (Q1055768) (← links)
- Probability logic with conditional expectation (Q1057851) (← links)
- A constructive consistency proof of a fragment of set theory (Q1080422) (← links)
- The limits of E-recursive enumerability (Q1095136) (← links)
- A universal recursive function on admissible sets (Q1095896) (← links)
- Admissibility spectra through \(\omega _ 1\) (Q1097878) (← links)
- Another extension of Van de Wiele's theorem (Q1102277) (← links)
- Playing with admissibility spectra (Q1111551) (← links)
- Admissibility spectra and minimality (Q1112022) (← links)
- Applications of Fodor's lemma to Vaught's conjecture (Q1114671) (← links)
- Generatability of admissible sets (Q1114672) (← links)
- The Galvin-Prikry theorem and set existence axioms (Q1117221) (← links)
- Existence of an inseparable pair in the recursive theory of admissible sets (Q1119573) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Bilattices and the theory of truth (Q1123891) (← links)
- Sacks forcing does not always produce a minimal upper bound (Q1139583) (← links)
- Partial isomorphisms and intuitionistic logic (Q1170233) (← links)
- The complexity of antidifferentiation (Q1178488) (← links)
- An algebraic treatment of the Barwise compactness theory (Q1181483) (← links)
- On the effective content of asymptotic verifications of Edgeworth's Conjecture (Q1181757) (← links)
- Hypersets (Q1181863) (← links)
- Automorphisms of recursively saturated models of arithmetic (Q1182432) (← links)
- Large cardinals and iteration trees of height \(\omega\) (Q1182470) (← links)
- Algebraization of quantifier logics, an introductory overview (Q1189899) (← links)
- Effective oracles (Q1191173) (← links)
- Forcing in admissible sets (Q1191174) (← links)
- A slight strengthening of a theorem of Blair and Kunen (Q1193866) (← links)
- Query languages for hierarchic databases (Q1201723) (← links)
- Some applications of Henkin quantifiers (Q1233865) (← links)
- New axiomatizations for logics with generalized quantifiers (Q1256443) (← links)
- Modal languages and bounded fragments of predicate logic (Q1267082) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- Strong \(\Delta_1\)-definability of a model in an admissible set (Q1288078) (← links)
- Borel equivalence relations induced by actions of the symmetric group (Q1295370) (← links)
- Well-ordering proofs for Martin-Löf type theory (Q1295372) (← links)
- In conjunction with qualitative probability (Q1295377) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Admissible sets in group theory (Q1317622) (← links)
- Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM (Q1322453) (← links)
- Induction and foundation in the theory of hereditarily finite sets (Q1330312) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Proof theory of reflection (Q1332853) (← links)
