Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T05:41:14.113Z Has data issue: false hasContentIssue false

SUBATOMIC INFERENCES: AN INFERENTIALIST SEMANTICS FOR ATOMICS, PREDICATES, AND NAMES

Published online by Cambridge University Press:  02 July 2021

KAI TANTER*
Affiliation:
MONASH UNIVERSITY SCHOOL OF PHILOSOPHICAL HISTORICAL AND INTERNATIONAL STUDIES MONASH UNIVERSITY CLAYTON, VIC 3800, AUSTRALIA
Rights & Permissions [Opens in a new window]

Abstract

Inferentialism is a theory in the philosophy of language which claims that the meanings of expressions are constituted by inferential roles or relations. Instead of a traditional model-theoretic semantics, it naturally lends itself to a proof-theoretic semantics, where meaning is understood in terms of inference rules with a proof system. Most work in proof-theoretic semantics has focused on logical constants, with comparatively little work on the semantics of non-logical vocabulary. Drawing on Robert Brandom’s notion of material inference and Greg Restall’s bilateralist interpretation of the multiple conclusion sequent calculus, I present a proof-theoretic semantics for atomic sentences and their constituent names and predicates. The resulting system has several interesting features: (1) the rules are harmonious and stable; (2) the rules create a structure analogous to familiar model-theoretic semantics; and (3) the semantics is compositional, in that the rules for atomic sentences are determined by those for their constituent names and predicates.

MSC classification

Information

Type
Research Article
Copyright
© The Author(s), 2021. Published by Cambridge University Press on behalf of The Association for Symbolic Logic
Figure 0

Fig. 1Definition.

Figure 1

Fig. 2Natural deduction definitional closure.

Figure 2

Fig. 3Natural deduction definitional reflection.

Figure 3

Fig. 4Sequent definitional closure.

Figure 4

Fig. 5Sequent definitional reflection.

Figure 5

Fig. 6Structural rules.

Figure 6

Fig. 7Bachelorette example.

Figure 7

Fig. 8Number example.

Figure 8

Fig. 9Super example.

Figure 9

Fig. 10Concept clusters.

Figure 10

Fig. 11Example collection of concept clusters.

Figure 11

Fig. 12General rule forms.

Figure 12

Fig. 13Number, odd, even $\langle \{O,E\}, \{N\}\rangle $ rules.

Figure 13

Fig. 14Bachelorette, single, female, young $\langle \{B\}, \{S,F, Y\}\rangle $ rules.

Figure 14

Fig. 15Superman, Clark Kent $\langle \{S\},\{C\}\rangle $ rules.

Figure 15

Fig. 16First rules.

Figure 16

Fig. 17Second rules.

Figure 17

Fig. 18Soundness of $P\mathrm {R}$ relative to $C\mathrm {R}$ and $P\mathrm {L_2}$.

Figure 18

Fig. 19Soundness of $C\mathrm {L}$ relative to $P\mathrm {L_1}$.

Figure 19

Fig. 20Completeness of $P\mathrm {R}$ relative to $C\mathrm {R}$ and $P\mathrm {L_2}$.

Figure 20

Fig. 21Completeness of $C\mathrm {L}$ relative to $P\mathrm {L_1}$.

Figure 21

Fig. 22General rule forms.

Figure 22

Fig. 23Name $\langle \{b\},\{a\}\rangle $ and predicate $\langle \{D,E\},\{C\}\rangle $ cluster trees.

Figure 23

Fig. 24Predicate and name cluster diagram.