VOL. 53 · NO. 3 | 2012
 
VIEW ALL ABSTRACTS +
Frontmatter
Notre Dame J. Formal Logic 53 (3), (2012)
No abstract available
Notre Dame J. Formal Logic 53 (3), (2012)
No abstract available
Articles
Roman Kossak, James H. Schmerl
Notre Dame J. Formal Logic 53 (3), 267-287, (2012) DOI: 10.1215/00294527-1716802
KEYWORDS: models of arithmetic, elementary pairs, cofinal extensions, recursive saturation, 03C62
Stefan Hetzl
Notre Dame J. Formal Logic 53 (3), 289-296, (2012) DOI: 10.1215/00294527-1716811
KEYWORDS: computational content, cut elimination, first-order arithmetic, 03F05, 03F07, 03F30
Simon Hewitt
Notre Dame J. Formal Logic 53 (3), 297-318, (2012) DOI: 10.1215/00294527-1716820
KEYWORDS: plural logic, plural quantification, second-order logic, Boolos, 03A05, 00A30
Guram Bezhanishvili, Joel Lucero-Bryan
Notre Dame J. Formal Logic 53 (3), 319-345, (2012) DOI: 10.1215/00294527-1716748
KEYWORDS: modal logic, topological semantics, derived set operator, scattered space, rational numbers, 03B45, 54G12
Jeremy Avigad
Notre Dame J. Formal Logic 53 (3), 347-350, (2012) DOI: 10.1215/00294527-1716757
KEYWORDS: ergodic theorems, Computable analysis, 03F60, 37A25
Diego Rojas-Rebolledo
Notre Dame J. Formal Logic 53 (3), 351-371, (2012) DOI: 10.1215/00294527-1716766
KEYWORDS: determinacy, admissible sets, large cardinals, 03E45, 03E55, 03E60
Jared R. Corduan, François G. Dorais
Notre Dame J. Formal Logic 53 (3), 373-395, (2012) DOI: 10.1215/00294527-1716784
KEYWORDS: reverse mathematics, indecomposability, partition principles, 03B30, 03F35
Sean Cox
Notre Dame J. Formal Logic 53 (3), 397-412, (2012) DOI: 10.1215/00294527-1716793
KEYWORDS: Forcing axioms, Ideals, duality theorem, large cardinals, proper forcing, 03E05, 03E35, 03E50, 03E55, 03E57
Fredrik Engström, Richard W. Kaye
Notre Dame J. Formal Logic 53 (3), 413-428, (2012) DOI: 10.1215/00294527-1716739
KEYWORDS: models of arithmetic, resplendent models, standard cut, satisfaction classes, 03C62, 03C30
Back to Top