VOL. 60 · NO. 1 | 2019
 
VIEW ALL ABSTRACTS +
Frontmatter
Notre Dame J. Formal Logic 60 (1), (2019)
No abstract available
Articles
Benoit Monin, Ludovic Patey
Notre Dame J. Formal Logic 60 (1), 1-12, (2019) DOI: 10.1215/00294527-2018-0020
KEYWORDS: reverse mathematics, computable encodability, Ramsey’s theory, computable reduction, higher recursion theory, 03D30, 03D65
Achilles Beros, Colin de la Higuera
Notre Dame J. Formal Logic 60 (1), 13-26, (2019) DOI: 10.1215/00294527-2018-0021
KEYWORDS: Learning theory, oracles, teachers, recursion theory, 03D80, 68T05
Sean Cox
Notre Dame J. Formal Logic 60 (1), 27-60, (2019) DOI: 10.1215/00294527-2018-0022
KEYWORDS: regular suborder, complete suborder, saturated ideal, chain condition, 03E05, 03E35, 03E55
Pierre Simon, Erik Walsberg
Notre Dame J. Formal Logic 60 (1), 61-76, (2019) DOI: 10.1215/00294527-2018-0019
KEYWORDS: dp-minimal, o-minimal, C-minimal, tame topology, 03C68
Sean C. Ebels-Duggan
Notre Dame J. Formal Logic 60 (1), 77-117, (2019) DOI: 10.1215/00294527-2018-0023
KEYWORDS: neologicism, abstraction, second-order logic, equivalence relations, categoricity, 03A05, 03B15, 00A30
Rutger Kuyper
Notre Dame J. Formal Logic 60 (1), 119-138, (2019) DOI: 10.1215/00294527-2018-0024
KEYWORDS: Medvedev degrees, Muchnik degrees, algorithmic randomness, 03D30, 03D32, 03G10, 03B20
Alex Kruckman
Notre Dame J. Formal Logic 60 (1), 139-160, (2019) DOI: 10.1215/00294527-2018-0025
KEYWORDS: amalgamation, pseudofinite theories, countably categorical theories, Fraïssé theory, 03C13, 03C45
Back to Top