Alexej P. Pynko Definitional Equivalence and Algebraizability of Generalized Logical Systems. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:1-68 [Journal]
Iraj Kalantari, Lawrence Welch Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, II. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:87-110 [Journal]
J. B. Wells Typability and Type Checking in System F are Equivalent and Undecidable. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:111-156 [Journal]
Renling Jin Distinguishing Three Strong Saturation Properties in Nonstandard Analysis. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:157-171 [Journal]
Philip Scowcroft Some Purely Topological Models for Intuitionistic Analysis. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:173-215 [Journal]