The following pages link to (Q4075450):
Displaying 50 items.
- Predicativity, the Russell-Myhill paradox, and Church's intensional logic (Q300834) (← links)
- Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory (Q334991) (← links)
- Deductive reasoning in the structuralist approach (Q383572) (← links)
- Operational closure and stability (Q385076) (← links)
- A proof-theoretic account of classical principles of truth (Q385807) (← links)
- Relativized ordinal analysis: the case of power Kripke-Platek set theory (Q392292) (← links)
- On \(\Sigma\)-rigid presentations of the real order (Q404712) (← links)
- From the weak to the strong existence property (Q448335) (← links)
- Classes and truths in set theory (Q450946) (← links)
- Polish group actions and effectivity (Q453179) (← links)
- Nonpresentability of the semigroup \(\omega^\omega\) over \(\mathbb H\mathbb F(\mathbb R)\) (Q467668) (← links)
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP (Q476116) (← links)
- Intuitionistic fixed point theories over set theories (Q494642) (← links)
- Multiverse conceptions in set theory (Q510715) (← links)
- Existence of saturated structures (Q546221) (← links)
- Decidability and definability with circumscription (Q579240) (← links)
- Refusal testing (Q580961) (← links)
- Computational inductive definability (Q598276) (← links)
- On computable automorphisms in formal concept analysis (Q606025) (← links)
- Definability in the structure of words with the inclusion relation (Q606049) (← links)
- Descriptive properties on admissible sets (Q619320) (← links)
- The effective theory of Borel equivalence relations (Q636325) (← links)
- \(\lambda\)-structures and \(s\)-structures: translating the models (Q638495) (← links)
- The strength of extensionality. II: Weak weak set theories without infinity (Q639665) (← links)
- On the conservativity of the axiom of choice over set theory (Q647343) (← links)
- On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models (Q662638) (← links)
- Computing with infinitary logic (Q672337) (← links)
- A semilattice of numberings. II (Q694202) (← links)
- Fixed points for the jump operator (Q694226) (← links)
- Some presentations of the real number field (Q694238) (← links)
- Operational set theory and small large cardinals (Q731889) (← links)
- Each family of subsets of the urelements generates an admissible set (Q751652) (← links)
- Isomorphic incidence algebras (Q757451) (← links)
- Countably decomposable admissible sets (Q762060) (← links)
- Model theory for \(L_{\infty \omega _ 1}\) (Q762061) (← links)
- Rank-initial embeddings of non-standard models of set theory (Q781504) (← links)
- Iterating ordinal definability (Q791523) (← links)
- On conceptual completeness of syntactic-semantical systems (Q798654) (← links)
- Hierarchies of program logics (Q801048) (← links)
- Proof-theoretic analysis of KPM (Q803124) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
- Principal numerations of functionals on admissible sets (Q810015) (← links)
- Comparing inductive and circular definitions: Parameters, complexity and games (Q817681) (← links)
- Completeness theorem for topological class models (Q866886) (← links)
- Vaught's conjecture without equality (Q894255) (← links)
- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property (Q894257) (← links)
- Invariant measures via inverse limits of finite structures (Q896078) (← links)
- A logic of abstraction related to finite constructive number classes (Q910401) (← links)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- Countable structures \(\Sigma \)-definable over classical continuous number systems (Q957779) (← links)
