Towards a computational account of inferentialist meaning

Piwek, Paul (2014). Towards a computational account of inferentialist meaning. In: Proceedings of the 50th Anniversary Convention of the AISB.

URL: http://doc.gold.ac.uk/aisb50/

Abstract

Both in formal and computational natural language semantics, the classical correspondence view of meaning – and, more specifically, the view that the meaning of a declarative sentence coincides with its truth conditions – is widely held. Truth (in the world or a situation) plays the role of the given, and meaning is analysed in terms of it. Both language and the world feature in this perspective on meaning, but language users are conspicuously absent. In contrast, the inferentialist semantics that Robert Brandom proposes in his magisterial book ‘Making It Explicit’ puts the language user centre stage. According to his theory of meaning, the utterance of a sentence is meaningful in as far as it is a move by a language user in a game of giving and asking for reasons (with reasons underwritten by a notion of good inferences). In this paper, I propose a prooftheoretic formalisation of the game of giving and asking for reasons that lends itself to computer implementation. In the current proposal, I flesh out an account of defeasible inferences, a variety of inferences which play a pivotal role in ordinary (and scientific) language use.

Viewing alternatives

Look up in Google Scholar

Download history

Item Actions

Export

About

CORE (COnnecting REpositories)

Recommendations