50th Anniversary Issue, Part 1
VOL. 50 · NO. 4 | 2009
 
VIEW ALL ABSTRACTS +
Front Matter
Notre Dame J. Formal Logic 50 (4), (2009)
No abstract available
Articles
Michael Detlefsen
Notre Dame J. Formal Logic 50 (4), 363-364, (2009) DOI: 10.1215/00294527-2009-023
No abstract available
Martin Koerwien
Notre Dame J. Formal Logic 50 (4), 365-380, (2009) DOI: 10.1215/00294527-2009-016
KEYWORDS: omega-stability, classifications, countable models, Borel reducibility, 03C15, 03C45, 03E15
Joseph S. Miller
Notre Dame J. Formal Logic 50 (4), 381-391, (2009) DOI: 10.1215/00294527-2009-017
KEYWORDS: Martin-Lof randomness, prefix-free Kolmogorov complexity, 68Q30, 03D30, 03D80
Guido Gherardi, Alberto Marcone
Notre Dame J. Formal Logic 50 (4), 393-425, (2009) DOI: 10.1215/00294527-2009-018
KEYWORDS: Computable analysis, reverse mathematics, weak Konig's lemma, Hahn-Banach extension theorem, multivalued functions, 03F60, 03B30, 46A22‎, 46S30
Ulrich Kohlenbach, Alexander Kreuzer
Notre Dame J. Formal Logic 50 (4), 427-444, (2009) DOI: 10.1215/00294527-2009-019
KEYWORDS: Ramsey's Theorem for pairs, provably recursive functions, proof mining, 03F10, 05D10, 03F35
Bjørn Kjos-Hanssen, Andrée Nies
Notre Dame J. Formal Logic 50 (4), 445-452, (2009) DOI: 10.1215/00294527-2009-020
KEYWORDS: Turing degrees, highness and lowness notions, algorithmic randomness, truth-table degrees, 03D28, 03D32, 68Q30
Taras Banakh, Nadya Lyaskovska, Dušan Repovš
Notre Dame J. Formal Logic 50 (4), 453-468, (2009) DOI: 10.1215/00294527-2009-021
KEYWORDS: Polish group, packing index, Borel set, Haar null set, Martin axiom, Continuum hypothesis, 03E15, 03E17, 03E35, 03E50, 03E75, 05D99, 22A99, 54H05, 54H11
Keng Meng Ng
Notre Dame J. Formal Logic 50 (4), 469-493, (2009) DOI: 10.1215/00294527-2009-022
KEYWORDS: maximal, hyperhypersimple, computable numberings, 03D25, 68Q30
Back Matter
Notre Dame J. Formal Logic 50 (4), (2009)
No abstract available
Back to Top