The following pages link to Antonio Montalbán (Q453199):
Displaying 50 items.
- Computing maximal chains (Q453200) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- The limits of determinacy in second order arithmetic: consistency and complexity strength (Q480816) (← links)
- Independence in computable algebra (Q497725) (← links)
- Embedding and coding below a 1-generic degree (Q558421) (← links)
- A hyperimmune minimal degree and an ANR 2-minimal degree (Q609761) (← links)
- Cuts of linear orders (Q651418) (← links)
- Splitting in 2-computably enumerable degrees with avoiding cones (Q735982) (← links)
- There is no ordering on the classes in the generalized high/low hierarchies (Q818520) (← links)
- Countably complementable linear orderings (Q878148) (← links)
- The isomorphism problem for torsion-free abelian groups is analytic complete (Q952542) (← links)
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
- (Q1005922) (redirect page) (← links)
- Linear orders with distinguished function symbol (Q1005923) (← links)
- The polarized Ramsey's theorem (Q1014283) (← links)
- Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\) (Q1016503) (← links)
- Reverse mathematics and well-ordering principles: a pilot study (Q1032626) (← links)
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank (Q1032636) (← links)
- Self-embeddings of computable trees (Q1049747) (← links)
- (Q1620783) (redirect page) (← links)
- Jump inversions of algebraic structures and the \({\Sigma}\)-definability (Q1620784) (← links)
- Coding and definability in computable structures (Q1782235) (← links)
- A computability theoretic equivalent to Vaught's conjecture (Q1941142) (← links)
- Punctual definability on structures (Q2033006) (← links)
- Herd immunity under individual variation and reinfection (Q2153737) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- Computable linearizations of well-partial-orderings (Q2385530) (← links)
- Sex versus asex: an analysis of the role of variance conversion (Q2399082) (← links)
- Subspaces of computable vector spaces (Q2456206) (← links)
- Boolean algebras, Tarski invariants, and index sets (Q2505128) (← links)
- The strength of Turing determinacy within second order arithmetic (Q2787126) (← links)
- CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS (Q2805027) (← links)
- Degree-invariant, analytic equivalence relations without perfectly many classes (Q2832838) (← links)
- Extensions of embeddings below computably enumerable degrees (Q2838113) (← links)
- RELATIVE TO ANY NON-HYPERARITHMETIC SET (Q2853977) (← links)
- Counting the back-and-forth types (Q2907060) (← links)
- Rice sequences of relations (Q2941599) (← links)
- Effectively Existentially-Atomic Structures (Q2970960) (← links)
- COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS (Q2976365) (← links)
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES (Q2976376) (← links)
- The Slaman-Wehner theorem in higher recursion theory (Q3003597) (← links)
- The Veblen functions for computability theorists (Q3011121) (← links)
- Computability of Fraïssé limits (Q3083128) (← links)
- The limits of determinacy in second-order arithmetic (Q3116522) (← links)
- On the $n$-back-and-forth types of Boolean algebras (Q3116576) (← links)
- Open Questions in Reverse Mathematics (Q3174640) (← links)
- Boolean algebra approximations (Q3190798) (← links)
- A minimal pair of 𝐾-degrees (Q3372137) (← links)
- A robuster Scott rank (Q3450085) (← links)
- (Q3464659) (← links)
