Axiomathes 29 (3):285-288 (2019)

Tristan Grøtvedt Haze
University of Melbourne
Carnap’s result about classical proof-theories not ruling out non-normal valuations of propositional logic formulae has seen renewed philosophical interest in recent years. In this note I contribute some considerations which may be helpful in its philosophical assessment. I suggest a vantage point from which to see the way in which classical proof-theories do, at least to a considerable extent, encode the meanings of the connectives (not by determining a range of admissible valuations, but in their own way), and I demonstrate a kind of converse to Carnap’s result.
Keywords connectives  meaning  categoricity  proof-theory  propositional logic  inferentialism
Categories (categorize this paper)
Reprint years 2019
DOI 10.1007/s10516-018-9393-3
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Truth as One and Many.Michael P. Lynch - 2009 - Clarendon Press.
Truth as One and Many. [REVIEW]Michael Lynch - 2010 - Analysis 70 (1):191-193.
Formalization of Logic.Rudolf Carnap - 1943 - Cambridge: Mass., Harvard University Press.

View all 12 references / Add more references

Citations of this work BETA

How May the Propositional Calculus Represent?Tristan Haze - 2017 - South American Journal of Logic 3 (1):173-184.

Add more citations

Similar books and articles

Speech Acts, Categoricity, and the Meanings of Logical Connectives.Ole Thomassen Hjortland - 2014 - Notre Dame Journal of Formal Logic 55 (4):445-467.
An Expressivist Bilateral Meaning-is-Use Analysis of Classical Propositional Logic.John Cantwell - 2015 - Journal of Logic, Language and Information 24 (1):27-51.
Proof-Functional Connectives and Realizability.Franco Barbanera & Simone Martini - 1994 - Archive for Mathematical Logic 33 (3):189-211.
Noisy Vs. Merely Equivocal Logics.Patrick Allo - 2013 - In Francesco Berto, Edwin Mares, Koji Tanaka & Francesco Paoli (eds.), Paraconsistency: Logic and Applications. Springer. pp. 57--79.


Added to PP index

Total views
345 ( #29,342 of 2,498,789 )

Recent downloads (6 months)
22 ( #39,183 of 2,498,789 )

How can I increase my downloads?


My notes