University of Pittsburgh
Department of Philosophy
PhD, 2013
Parkville, Victoria, Australia
Areas of Specialization
 Philosophy of Language Temporal Logic Logical Constants Paradoxes Liar Paradox Dialetheism Logical Pluralism Proof Theory Logic and Philosophy of Logic, Misc Substructural Logic Relevance Logic Nonclassical Logics Logic and Philosophy of Logic Deontic Logic Epistemic Logic Modal and Intensional Logic Intensional Modal Logic Modal Logic Provability Logic Semantics for Modal Logic Logic and Philosophy of Logic, General Works
16 more
Areas of Interest
 Philosophy of Language Temporal Logic Logical Constants Paradoxes Liar Paradox Dialetheism Logical Pluralism Proof Theory Logic and Philosophy of Logic, Misc Substructural Logic Relevance Logic Nonclassical Logics Logic and Philosophy of Logic Deontic Logic Epistemic Logic Modal and Intensional Logic Intensional Modal Logic Modal Logic Provability Logic Semantics for Modal Logic Logic and Philosophy of Logic, General Works
16 more
PhilPapers Editorships
 Revision Theory of Truth Proof Theory
• ##### Questions about proof theory vis-à-vis natural language semantics (2007) Anna Szabolcsi
Semantics plays a role in grammar in at least three guises. (A) Linguists seek to account for speakers‘ knowledge of what linguistic expressions mean. This goal is typically achieved by assigning a model theoretic interpretation2 in a compositional fashion. For example, No whale flies is true if and only if the intersection of the sets of whales and fliers is empty in the model. (B) Linguists seek to account for the ability of speakers to make various inferences based on semantic knowledge. For …Read more
• ##### On semilattice relevant logics Ryo Kashima Mathematical Logic Quarterly 49 (4): 401. 2003.
The semilattice relevant logics ∪R, ∪T, ∪RW, and ∪TW are defined by semilattice models in which conjunction and disjunction are interpreted in a natural way. For each of them, there is a cut-free labelled sequent calculus with plural succedents . We prove that these systems are equivalent, with respect to provable formulas, to the restricted systems with single succedents . Moreover, using this equivalence, we give a new Hilbert-style axiomatizations for ∪R and ∪T and prove equivalence between t…Read more
• ##### Sequent-systems and groupoid models. I Kosta Došen Studia Logica 47 (4). 1988.
The purpose of this paper is to connect the proof theory and the model theory of a family of propositional logics weaker than Heyting's. This family includes systems analogous to the Lambek calculus of syntactic categories, systems of relevant logic, systems related toBCK algebras, and, finally, Johansson's and Heyting's logic. First, sequent-systems are given for these logics, and cut-elimination results are proved. In these sequent-systems the rules for the logical operations are never changed…Read more
• ##### The Carcinogenic Example William Mitchell Logic Journal of the IGPL 5 (6): 795-810. 1997.
This paper will introduce a new model for Linear Logic, the IE model . Intuitively the model assumes there is a global environment which is divided up into an internal resource and an external resource. Such an assumption makes for an elementary definition of linear negation. The model results in a fairly natural semantics for the multiplicative operators and the constants of Linear Logic. A particular example of the model is given which gives a proper technical account of the cigarette example
• ##### Truth, reflection, and hierarchies Michael Glanzberg Synthese 142 (3). 2005.
A common objection to hierarchical approaches to truth is that they fragment the concept of truth. This paper defends hierarchical approaches in general against the objection of fragmentation. It argues that the fragmentation required is familiar and unprob-lematic, via a comparison with mathematical proof. Furthermore, it offers an explanation of the source and nature of the fragmentation of truth. Fragmentation arises because the concept exhibits a kind of failure of closure under reflection. …Read more
• ##### Giles's game and the proof theory of łukasiewicz logic Christian G. Fermüller and George Metcalfe Studia Logica 92 (1). 2009.
In the 1970s, Robin Giles introduced a game combining Lorenzen-style dialogue rules with a simple scheme for betting on the truth of atomic statements, and showed that the existence of winning strategies for the game corresponds to the validity of formulas in Łukasiewicz logic. In this paper, it is shown that ‘disjunctive strategies’ for Giles’s game, combining ordinary strategies for all instances of the game played on the same formula, may be interpreted as derivations in a corresponding proof…Read more
• ##### Equiparadoxicality of Yablo's Paradox and the Liar Ming Hsiung Journal of Logic, Language and Information 22 (1): 23-31. 2013.
It is proved that Yablo’s paradox and the Liar paradox are equiparadoxical, in the sense that their paradoxicality is based upon exactly the same circularity condition—for any frame ${\mathcal{K}}$ , the following are equivalent: (1) Yablo’s sequence leads to a paradox in ${\mathcal{K}}$ ; (2) the Liar sentence leads to a paradox in ${\mathcal{K}}$ ; (3) ${\mathcal{K}}$ contains odd cycles. This result does not conflict with Yablo’s claim that his sequence is non-self-referential. Rather, it giv…Read more