First-Order Logic with Adverbs

Download Edit this record How to cite View on PhilPapers
Abstract
In this paper I introduce a logical treatment of adverbs based on first-order logic with identity (FOL). The guiding idea is that an adverb can come between an individual constant and a predicate, such that its addition to a true statement can result in a false statement - or in another true statement, but a different one. In contrast to prominent logical treatments of adverbs in the literature, the aim is not to model details of natural language, but to add to FOL a flexible, simple device inspired by adverbs in natural language, while retaining much of the elegance and the desirable metalogical properties of FOL. In Section 1 I outline the general aim, the notation, and the desired inferential behaviour of adverb-containing propositions. In Sections 2, 3 and 4 I define the extended language, make the necessary addition to its semantics, and update the definition of truth on a model. In Section 5 I exhibit how the consequence relation induced by the semantics gives us the desired inferential behaviour. In Section 6 I explain how a tree system which is sound and complete for FOL can be extended to FOL with adverbs. In Section 7 I give tree proofs of the consequences exhibited in Section 5. In Section 8 I show that the augmented tree system is sound and complete for FOL with adverbs. I conclude in Section 9 with some remarks on possible applications and extensions of the device introduced here.
PhilPapers/Archive ID
HAZFLW
Revision history
First archival date: 2018-11-28
Latest version: 5 (2018-12-06)
View upload history
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2018-11-28

Total downloads
41 ( #29,646 of 37,122 )

Recent downloads (6 months)
41 ( #8,620 of 37,122 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.