The following pages link to (Q4075450):
Displaying 50 items.
- Stage comparison, fixed points, and least fixed points in Kripke-Platek environments (Q2108575) (← links)
- Copies from ``Standard set theory''? A note on the foundations of minimalist syntax in reaction to Chomsky, Gallego and Ott (2019) (Q2135956) (← links)
- Condensable models of set theory (Q2144608) (← links)
- A non-hyperarithmetical Gödel logic (Q2151390) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- On the isomorphism problem for some classes of computable algebraic structures (Q2155501) (← links)
- Set theoretical analogues of the Barwise-Schlipf theorem (Q2159934) (← links)
- Inner constructivizability of functional structures (Q2165606) (← links)
- On mutual definability of operations on fields (Q2186309) (← links)
- Positive numberings in admissible sets (Q2191379) (← links)
- Computable positive and Friedberg numberings in hyperarithmetic (Q2213918) (← links)
- Hierarchy of families of theories and their rank characteristics (Q2215243) (← links)
- Encoding complete metric structures by classical structures (Q2228349) (← links)
- Logics of intuitionistic Kripke-Platek set theory (Q2231694) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- Thin equivalence relations and inner models (Q2250452) (← links)
- On transferring model theoretic theorems of \(\mathcal L_{\infty,\omega}\) in the category of sets to a fixed Grothendieck topos (Q2254569) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Properties of the atoms in finitely supported structures (Q2288339) (← links)
- Completeness theorems for \(\sigma \)-additive probabilistic semantics (Q2291370) (← links)
- \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\) (Q2300935) (← links)
- Determinacy separations for class games (Q2312093) (← links)
- Logical language of description of polynomial computing (Q2313239) (← links)
- On decidability of list structures (Q2332060) (← links)
- Partial decidable presentations in hyperarithmetic (Q2332068) (← links)
- \(\Sigma\)-presentations of the ordering on the reals (Q2342315) (← links)
- Properties of \(s\Sigma\)-reducibility (Q2342330) (← links)
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) (Q2344720) (← links)
- A sufficient condition for nonpresentability of structures in hereditarily finite superstructures (Q2364328) (← links)
- The countable admissible ordinal equivalence relation (Q2400501) (← links)
- Generalized hyperarithmetical computability over structures (Q2401541) (← links)
- Processes and structures on approximation spaces (Q2401545) (← links)
- Determinacy in third order arithmetic (Q2404651) (← links)
- A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- On the relationship between fixed points and iteration in admissible set theory without foundation (Q2486984) (← links)
- Levy and set theory (Q2493914) (← links)
- Expressivity of second order propositional modal logic (Q2499295) (← links)
- Characterizing the interpretation of set theory in Martin-Löf type theory (Q2500469) (← links)
- A modal proof theory for final polynomial coalgebras (Q2503317) (← links)
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory (Q2514846) (← links)
- Determinacy and monotone inductive definitions (Q2631880) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
- Bounds on Scott rank for various nonelementary classes (Q2639058) (← links)
- Varieties of complex algebras (Q2641327) (← links)
- Strict \({\varPi^1_1}\)-reflection in bounded arithmetic (Q2655140) (← links)
- End extending models of set theory via power admissible covers (Q2672157) (← links)
- The Keisler order in continuous logic (Q2682715) (← links)
- A few more dissimilarities between second-order arithmetic and set theory (Q2700817) (← links)
