
20John 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.

13James 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.

76XIII—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.

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

702

108Logical commitment and semantic indeterminacy: A reply to WilliamsonLinguistics and Philosophy 27 (1): 123136. 2004.

108How truthlike can a predicate be? A negative resultJournal of Philosophical Logic 14 (4). 1985.

9The Philosophical Review: Vol. 106, No.1, January 1997Review of Metaphysics 51 (1): 208208. 1997.

2There are many thingsIn Judith Jarvis Thomson & Alex Byrne (eds.), Content and Modality: Themes From the Philosophy of Robert Stalnaker, Oxford University Press. pp. 93122. 2006.

1Ramsey's DialetheismIn Graham Priest, J. C. Beall & Bradley ArmourGarb (eds.), The Law of NonContradiction, Clarendon Press. 2004.

5

75Learning the ImpossibleIn Ellery Eells & Brian Skyrms (eds.), Probability and Conditionals: Belief Revision and Rational Decision, Cambridge University Press. pp. 179199. 1994.

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

Structures and the Hyperarithmetical Hierarchy. Knight has directed or codirected seven doctoral dissertations in mathematics and one in electrical engineering. She served on selection panels for the NSF Postdoctoral Fellowships, on program committees of numerous meetings, and as an editor of The Journal of Symbolic Logic (19891995) (review)Bulletin of Symbolic Logic 6 (1). 2000.

47If P, then Q: Conditionals and the Foundations of Reasoning (review)Philosophy and Phenomenological Research 53 (1): 239242. 1993.

4Awarded the 1988 Johnsonian Prize in Philosophy. Published with the aid of a grant from the National Endowment for the Humanities.

6The Complexity of the Modal Predicate Logic of "True in Every Transitive Model of ZF"Journal of Symbolic Logic 62 (4): 13711378. 1997.

71There's Something about Gödel is a bargain: two books in one. The first half is a gentle but rigorous introduction to the incompleteness theorems for the mathematically uninitiated. The second is a survey of the philosophical, psychological, and sociological consequences people have attempted to derive from the theorems, some of them quite fantastical.The first part, which stays close to Gödel's original proofs, strikes a nice balance, giving enough details that the reader understands what is go…Read more

40On the degrees of unsolvability of modal predicate logics of provabilityJournal of Symbolic Logic 59 (1): 253261. 1994.
Cambridge, Massachusetts, United States of America