Download e-book for kindle: Modality by Joseph Melia

By Joseph Melia

ISBN-10: 184465334X

ISBN-13: 9781844653348

Show description

Read or Download Modality PDF

Best semantics books

Download e-book for iPad: Etudes semantiques et pragmatiques sur le temps, l'aspect et by Louis de Saussure, Jacques Moeschler, Genoveva Puskas

Ce quantity rassemble une s? rie d'articles qui accordent une consciousness particuli? re ? des ph? nom? nes qui mettent sp? cifiquement en relation le niveau s? mantique et pragmatique de l'interpr? tation. Les textes ici pr? despatched? s font directement appel ? des notions comme los angeles repr? sentation d'? v? nements, l. a. prise en cost, le contexte narratif, los angeles s?

Brian Paltridge's Discourse Analysis: An Introduction PDF

Discourse research: An advent is a complete, available creation to discourse research. In a sequence of 9 chapters the booklet examines varied methods to discourse, discourse and society, discourse and pragmatics, discourse and style, discourse and dialog, discourse grammar, corpus-based techniques to discourse and demanding discourse research.

Additional info for Modality

Example text

That is all that is new about our language. In particular, it does not contain any new logical operators, such as ~ and . As this is nothing more than a first-order language, the usual rules of well-formedness apply to this language and we can use what we know from the predicate calculus to put strings of symbols together to form grammatical sentences. 16 Numerical quantification revisited Sentences such as “There are three ways in which Joe could win his chess match” count the possible ways in which a certain event could occur.

The predicate letters F, G, H, . . the two-place predicate = the names a, b, c, . . the brackets ( and ). These items are to be thought of as the “letters” of the language. The predicate calculus also contains rules for which strings of letters are well formed. We are familiar with sensible strings of symbols, such as Fa & Gb and ∀x∃yRxy, but any old string of symbols does not MODAL LANGUAGE AND MODAL LOGIC 23 count as a well-formed formula of the language. For example, aF→x∃ is ungrammatical: this particular string of symbols is not well formed.

Note that nothing is F at w2. The rightmost world again contains two elements, this time b and c, both of which are F, but only b is G. For non-modal sentences, that is, sentences that do not contain ~ or , determining which sentences are true or false at a world is just the same as determining which sentences are true or false in a model in the first-order predicate calculus. To work out whether or not a modal sentence is true or false in the model, we just have to see which non-modal sentences are true at the various worlds.

Download PDF sample

Modality by Joseph Melia


by Edward
4.3

Rated 4.37 of 5 – based on 31 votes