-
244XIII*—Two Problems with Tarski's Theory of ConsequenceProceedings of the Aristotelian Society 92 (1): 273-292. 1992.Vann McGee; XIII*—Two Problems with Tarski's Theory of Consequence, Proceedings of the Aristotelian Society, Volume 92, Issue 1, 1 June 1992, Pages 273–292, htt.
-
1Truth 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 Urbana-Champaign, June 3–7, 2000Bulletin of Symbolic Logic 6 (3). 2000.
-
Structures and the Hyperarithmetical Hierarchy. Knight has directed or co-directed 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 (1989-1995) (review)Bulletin of Symbolic Logic 6 (1). 2000.
-
33Ramsey and the Correspondence TheoryIn Volker Halbach & Leon Horsten (eds.), Principles of truth, Hänsel-hohenhausen. pp. 153-168. 2002.
-
323Timothy Williamson, vagueness: London and new York: 1994 (review)Linguistics and Philosophy 21 (2): 221-235. 1998.
-
27The Philosophical Review: Vol. 106, No.1, January 1997Review of Metaphysics 51 (1): 208-208. 1997.
-
46[Omnibus Review]Journal of Symbolic Logic 56 (1): 329-332. 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
-
254KilimanjaroCanadian Journal of Philosophy 27 (sup1): 141-163. 1997.This is not an overly ambitious paper. What I would like to do is to take a thesis that most people would regard as wildly implausible, and convince you that it is, in fact, false. What's worse, the argument I shall give is by no means airtight, though I hope it's reasonably convincing. The thesis has to do with the fuzzy boundaries of terms that refer to familiar middle-sized objects, terms like ‘Kilimanjaro’ and ‘the tallest mountain in Africa.’ It is intuitively clear that Kilimanjaro has a f…Read more
-
63Etchemendy John. The concept of logical consequence. An unaltered republication of jsl lvii 254. The David Hume series of philosophy and cognitive science reissues. Center for the study of language and information, Stanford 1999, also distributed by cambridge university press, new York, VII + 174 pp (review)Bulletin of Symbolic Logic 7 (3): 379-380. 2001.
-
128Vagueness, and Paradox: An Essay in the Logic of Truth (review)Philosophical Review 103 (1): 142-144. 1994.
-
236Truth by defaultPhilosophia Mathematica 9 (1): 5-20. 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 second-order natural deduction r…Read more
-
219Review: John Etchemendy, The Concept of Logical Consequence (review)Bulletin of Symbolic Logic 7 (3): 379-380. 2001.
-
258Logical operationsJournal of Philosophical Logic 25 (6). 1996.Tarski and Mautner proposed to characterize the "logical" operations on a given domain as those invariant under arbitrary permutations. These operations are the ones that can be obtained as combinations of the operations on the following list: identity; substitution of variables; negation; finite or infinite disjunction; and existential quantification with respect to a finite or infinite block of variables. Inasmuch as every operation on this list is intuitively "logical", this lends support to …Read more
-
3Universal Universal QuantificationIn J. C. Beall (ed.), Liars and Heaps, Oxford University Press Uk. pp. 357-364. 2004.
-
220How truthlike can a predicate be? A negative resultJournal of Philosophical Logic 14 (4). 1985.
-
340Conditional probabilities and compounds of conditionalsPhilosophical Review 98 (4): 485-541. 1989.
-
239Thought, thoughts, and deflationismPhilosophical Studies 173 (12): 3153-3168. 2016.Deflationists about truth embrace the positive thesis that the notion of truth is useful as a logical device, for such purposes as blanket endorsement, and the negative thesis that the notion doesn’t have any legitimate applications beyond its logical uses, so it cannot play a significant theoretical role in scientific inquiry or causal explanation. Focusing on Christopher Hill as exemplary deflationist, the present paper takes issue with the negative thesis, arguing that, without making use of …Read more
-
4There are many thingsIn Judith Thomson & Alex Byrne (eds.), Content and modality: themes from the philosophy of Robert Stalnaker, Oxford University Press. pp. 93--122. 2006.
-
129On the degrees of unsolvability of modal predicate logics of provabilityJournal of Symbolic Logic 59 (1): 253-261. 1994.
Cambridge, Massachusetts, United States of America