The following pages link to (Q4040890):
Displaying 50 items.
- Predicativity, the Russell-Myhill paradox, and Church's intensional logic (Q300834) (← links)
- Implicit definability in arithmetic (Q306821) (← links)
- \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets (Q329716) (← links)
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
- Computing maximal chains (Q453200) (← links)
- Nonpresentability of the semigroup \(\omega^\omega\) over \(\mathbb H\mathbb F(\mathbb R)\) (Q467668) (← links)
- The strength of the Grätzer-Schmidt theorem (Q506962) (← links)
- Transfinite recursion and computation in the iterative conception of set (Q510712) (← links)
- The machine as data: a computational view of emergence and definability (Q514566) (← links)
- Notes on the computational aspects of Kripke's theory of truth (Q526739) (← links)
- On the classification of recursive languages (Q598240) (← links)
- The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
- Fixed points for the jump operator (Q694226) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Lowness of higher randomness notions (Q948873) (← links)
- Atomic models higher up (Q952493) (← links)
- Remarks on two problems by M. Laczkovich on functions with Borel measurable differences (Q955175) (← links)
- Infinite time extensions of Kleene's \({\mathcal O}\) (Q1031833) (← links)
- Ordinal machines and admissible recursion theory (Q1032634) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- The irregular and non-hyperregular \(\alpha\)-r.e. degrees (Q1245218) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- Mind change complexity of learning logic programs (Q1603595) (← links)
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory (Q1677584) (← links)
- The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
- Positive presentations of families in relation to reducibility with respect to enumerability (Q1731525) (← links)
- An ordinal analysis of stability (Q1765099) (← links)
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension (Q1777268) (← links)
- Turing determinacy and the continuum hypothesis (Q1824617) (← links)
- On a generalized notion of mistake bounds (Q1854426) (← links)
- A contextual-hierarchical approach to truth and the liar paradox (Q1876081) (← links)
- Degrees of categoricity and the hyperarithmetic hierarchy (Q1949167) (← links)
- Simple structures with complex symmetry (Q1957352) (← links)
- Embeddings between well-orderings: computability-theoretic reductions (Q1987213) (← links)
- Beyond Erdős-Kunen-Mauldin: shift-compactness properties and singular sets (Q1998810) (← links)
- Bad oracles in higher computability and randomness (Q2022778) (← links)
- Characterizations of ITBM-computability. I (Q2026737) (← links)
- Absolute and relative properties of negatively numbered families (Q2030136) (← links)
- Characterizations of ITBM-computability. II (Q2041591) (← links)
- Infinitary action logic with exponentiation (Q2067638) (← links)
- Effectiveness for the dual Ramsey theorem (Q2075273) (← links)
- Computable topological abelian groups (Q2099260) (← links)
- Lower bounds on \(\beta (\alpha)\) (Q2104252) (← links)
- Computability and the game of cops and robbers on graphs (Q2144613) (← links)
- Turing reducibility in the fine hierarchy (Q2187259) (← links)
- Enumerating abelian \(p\)-groups (Q2193224) (← links)
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies (Q2207013) (← links)
- Computable positive and Friedberg numberings in hyperarithmetic (Q2213918) (← links)
