Publications

Abstract

Contrary to received opinion, the Aristotelian Square of Opposition (square) is logically sound, differing from standard modern predicate logic (SMPL) only in that it restricts the universe U of cognitively constructible situations by banning null predicates, making it less unnatural than SMPL. U-restriction strengthens the logic without making it unsound. It also invites a cognitive approach to logic. Humans are endowed with a cognitive predicate logic (CPL), which checks the process of cognitive modelling (world construal) for consistency. The square is considered a first approximation to CPL, with a cognitive set-theoretic semantics. Not being cognitively real, the null set Ø is eliminated from the semantics of CPL. Still rudimentary in Aristotle’s On Interpretation (Int), the square was implicitly completed in his Prior Analytics (PrAn), thereby introducing U-restriction. Abelard’s reconstruction of the logic of Int is logically and historically correct; the loca (Leaking O-Corner Analysis) interpretation of the square, defended by some modern logicians, is logically faulty and historically untenable. Generally, U-restriction, not redefining the universal quantifier, as in Abelard and loca, is the correct path to a reconstruction of CPL. Valuation Space modelling is used to compute the effects of U-restriction.

Abstract

Semantic Syntax (SeSyn), originally called Generative Semantics, is an offshoot of Chomskyan generative grammar (ChoGG), rejected by Chomsky and his school in the late 1960s. SeSyn is the theory of algorithmical grammars producing the well-formed sentences of a language L from the corresponding semantic input, the Semantic Analysis (SA), represented as a traditional tree structure diagram in a specific formal language of incremental predicate logic with quantifying and qualifying operators (including the truth functions), and with all lexical items filled in. A SeSyn-type grammar is thus by definition transformational, but not generative. The SA originates in cognition in a manner that is still largely mysterious, but its actual form can be distilled from the Surface Structure (SS) of the sentences of L following the principles set out in SeSyn. In this presentation we provide a more or less technical résumé of the SeSyn theory. A comparison is made with ChoGG-type grammars, which are rejected on account of their intrinsic unsuitability as a cognitive-realist grammar model. The ChoGG model follows the pattern of a 1930s neopositivist Carnap-type grammar for formal logical languages. Such grammars are random sentence generators, whereas, obviously, (nonpathological) humans are not. A ChoGG-type grammar is fundamentally irreconcilable with a mentalist-realist theory of grammar. The body of the paper consists in a demonstration of the production of an English and a French sentence, the latter containing a classic instance of the cyclic rule of Predicate Raising (PR), essential in the general theory of clausal complementation yet steadfastly repudiated in ChoGG for reasons that have never been clarified. The processes and categories defined in SeSyn are effortlessly recognised in languages all over the world, whether indigenous or languages of a dominant culture—taking into account language-specific values for the general theoretical parameters involved. This property makes SeSyn particularly relevant for linguistic typology, which now ranks as the most promising branch of linguistics but has so far conspicuously lacked an adequate theoretical basis.

Abstract

Translation of the first four chapters of Western linguistics: An historical introduction (1998)

Abstract

The prime purpose of this paper is, first, to restore to discourse-bound occasion sentences their rightful central place in semantics and secondly, taking these as the basic propositional elements in the logical analysis of language, to contribute to the development of an adequate logic of occasion sentences and a mathematical (Boolean) foundation for such a logic, thus preparing the ground for more adequate semantic, logical and mathematical foundations of the study of natural language. Some of the insights elaborated in this paper have appeared in the literature over the past thirty years, and a number of new developments have resulted from them. The present paper aims atproviding an integrated conceptual basis for this new development in semantics. In Section 1 it is argued that the reduction by translation of occasion sentences to eternal sentences, as proposed by Russell and Quine, is semantically and thus logically inadequate. Natural language is a system of occasion sentences, eternal sentences being merely boundary cases. The logic hasfewer tasks than is standardly assumed, as it excludes semantic calculi, which depend crucially on information supplied by cognition and context and thus belong to cognitive psychology rather than to logic. For sentences to express a proposition and thus be interpretable and informative, they must first be properly anchored in context. A proposition has a truth value when it is, moreover, properly keyed in the world, i.e. is about a situation in the world. Section 2 deals with the logical properties of natural language. It argues that presuppositional phenomena require trivalence and presents the trivalent logic PPC3, with two kinds of falsity and two negations. It introduces the notion of Σ-space for a sentence A (or A/A, the set of situations in which A is true) as the basis of logical model theory, and the notion of PA/ (the Σ-space of the presuppositions of A), functioning as a `private' subuniverse for A/A. The trivalent Kleene calculus is reinterpreted as a logical account of vagueness, rather than of presupposition. PPC3 and the Kleene calculus are refinements of standard bivalent logic and can be combined into one logical system. In Section 3 the adequacy of PPC3 as a truth-functional model of presupposition is considered more closely and given a Boolean foundation. In a noncompositional extended Boolean algebra, three operators are defined: 1a for the conjoined presuppositions of a, ã for the complement of a within 1a, and â for the complement of 1a within Boolean 1. The logical properties of this extended Boolean algebra are axiomatically defined and proved for all possible models. Proofs are provided of the consistency and the completeness of the system. Section 4 is a provisional exploration of the possibility of using the results obtained for a new discourse-dependent account of the logic of modalities in natural language. The overall result is a modified and refined logical and model-theoretic machinery, which takes into account both the discourse-dependency of natural language sentences and the necessity of selecting a key in the world before a truth value can be assigned