VOL. 48 · NO. 3 | 2007
 
VIEW ALL ABSTRACTS +
Front Matter
Notre Dame J. Formal Logic 48 (3), (2007)
No abstract available
Articles
Denis Hirschfeldt, Russell Miller, Sergei Podzorov
Notre Dame J. Formal Logic 48 (3), 317-347, (2007) DOI: 10.1305/ndjfl/1187031407
KEYWORDS: order-computability, computable model theory, limitwise-monotonic functions, 03D45, 03C57, 03D25, 03D28, 03D30, 68Q30
Martin Kummer, Marcus Schaefer
Notre Dame J. Formal Logic 48 (3), 349-369, (2007) DOI: 10.1305/ndjfl/1187031408
KEYWORDS: cuppability, completeness, strong reducibilities, simple sets, hypersimple sets, 03D30, 03D25, 03D28
A. Ivanov, K. Majcher
Notre Dame J. Formal Logic 48 (3), 371-380, (2007) DOI: 10.1305/ndjfl/1187031409
KEYWORDS: omega-stable omega-categorical structures, Age, generic expansions, 03C45
Joost J. Joosten
Notre Dame J. Formal Logic 48 (3), 381-398, (2007) DOI: 10.1305/ndjfl/1187031410
KEYWORDS: computational complexity, bounded arithmetic, length of proofs, 03B70, 68Q15
Claude Sureson
Notre Dame J. Formal Logic 48 (3), 399-423, (2007) DOI: 10.1305/ndjfl/1187031411
KEYWORDS: Rumely domains, model completeness, decidability, 03C10, 11U99
Alberto Marcone
Notre Dame J. Formal Logic 48 (3), 425-448, (2007) DOI: 10.1305/ndjfl/1187031412
KEYWORDS: reverse mathematics, interval orders, proper interval orders, 03B30, 06A06, 03D45
Back Matter
Notre Dame J. Formal Logic 48 (3), (2007)
No abstract available
Back to Top