John W. Addison Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:77-92 [Journal]
Roman Kossak Undefinability of truth and nonstandard models. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:115-123 [Journal]
Jan Mycielski On the tension between Tarski's nominalism and his model theory (definitions for a mathematical model of knowledge). [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:215-224 [Journal]
Benjamin Wells Applying, extending, and specializing pseudorecursiveness. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:225-254 [Journal]
Arnold Beckmann Preservation theorems and restricted consistency statements in bounded arithmetic. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:255-280 [Journal]
Magdalena Grzech Set theoretical aspects of the Banach space Linfinitf/c0. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:301-308 [Journal]
Jaakko Hintikka Independence-friendly logic and axiomatic set theory. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:313-333 [Journal]
J. Donald Monk The spectrum of maximal independent subsets of a Boolean algebra. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:335-348 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
