
22John Etchemendy. The concept of logical consequence. Harvard University Press, Cambridge, Mass., and London, 1990, vii + 174 pp (review)Journal of Symbolic Logic 57 (1): 254255. 1992.

20James Van Aken. Axioms for the settheoretic hierarchy. The journal of symbolic logic, vol. 51 , pp. 992–1004.  Stephen Pollard. More axioms for the settheoretic hierarchy. Logique et analyse, n.s. vol. 31 , pp. 85–88.  Michael D. Potter. Sets. An introduction. Clarendon Press, Oxford University Press, Oxford and New York1990, xi + 241 pp (review)Journal of Symbolic Logic 58 (3): 10771078. 1993.

79XIII—Two Problems with Tarski's Theory of ConsequenceProceedings of the Aristotelian Society 92 (1): 273292. 1991.

Omnibus Review (review)Journal of Symbolic Logic 56 (1): 329332. 1991.Reviewed Works:S. N. Artemov, B. M. Schein, Arithmetically Complete Modal Theories.S. N. Artemov, E. Mendelson, On Modal Logics Axiomatizing Provability.S.N. Artemov, E. Mendelson, Nonarithmeticity of Truth Prdicate Logics of Provability.V. A. Vardanyan, E. Mendelson, Arithmetic Complexity of Predicate Logics of Provability and Their.S. N. Artemov, E. Mendelson, Numerically Correct Provability Logics.

Truth and Necessity in Partially Interpreted LanguagesDissertation, University of California, Berkeley. 1985.Tarski showed how to give satisfactory theories of truth for a wide variety of languages, but he required that the theory of truth for a language be formulated in an essentially richer metalanguage. Since there is no human language essentially richer than a natural language and since we would like to develop consistent theories of truth for natural languages, we would like to learn how to formulate a theory of truth for a language within that very language. ;Toward this end, I consider a class o…Read more

2University of Illinois at UrbanaChampaign, June 3–7, 2000Bulletin of Symbolic Logic 6 (3). 2000.

4Ramsey and the Correspondence TheoryIn Leon Horsten & Volker Halbach (eds.), Principles of Truth, De Gruyter. pp. 153168. 2003.

1Universal Universal QuantificationIn J. C. Beall (ed.), Liars and Heaps: New Essays on Paradox, Clarendon Press. 2004.

239How we learn mathematical languagePhilosophical Review 106 (1): 3568. 1997.Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or …Read more

69Truth by defaultPhilosophia Mathematica 9 (1): 520. 2001.There is no preferred reduction of number theory to set theory. Nonetheless, we confidently accept axioms obtained by substituting formulas from the language of set theory into the induction axiom schema. This is only possible, it is argued, because our acceptance of the induction axioms depends solely on the meanings of aritlunetical and logical terms, which is only possible if our 'intended models' of number theory are standard. Similarly, our acceptance of the secondorder natural deduction r…Read more

11Afterword: Trying (With Limited Success) to Demarcate the DisquotationalCorrespondence DistinctionIn J. C. Beall & B. ArmourGarb (eds.), Deflationary Truth, Open Court. pp. 1143. 2005.

24Review: James Van Aken, Axioms for the SetTheoretic Hierarchy; Stephen Pollard, More Axioms for the SetTheoretic Hierarchy; Michael D. Potter, Sets. An Introduction (review)Journal of Symbolic Logic 58 (3): 10771078. 1993.

3[Omnibus Review]Journal of Symbolic Logic 56 (1): 329332. 1991.Reviewed Works:S. N. Artemov, B. M. Schein, Arithmetically Complete Modal Theories.S. N. Artemov, E. Mendelson, On Modal Logics Axiomatizing Provability.S.N. Artemov, E. Mendelson, Nonarithmeticity of Truth Prdicate Logics of Provability.V. A. Vardanyan, E. Mendelson, Arithmetic Complexity of Predicate Logics of Provability and Their.S. N. Artemov, E. Mendelson, Numerically Correct Provability Logics

10The Philosophical Review: Vol. 106, No.1, January 1997Review of Metaphysics 51 (1): 208208. 1997.
Cambridge, Massachusetts, United States of America