From conversation to inference, via consequence Dave Ripley - - PowerPoint PPT Presentation

from conversation to inference via consequence
SMART_READER_LITE
LIVE PREVIEW

From conversation to inference, via consequence Dave Ripley - - PowerPoint PPT Presentation

1/ 38 From conversation to inference, via consequence Dave Ripley University of Connecticut http://davewripley.rocks Charles Sturt University May 2015 davewripley@gmail.com From conversation to inference, via consequence 2/ 38 From bounds


slide-1
SLIDE 1

1/ 38

From conversation to inference, via consequence

Dave Ripley

University of Connecticut http://davewripley.rocks

Charles Sturt University May 2015

davewripley@gmail.com From conversation to inference, via consequence

slide-2
SLIDE 2

2/ 38

From bounds to meaning Consequence Inference

davewripley@gmail.com From conversation to inference, via consequence

slide-3
SLIDE 3

From bounds to meaning Positions and bounds 3/ 38

From bounds to meaning

Positions and bounds

davewripley@gmail.com From conversation to inference, via consequence

slide-4
SLIDE 4

From bounds to meaning Positions and bounds 4/ 38

In understanding conversational dynamics, a scoreboard model has proved helpful. Just as in sports, which moves are legal depends on the current state of play.

davewripley@gmail.com From conversation to inference, via consequence

slide-5
SLIDE 5

From bounds to meaning Positions and bounds 5/ 38

One aspect of the scoreboard is each participant’s position: the assertions and denials they’ve made. Example: It’s only appropriate to say “You’re mistaken, I didn’t eat it” to someone who’s asserted that you did eat it.

davewripley@gmail.com From conversation to inference, via consequence

slide-6
SLIDE 6

From bounds to meaning Positions and bounds 6/ 38

Positions are also useful for hypotheticals; we need to track assertions and denials under supposition as well. Example: A: “We should take a day trip to Kapiti Island; surely we’ll see a kiwi there” B: “No we wouldn’t; kiwis are nocturnal”

davewripley@gmail.com From conversation to inference, via consequence

slide-7
SLIDE 7

From bounds to meaning Positions and bounds 7/ 38

We treat some positions as impossible.

  • We don’t take them seriously,
  • we reinterpret or challenge speakers who seem to adopt them,
  • we build reductio arguments from them,
  • etc.

They are out of bounds.

davewripley@gmail.com From conversation to inference, via consequence

slide-8
SLIDE 8

From bounds to meaning Meaning from bounds 8/ 38

From bounds to meaning

Meaning from bounds

davewripley@gmail.com From conversation to inference, via consequence

slide-9
SLIDE 9

From bounds to meaning Meaning from bounds 9/ 38

These bounds can ground a theory of meaning. Example: Asserting ‘Melbourne is bigger than Canberra’ and ‘Canberra is bigger than Wagga Wagga’ while denying ‘Melbourne is bigger than Wagga Wagga’ is out of bounds. This is what it is for transitivity to be part of the meaning of ‘bigger’.

davewripley@gmail.com From conversation to inference, via consequence

slide-10
SLIDE 10

From bounds to meaning Meaning from bounds 10/ 38

Being out of bounds is like being queen, being impolite, being (racially) white. It is a socially constructed status: what really has the status depends on what we take to have it.

davewripley@gmail.com From conversation to inference, via consequence

slide-11
SLIDE 11

From bounds to meaning Meaning from bounds 11/ 38

Connecting meaning to social kinds in this way helps explain: the gradualness of linguistic change, and the impossibility of certain kinds of error.

davewripley@gmail.com From conversation to inference, via consequence

slide-12
SLIDE 12

Consequence Consequence from bounds 12/ 38

Consequence

Consequence from bounds

davewripley@gmail.com From conversation to inference, via consequence

slide-13
SLIDE 13

Consequence Consequence from bounds 13/ 38

The bounds can also ground a theory of multiple-conclusion consequence. Restall (2005, etc): A bunch of premises Γ entails a bunch of conclusions ∆ iff the position that asserts the Γs and denies the ∆s is out of bounds.

davewripley@gmail.com From conversation to inference, via consequence

slide-14
SLIDE 14

Consequence Consequence from bounds 14/ 38

Example: Asserting ‘Melbourne is bigger than Canberra’ and ‘Canberra is bigger than Wagga Wagga’ while denying ‘Melbourne is bigger than Wagga Wagga’ is out of bounds. So ‘M is bigger than C’ and ‘C is bigger than W’ together entail ‘M is bigger than W’.

davewripley@gmail.com From conversation to inference, via consequence

slide-15
SLIDE 15

Consequence Principles 15/ 38

Consequence

Principles

davewripley@gmail.com From conversation to inference, via consequence

slide-16
SLIDE 16

Consequence Principles 16/ 38

Let ‘Γ ⊢ ∆’ mean that the position that asserts the Γs and denies the ∆s is out of bounds. Then we can explore general principles for the relation ⊢. Three in particular will matter here. Identity: A ⊢ A Subposition: If Γ ⊢ ∆, then Γ, Γ′ ⊢ ∆, ∆′.

davewripley@gmail.com From conversation to inference, via consequence

slide-17
SLIDE 17

Consequence Principles 17/ 38

Extensibility: If Γ ⊢ ∆, A and A, Γ ⊢ ∆, then Γ ⊢ ∆. Extensibility (contrapositive): If Γ ⊢ ∆, then either Γ ⊢ ∆, A or A, Γ ⊢ ∆. Controversial principle: Restall accepts it; I think it’s wrong.

davewripley@gmail.com From conversation to inference, via consequence

slide-18
SLIDE 18

Consequence Principles 18/ 38

A compositional theory of conjunction: Assertibility conditions: A ∧ B, Γ ⊢ ∆ iff A, B, Γ ⊢ ∆ Deniability conditions: Γ ⊢ ∆, A ∧ B iff: both Γ ⊢ ∆, A and Γ ⊢ ∆, B.

davewripley@gmail.com From conversation to inference, via consequence

slide-19
SLIDE 19

Consequence Principles 19/ 38

This is beginning to look like a sequent calculus for classical logic. Indeed, I reckon classical logic gives a good (partial) theory of the bounds.

davewripley@gmail.com From conversation to inference, via consequence

slide-20
SLIDE 20

Inference Deductive inference 20/ 38

Inference

Deductive inference

davewripley@gmail.com From conversation to inference, via consequence

slide-21
SLIDE 21

Inference Deductive inference 21/ 38

Steinberger (2011) insists on the Principle of Answerability: “Only such deductive systems are permissible as can be seen to be suitably connected to our ordinary deductive inferential practices.” (‘Permissible’ here means for inferentialist theories of meaning.)

davewripley@gmail.com From conversation to inference, via consequence

slide-22
SLIDE 22

Inference Deductive inference 22/ 38

He uses this to object to bounds-consequence; it is not tied, he claims, to deductive inferential practices. After all, it only tells us what we may not assert and deny, not what we can deduce.

davewripley@gmail.com From conversation to inference, via consequence

slide-23
SLIDE 23

Inference Deductive inference 23/ 38

One response: concede the point. So this isn’t inferentialism. But it sure scratches the same itches.

davewripley@gmail.com From conversation to inference, via consequence

slide-24
SLIDE 24

Inference Deductive inference 24/ 38

A different response focuses

  • n “deductive inferential practices” themselves.

One key: they aspire to be non-ampliative. In a correct deductive inference, the conclusion does not go beyond the premises.

davewripley@gmail.com From conversation to inference, via consequence

slide-25
SLIDE 25

Inference Deductive inference 25/ 38

The bounds can give us an understanding

  • f non-ampliative inference.

The key is in the notion of implicit assertion.

davewripley@gmail.com From conversation to inference, via consequence

slide-26
SLIDE 26

Inference Implicit assertion 26/ 38

Inference

Implicit assertion

davewripley@gmail.com From conversation to inference, via consequence

slide-27
SLIDE 27

Inference Implicit assertion 27/ 38

A speaker has implicitly asserted something when they may as well have actually asserted it, when an assertion of it would be redundant.

davewripley@gmail.com From conversation to inference, via consequence

slide-28
SLIDE 28

Inference Implicit assertion 28/ 38

Positions have options open to them: assertions and denials that can be added without going out of bounds. An act is redundant when it does not change these options.

davewripley@gmail.com From conversation to inference, via consequence

slide-29
SLIDE 29

Inference Implicit assertion 29/ 38

Implicit assertion: A position implicitly asserts something iff actually asserting it wouldn’t change which assertions and denials would take the position out of bounds. Asserting it wouldn’t close off anything that isn’t already closed off.

davewripley@gmail.com From conversation to inference, via consequence

slide-30
SLIDE 30

Inference Implicit assertion 30/ 38

Suppose A ∧ B, Γ ⊢ ∆ iff A, B, Γ ⊢ ∆, and suppose Subposition. Then any position that asserts A ∧ B implicitly asserts A. If asserting A would close off an option, then asserting both A and B would close it off too (by Subposition), and so asserting A ∧ B has already closed it off.

davewripley@gmail.com From conversation to inference, via consequence

slide-31
SLIDE 31

Inference Non-ampliativity 31/ 38

Inference

Non-ampliativity

davewripley@gmail.com From conversation to inference, via consequence

slide-32
SLIDE 32

Inference Non-ampliativity 32/ 38

The idea: The inference from premises Γ to conclusion A is non-ampliative iff every position that asserts all of Γ implicitly asserts A. That is, an assertion of A is already implicit in any assertion of Γ. Let Γ A mean that the inference from Γ to A is non-ampliative. (Eg A ∧ B A.)

davewripley@gmail.com From conversation to inference, via consequence

slide-33
SLIDE 33

Inference Non-ampliativity 33/ 38

In our deductive inferences, we aim to reach only those conclusions already contained in our premises, in this sense. We want to deductively infer A from Γ only if Γ A. This is the tie to inferential practice. What’s it like?

davewripley@gmail.com From conversation to inference, via consequence

slide-34
SLIDE 34

Inference Non-ampliativity 34/ 38

No matter what the bounds are, this gives reflexivity and monotonicity, not now for bounds-consequence, but for non-ampliative inference. Facts:

  • A ⊢ A
  • If Γ A, then Γ, ∆ A.

We might also get a kind of transitivity: If the bounds obey Subposition:

  • If Γ A and ∆, A B, then ∆ ∪ Γ B.

davewripley@gmail.com From conversation to inference, via consequence

slide-35
SLIDE 35

Inference Non-ampliativity 35/ 38

We can also connect non-ampliative inference to bounds-consequence. If the bounds obey Identity: If Γ A, then Γ ⊢ A. If the bounds obey Extensibility: If Γ ⊢ A, then Γ A.

davewripley@gmail.com From conversation to inference, via consequence

slide-36
SLIDE 36

Inference Non-ampliativity 36/ 38

That is, given Identity and Extensibility, bounds-consequence is exactly what we want to limit our deductive inferential practices to. It meets Steinberger’s Principle of Answerability.

davewripley@gmail.com From conversation to inference, via consequence

slide-37
SLIDE 37

Inference Non-ampliativity 37/ 38

Even without Extensibility for the bounds, is a perfectly sensible relation. It still connects the bounds to deductive inference. It is just that it may not match bounds-consequence.

davewripley@gmail.com From conversation to inference, via consequence

slide-38
SLIDE 38

Inference Non-ampliativity 38/ 38

  • The bounds give us a way to understand linguistic meaning in

terms of a particular social kind.

  • They also give (at least) two workable notions of consequence:

bounds-consequence and non-ampliativity.

  • If the bounds are extensibile, these notions collapse.
  • Either way, non-ampliativity meets Steinberger’s Principle of

Answerability.

davewripley@gmail.com From conversation to inference, via consequence