Parameter-free uniformisation-Reference-Cited by-同舟云学术

Parameter-free uniformisation

Published:2008-04-29 Issue:9 Volume:136 Page:3327-3330
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Friedman Sy-David

Abstract

This article was motivated by two questions, one in the theory of infinite-time Turing machines and the other a fine-structural question posed by Wayne Richter. The answers to both turn on a question of parameter-free uniformisation, which I prove for all locally countable, limit initial segments of L L .

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/2008-136-09/S0002-9939-08-09275-7/S0002-9939-08-09275-7.pdf

Reference4 articles.

1. De Gruyter Series in Logic and its Applications;Friedman, Sy D.,2000

2. Friedman, S. and Welch, P.D., Two observations regarding infinite-time Turing machines, preprint.

3. The fine structure of the constructible hierarchy;Jensen, R. Björn;Ann. Math. Logic,1972

4. Eventually infinite time Turing machine degrees: infinite time decidable reals;Welch, P. D.;J. Symbolic Logic,2000

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Determinacy and monotone inductive definitions;Israel Journal of Mathematics;2019-03

2. Hypermachines;The Journal of Symbolic Logic;2011-06

3. Weak systems of determinacy and arithmetical quasi-inductive definitions;The Journal of Symbolic Logic;2011-06

4. Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems;Theoretical Computer Science;2009-02