Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 50 results in range #1 to #50.
- Glivenko-Cantelli classes and \textit{NIP} formulas: Label: en
- Separablilty of metric measure spaces and choice axioms: Label: en
- Fragments of IOpen: Label: en
- Pathology of submeasures and \(F_{\sigma}\) ideals: Label: en
- Positive indiscernibles: Label: en
- Spectral MV-algebras and equispectrality: Label: en
- On two consequences of CH established by Sierpiński: Label: en
- Katětov order between Hindman, Ramsey and summable ideals: Label: en
- On undecidability of the propositional logic of an associative binary modality: Label: en
- Quantifier-free induction for lists: Label: en
- The Josefson-Nissenzweig theorem and filters on \(\omega \): Label: en
- Games characterizing certain families of functions: Label: en
- Square compactness and Lindelöf trees: Label: en
- The extent of saturation of induced ideals: Label: en
- Herbrandized modified realizability: Label: en
- Cohesive powers of structures: Label: en
- Indiscernibles and satisfaction classes in arithmetic: Label: en
- Pcf without choice Sh835: Label: en
- On computable numberings of families of Turing degrees: Label: en
- Around accumulation points and maximal sequences of indiscernibles: Label: en
- Varieties of truth definitions: Label: en
- Essential hereditary undecidability: Label: en
- On the extendability to \(\mathbf{\Pi}_3^0\) ideals and Katětov order: Label: en
- Errata: on the role of the continuum hypothesis in forcing principles for subcomplete forcing: Label: en
- Herbrand complexity and the epsilon calculus with equality: Label: en
- Revisiting the conservativity of fixpoints over intuitionistic arithmetic: Label: en
- Turing degrees and randomness for continuous measures: Label: en
- The fixed point and the Craig interpolation properties for sublogics of \textbf{IL}: Label: en
- Compositional truth with propositional tautologies and quantifier-free correctness: Label: en
- Effective weak and vague convergence of measures on the real line: Label: en
- Cut elimination by unthreading: Label: en
- Superrosiness and dense pairs of geometric structures: Label: en
- Computable approximations of a chainable continuum with a computable endpoint: Label: en
- Semi-honest subrecursive degrees and the collection rule in arithmetic: Label: en
- Convergence of measures after adding a real: Label: en
- A Mathias criterion for the Magidor iteration of Prikry forcings: Label: en
- Vector spaces with a union of independent subspaces: Label: en
- Nondefinability results with entire functions of finite order in polynomially bounded o-minimal structures: Label: en
- The second-order version of Morley's theorem on the number of countable models does not require large cardinals: Label: en
- Indestructibility and the linearity of the Mitchell ordering: Label: en
- Regressive versions of Hindman's theorem: Label: en
- Cut elimination for coherent theories in negation normal form: Label: en
- \(L\)-domains as locally continuous sequent calculi: Label: en
- Prenex normalization and the hierarchical classification of formulas: Label: en
- Weak essentially undecidable theories of concatenation. II.: Label: en
- Maximal Tukey types, P-ideals and the weak Rudin-Keisler order: Label: en
- On harrop disjunction property in intermediate predicate logics: Label: en
- Stably embedded submodels of Henselian valued fields: Label: en
- On diagonal functions for equivalence relations: Label: en
- Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms: Label: en