profile picture

Neil Tennant

Ohio State University
 More details
  •  48
    Were Those Disproofs I Saw before Me?
    Analysis 44 (3). 1984.
  • On epsilon and [E]
    Analysis 40 (1): 5. 1980.
  •  10
    Beth’s Theorem and Reductionism
    Pacific Philosophical Quarterly 66 (3-4): 342-354. 2017.
    Areas of Mathematics
  •  94
    The taming of the true
    Oxford University Press. 1997.
    The Taming of the True poses a broad challenge to realist views of meaning and truth that have been prominent in recent philosophy. Neil Tennant argues compellingly that every truth is knowable, and that an effective logical system can be based on this principle. He lays the foundations for global semantic anti-realism and extends its consequences from the philosophy of mathematics and logic to the theory of meaning, metaphysics, and epistemology.
    KnowabilitySemantic Anti-Realism
  •  48
    Harmony in a sequent setting
    Analysis 70 (3): 462-468. 2010.
    Proof Theory
  •  222
    Natural deduction and sequent calculus for intuitionistic relevant logic
    Journal of Symbolic Logic 52 (3): 665-680. 1987.
    Relevance LogicProof Theory
  •  177
    On negation, truth and warranted assertibility
    Analysis 55 (2): 98-104. 1995.
    All parties to the proceedings that follow concur with DS. The question is whether there is anything more to truth than can be gleaned from DS alone. Deflationism holds that there is nothing more to truth than this. Now it would appear that 'warrantedly assertible' can play the role of T in DS. Hence it would appear that the deflationist would be able to identify truth with warranted assertibility
    Semantic Anti-RealismNegationDeflationism about Truth, Misc
  •  32
    Theory-Contraction is NP-Complete
    Logic Journal of the IGPL 11 (6): 675-693. 2003.
    I investigate the problem of contracting a dependency-network with respect to any of its nodes. The resulting contraction must not contain the node in question, but must also be a minimal mutilation of the original network. Identifying successful and minimally mutilating contractions of dependency-networks is non-trivial, especially when non-well-founded networks are to be taken into account. I prove that the contraction problem is NP-complete.1
    Formal Epistemology
  • Editor's Page: The View from Erewhon
    American Philosophical Quarterly 42 (4): 233-235. 2005.
  •  71
    Language games and intuitionism
    Synthese 42 (2). 1979.
    Intuitionistic Logic
  •  1
    An Anti-Realist Critique of Dialetheism
    In Graham Priest, J. C. Beall & Bradley Armour-Garb (eds.), The Law of Non-Contradiction, Clarendon Press. 2004.
  •  2
    Simplicity
    Philosophical Books 18 (1): 43-45. 1977.
    Simplicity and ParsimonyTheoretical Virtues, Misc
  •  74
    Discussion. Changing the theory of theory change: reply to my critics
    British Journal for the Philosophy of Science 48 (4): 569-586. 1997.
    ‘Changing the Theory of Theory Change: Towards a Computational Approach’ (Tennant [1994]; henceforth CTTC) claimed that the AGM postulate of recovery is false, and that AGM contractions of theories can be more than minimally mutilating. It also described an alternative, computational method for contracting theories, called the Staining Algorithm. Makinson [1995] and Hansson and Rott [1995] criticized CTTC's arguments against AGM-theory, and its specific proposals for an alternative, computationa…Read more
    Theory Change