Found: 8
Select item for more details and to access through your institution.
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics.
- Published in:
- Journal of Mathematical Logic, 2024, v. 24, n. 2, p. 1, doi. 10.1142/S0219061323500058
- By:
- Publication type:
- Article
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS.
- Published in:
- Journal of Symbolic Logic, 2016, v. 81, n. 3, p. 1028, doi. 10.1017/jsl.2015.70
- By:
- Publication type:
- Article
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS.
- Published in:
- Journal of Mathematical Logic, 2013, v. 13, n. 2, p. -1, doi. 10.1142/S0219061313500050
- By:
- Publication type:
- Article
Generic computability, Turing degrees, and asymptotic density.
- Published in:
- Journal of the London Mathematical Society, 2012, v. 85, n. 2, p. 472, doi. 10.1112/jlms/jdr051
- By:
- Publication type:
- Article
Random quotients of the modular group are rigid and essentially incompressible.
- Published in:
- Journal für die Reine und Angewandte Mathematik, 2009, v. 2009, n. 628, p. 91, doi. 10.1515/CRELLE.2009.019
- By:
- Publication type:
- Article
On one relator groups and HNN extensions.
- Published in:
- Journal of the Australian Mathematical Society, 1973, v. 16, n. 2, p. 249, doi. 10.1017/S1446788700014300
- By:
- Publication type:
- Article
The geometry of higman-neumann-neumann extensions.
- Published in:
- Communications on Pure & Applied Mathematics, 1973, v. 26, n. 5/6, p. 787, doi. 10.1002/cpa.3160260522
- By:
- Publication type:
- Article
On Greendlinger's lemma.
- Published in:
- Communications on Pure & Applied Mathematics, 1970, v. 23, n. 2, p. 233, doi. 10.1002/cpa.3160230209
- By:
- Publication type:
- Article