This article summarizes the main ideas for formalizing categorial languages genrated by classical categorial grammar originated by K. Ajdukiewicz [1935,1960].This formalization is presented in detail in the author's monographs in Polish "Teorie Języków Syntaktycznie Kategorialnych" ("Theories of Syntactically Categorical Languages"), PWN, Warszawa-Wrocław 1985 and in English "Theory of Language Syntax, Categorial Approach", Kluwer Academic Publishers, Boston-London-Dordrecht 1991.

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by (...) the so-called classical categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

Classical categorial grammars are the grammars introduced by Ajdukiewicz [1] and formalized by Bar-Hillel [2], Bar-Hillel et al. [3]. In [3] there is proved the weak equivalence of CCG’s and context-free grammars [6]. In this note we characterize the strong generative capacity of finite and rigid CCG’s, i.e. their capacity of structure generation. These results are more completely discussed in [4], [5].

The paper contains an overview of the most important results presented in the monograph of the author "Teorie Językow Syntaktycznie-Kategorialnych" ("Theories of Syntactically-Categorial Languages" (in Polish), PWN, Warszawa-Wrocław 1985. In the monograph four axiomatic systems of syntactically-categorial languages are presented. The first two refer to languages of expression-tokens. The others also takes into consideration languages of expression-types. Generally, syntactically-categorial languages are languages built in accordance with principles of the theory of syntactic categories introduced by S. (...) Leśniewski [1929,1930]; they are connected with- the Ajdukiewicz’s work [1935] which was a continuation of Leśniewski’s idea and further developed and popularized in the research on categorial grammars, by Y. Bar-Hillel [1950,1953,1964]. To assign a suitable syntactic category to each word of the vocabulary is the main idea of syntactically-categorial approach to language. Compound expressions are built from the words of the vocabulary and then a suitable syntactic-category is assigned to each of them. A language built in this way should be decidable, which means that there should exist an algorithm for deciding about each expression of it, whether it is well-formed or is syntactically connected . The traditional, originating from Husserl, understanding of the syntactic category confronts some difficulties. This notion is defined by abstraction using the concept of affiliation of two expressions to the same syntactic category. (shrink)

This paper deals with Tarski's first axiomatic presentations of the syntax of deductive system. Andrzej Grzegorczyk's significant results which laid the foundations for the formalization of metalogic, are touched upon briefly. The results relate to Tarski's theory of concatenation, also called the theory of strings, and to Tarski's ideas on the formalization of metamathematics. There is a short mention of author's research in the field. The main part of the paper surveys research on the theory (...) of deductive systems initiated by Tarski, in particular research on the axiomatization of the general notion of consequence operation, axiom systems for the theories of classic consequence and for some equivalent theories, and axiom systems for the theories of nonclassic consequence. In this paper the results of Jerzy Supecki's research are taken into account, and also the author's and other people belonging to his circle of scientific research. Particular study is made of his dual characterization of deductive systems, both as systems in regard to acceptance and systems in regard to rejection . Comparison is made, therefore, with axiomatizations of the theories of rejection and dual consequence, and the theory of the usual consequence operation. (shrink)

The book is a collection of papers and aims to unify the questions of syntax and semantics of language, which are included in logic, philosophy and ontology of language. The leading motif of the presented selection of works is the differentiation between linguistic tokens (material, concrete objects) and linguistic types (ideal, abstract objects) following two philosophical trends: nominalism (concretism) and Platonizing version of realism. The opening article under the title “The Dual Ontological Nature of Language Signs and the Problem of (...) Their Mutual Relations” provides a broad introduction into the problem area connected with this differentiation, while the logic-formal characteristics of the distinction are framed in the work entitled “On the Type-Token Relationships” (Chapter 1). The basic part of the book deals with issues relating to syntax (Chapters 2-4) and semantics of language (Chapters 5-6), as well as pertaining to syntactic-semantic pragmatic questions (Chapters 7-13). Throughout the book, language, categorial language, is characterized syntactically as generated by classical categorial grammar (Chapter 2) and formalized on two opposing levels: as language of expression-tokens (level of tokens) and language of expression-types (level of types). The author’s considerations contained in Chapters 2 and 4 lead to the important philosophical conclusion that in formal-logical syntactic studies on language the assumption that expression-types constitute the primary language layer while expression-tokens make the secondary one, can be neglected; thus, this speaks in favour of the opposing standpoint—the concretistic one—in the ontology of language syntax. In the works “Meaning and Interpretations”, Parts I and II (Chapters 5 and 6), it is underlined, however, that such semantic concepts as: meaning, denotation and interpretation are defined on the types level, yet their formal definitions require making use of notions of the tokens level. The semantic notions introduced in the above-mentioned articles are also used in the following works of the present selection, under the titles: “Three Principles of Compositionality” and “On Metaknowledge and Truth” (Chapters 7 and 8). They formalize two principles of compositionality that are well known in the literature on the subject, deriving from Frege, i.e. those of meaning and of denotation; they are related to the syntactic principle of compositionality which was introduced by the author. All the three principles are, at the same time, three conditions of homomorphism of categorial language algebra into three kinds of non-standard models of language (one syntactic and two semantic ones: intensional and extensional), which allows introducing three definitions of truthfulness into these models. The next two works in the collection, entitled: “On Language Adequacy” and “What is the Sense in Logic and Philosophy of Language” (Chapters 9 and 10) concern adequacy of categorial language syntax along with its dual semantics: intensional and extensional, and categorial compatibility of any of its syntactic categories with two corresponding semantic categories: intensional and extensional, based on the compatibility the syntactic category of each language expression with the ontological category assigned to its denotatum. The well-known problem of categorial compatibility for first-order quantifiers finds its solution in the paper “Categories of First-Order Quantifiers” (Chapter 11). In the work “Logic and Ontology of Language” (Chapter 12), being in a sense a summary of the considerations presented in the preceding chapters of the book, language is treated as an ontological being, characterized in compliance with the logical conception of language proposed by Ajdukiewicz. Application—like throughout the book—of tools of classical logic and set theory has resulted in emergence of a general formal logical theory of syntax, semantics and pragmatics of language, which takes into account duality in the understanding of linguistic expressions as tokens (concretes) and types (abstract objects). In terms that take into account a functional approach to language itself, there comes out an ontological neutrality of logic with respect to existential assumptions relating to the ontological nature of linguistic expressions and their extra-linguistic ontological counterparts. The issues connected with applying logic while explaining the manner of using linguistic tokens and linguistic types to determine notions of language communication are raised and illustrated in the last chapter of the work, bearing the title “A Logical Conceptualization of Knowledge on the Notion of Language Communication”. (shrink)

The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite sequences of lambda terms are the basic data structures, (...) pairs of terms syntax, semantics for example. These sequences then combine with the help of simple generalizations of the usual abstraction and application operations. This theory, which I call Lambda Grammars and which is closely related to the independently formulated theory of Abstract Categorial Grammars (de Groote, 2001; de Groote, 2002), in fact is an implementation of Curry’s ideas: the level of tectogrammar is encoded by the sequences of lambda-terms and their ways of combination, while the syntactic terms in those sequences constitute the phenogrammatical level. In de Groote’s formulation of the theory, tectogrammar is the level of abstract terms, while phenogrammar is the level of object terms. (shrink)

There is currently much interest in bringing together the tradition of categorial grammar, and especially the Lambek calculus, with the recent paradigm of linear logic to which it has strong ties. One active research area is designing non-commutative versions of linear logic (Abrusci, 1995; Retoré, 1993) which can be sensitive to word order while retaining the hypothetical reasoning capabilities of standard (commutative) linear logic (Dalrymple et al., 1995). Some connections between the Lambek calculus and computations in groups have long (...) been known (van Benthem, 1986) but no serious attempt has been made to base a theory of linguistic processing solely on group structure. This paper presents such a model, and demonstrates the connection between linguistic processing and the classical algebraic notions of non-commutative free group, conjugacy, and group presentations. A grammar in this model, or G-grammar is a collection of lexical expressions which are products of logical forms, phonological forms, and inverses of those. Phrasal descriptions are obtained by forming products of lexical expressions and by cancelling contiguous elements which are inverses of each other. A G-grammar provides a symmetrical specification of the relation between a logical form and a phonological string that is neutral between parsing and generation modes. We show how the G-grammar can be oriented for each of the modes by reformulating the lexical expressions as rewriting rules adapted to parsing or generation, which then have strong decidability properties (inherent reversibility). We give examples showing the value of conjugacy for handling long-distance movement and quantifier scoping both in parsing and generation. The paper argues that by moving from the free monoid over a vocabulary V (standard in formal language theory) to the free group over V, deep affinities between linguistic phenomena and classical algebra come to the surface, and that the consequences of tapping the mathematical connections thus established can be considerable. (shrink)

Second-order abstract categorial grammars (de Groote in Association for computational linguistics, 39th annual meeting and 10th conference of the European chapter, proceedings of the conference, pp. 148–155, 2001) and hyperedge replacement grammars (Bauderon and Courcelle in Math Syst Theory 20:83–127, 1987; Habel and Kreowski in STACS 87: 4th Annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 247, Springer, Berlin, pp 207–219, 1987) are two natural ways of generalizing “context-free” grammar formalisms for string (...) and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. in Theor Comput Sci 88:191–229, 1991) or linear context-free rewriting systems (Weir in Characterizing mildly context-sensitive grammar formalisms, University of Pennsylvania, 1988). In this paper, we give a simple, direct proof of the fact that second-order ACGs are simulated by hyperedge replacement grammars, which implies that the string and tree generating power of the former is included in that of the latter. The normal form for tree-generating hyperedge replacement grammars given by Engelfriet and Maneth (Graph transformation. Lecture notes in computer science, vol 1764. Springer, Berlin, pp 15–29, 2000) can then be used to show that the tree generating power of second-order ACGs is exactly the same as that of hyperedge replacement grammars. (shrink)

The paper discusses the origin of dark matter and dark energy from the concepts of time and the totality in the final analysis. Though both seem to be rather philosophical, nonetheless they are postulated axiomatically and interpreted physically, and the corresponding philosophical transcendentalism serves heuristically. The exposition of the article means to outline the “forest for the trees”, however, in an absolutely rigorous mathematical way, which to be explicated in detail in a future paper. The “two deductions” are two successive (...) stage of a single conclusion mentioned above. The concept of “transcendental invariance” meaning ontologically and physically interpreting the mathematical equivalence of the axiom of choice and the well-ordering “theorem” is utilized again. Then, time arrow is a corollary from that transcendental invariance, and in turn, it implies quantum information conservation as the Noether correlate of the linear “increase of time” after time arrow. Quantum information conservation implies a few fundamental corollaries such as the “conservation of energy conservation” in quantum mechanics from reasons quite different from those in classical mechanics and physics as well as the “absence of hidden variables” (versus Einstein’s conjecture) in it. However, the paper is concentrated only into the inference of another corollary from quantum information conservation, namely, dark matter and dark energy being due to entanglement, and thus and in the final analysis, to the conservation of quantum information, however observed experimentally only on the “cognitive screen” of “Mach’s principle” in Einstein’s general relativity. therefore excluding any other source of gravitational field than mass and gravity. Then, if quantum information by itself would generate a certain nonzero gravitational field, it will be depicted on the same screen as certain masses and energies distributed in space-time, and most presumably, observable as those dark energy and dark matter predominating in the universe as about 96% of its energy and matter quite unexpectedly for physics and the scientific worldview nowadays. Besides on the cognitive screen of general relativity, entanglement is available necessarily on still one “cognitive screen” (namely, that of quantum mechanics), being furthermore “flat”. Most probably, that projection is confinement, a mysterious and ad hoc added interaction along with the fundamental tree ones of the Standard model being even inconsistent to them conceptually, as far as it need differ the local space from the global space being definable only as a relation between them (similar to entanglement). So, entanglement is able to link the gravity of general relativity to the confinement of the Standard model as its projections of the “cognitive screens” of those two fundamental physical theories. (shrink)

We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial time, this proves that a sentence generated by any non-associative Lambek categorial grammar can be recognized in polynomial time.

The equivalence of (classical) categorial grammars and context-free grammars, proved by Gaifman [4], is a very basic result of the theory of formal grammars (an essentially equivalent result is known as the Greibach normal form theorem [1], [14]). We analyse the contents of Gaifman's theorem within the framework of structure and type transformations. We give a new proof of this theorem which relies on the algebra of phrase structures and exhibit a possibility to justify the key construction (...) used in Gaifman's proof by means of the Lambek calculus of syntactic types [15]. (shrink)

This book presents a formal and philosophical analysis of language syntax. It refers to some ideas of E.Husserl and G. Frege, to S. Leśniewski's theory of syntactic categories and K. Ajdukiewicz's conception of formal grammar, also to Ch.S. Pierces's distinction between tokens (concrete linguistic entities) and types (ideal linguistic entities) and to A.A. Markov's theory of algorithms. The central aim of the book is - in the spirit of these ideas - to provide both strict yet comprehensive lectures (...) on two axiomatic theories of languages (grammars) irrespective of specific structure of their expression and the notation used in them. The main feature of these theories are that definitions of well-formed expression allow the formulation of algorithms for the examination of syntactic correctness of expressions and that their formalizations are bi-level, in reference to opposite philosophical orientations: nominalistic and idealistic. The theoretical considerations in the book speak in favour of the former. The book contains a translation of the basic contents of the book in Polish "Teorie języków syntaktycznie kategorialnych ("Theories of syntactically categorial languages"), PWN, Warszawa-Wrocław 1985, and extensive Introduction and Final Remarks. In Introduction are discussed the main assumptions, objectives and conditionings of presented theories and intuitive foundations of these theories. Final Remarks are connected with the subject-matter of the book and the ability to build syntax theories in the opposition spirit, because of the Platonic approach to language syntax. -/- . (shrink)

Two axiomatizations of the nonassociative and commutative Lambek syntactic calculus are given and their equivalence is proved. The first axiomatization employs Permutation as the only structural rule, the second one, with no Permutation rule, employs only unidirectional types. It is also shown that in the case of the Ajdukiewicz calculus an analogous equivalence is valid only in the case of a restricted set of formulas. Unidirectional axiomatizations are employed in order to establish the generative power of categorial grammars based (...) on the nonassociative and commutative Lambek calculus with product. Those grammars produce CF-languages of finite degree generated by CF-grammars closed with respect to permutations. (shrink)

[1]. Recently renewed interest in non transformational approaches to syntax [2] suggests that it might be well to take another look at categorial grammars, since they seem to have been neglected largely because they had been shown to be equivalent to context free phrase structure grammars in weak generative capacity and it was believed that such grammars were incapable of describing natural languages in a natural way. It is my purpose here to sketch a theory of grammar which (...) represents a generalization of categorial grammars of the sort invented by Ajdukiewicz (1935) and further elaborated especially by Bar Hillel (1953) and Lambek (1961). (shrink)

Sequent calculi constitute an interesting and important category of proof systems. They are much less known than axiomatic systems or natural deduction systems are, and they are much less known than they should be. Sequent calculi were designed as a theoretical framework for investigations of logical consequence, and they live up to the expectations completely as an abundant source of meta-logical results. The goal of this book is to provide a fairly comprehensive view of sequent calculi -- including a (...) wide range of variations. The focus is on sequent calculi for various non-classical logics, from intuitionistic logic to relevance logic, through linear and modal logics. A particular version of sequent calculi, the so-called consecution calculi, have seen important new developments in the last decade or so. The invention of new consecution calculi for various relevance logics allowed the last major open problem in the area of relevance logic to be solved positively: pure ticket entailment is decidable. An exposition of this result is included in chapter 9 together with further new decidability results (for less famous systems). A series of other results that were obtained by J. M. Dunn and me, or by me in the last decade or so, are also presented in various places in the book. Some of these results are slightly improved in their current presentation. Obviously, many calculi and several important theorems are not new. They are included here to ensure the completeness of the picture; their original formulations may be found in the referenced publications. This book contains very little about semantics, in general, and about the semantics of non-classical logic in particular. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 purely (...) inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. These (...) practices presuppose, respectively, a criterion of validity and a criterion of invalidity each of which has been extended and refined by modern logicians: deductions are studied in formal syntax (proof theory) and coun¬termodels are studied in formal semantics (model theory). The purpose of this paper is to compare these two criteria to the corresponding criteria employed in Boole’s first logical work, The Mathematical Analysis of Logic (1847). In particular, this paper presents a detailed study of the relevant metalogical passages and an analysis of Boole’s symbolic derivations. It is well known, of course, that Boole’s logical analysis of compound terms (involving ‘not’, ‘and’, ‘or’, ‘except’, etc.) contributed to the enlargement of the class of propositions and arguments formally treatable in logic. The present study shows, in addition, that Boole made significant contributions to the study of deduc¬tive reasoning. He identified the role of logical axioms (as opposed to inference rules) in formal deductions, he conceived of the idea of an axiomatic deductive sys¬tem (which yields logical truths by itself and which yields consequences when ap¬plied to arbitrary premises). Nevertheless, surprisingly, Boole’s attempt to imple¬ment his idea of an axiomatic deductive system involved striking omissions: Boole does not use his own formal deductions to establish validity. Boole does give symbolic derivations, several of which are vitiated by “Boole’s Solutions Fallacy”: the fallacy of supposing that a solution to an equation is necessarily a logical consequence of the equation. This fallacy seems to have led Boole to confuse equational calculi (i.e., methods for gen-erating solutions) with deduction procedures (i.e., methods for generating consequences). The methodological confusion is closely related to the fact, shown in detail below, that Boole had adopted an unsound criterion of validity. It is also shown that Boole totally ignored the countermodel criterion of invalid¬ity. Careful examination of the text does not reveal with certainty a test for invalidity which was adopted by Boole. However, we have isolated a test that he seems to use in this way and we show that this test is ineffectual in the sense that it does not serve to identify invalid arguments. We go beyond the simple goal stated above. Besides comparing Boole’s earliest criteria of validity and invalidity with those traditionally (and still generally) employed, this paper also investigates the framework and details of THE MATHEMATICAL ANALYSIS OF LOGIC. (shrink)

Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL interactive proof assistant, and this formalization utilizes a semantically correct embedding of free logic in classical higher-order logic. The modeling and formal analysis of our axiom sets has been significantly supported by series of experiments with automated reasoning tools integrated with Isabelle/HOL. We also (...) address the relation of our axiom systems to alternative proposals from the literature, including an axiom set proposed by Freyd and Scedrov for which we reveal a technical issue (when encoded in free logic where free variables range over defined and undefined objects): either all operations, e.g. morphism composition, are total or their axiom system is inconsistent. The repair for this problem is quite straightforward, however. (shrink)

We describe a categorial system (PPTS) based on partial proof trees(PPTs) as the building blocks of the system. The PPTs are obtained byunfolding the arguments of the type that would be associated with a lexicalitem in a simple categorial grammar. The PPTs are the basic types in thesystem and a derivation proceeds by combining PPTs together. We describe theconstruction of the finite set of basic PPTs and the operations forcombining them. PPTS can be viewed as a categorial (...) system incorporating someof the key insights of lexicalized tree adjoining grammar, namely the notionof an extended domain of locality and the consequent factoring of recursionfrom the domain of dependencies. PPTS therefore inherits the linguistic andcomputational properties of that system, and so can be viewed as a middleground between a categorial grammar and a phrase structure grammar. We alsodiscuss the relationship between PPTS, natural deduction, and linear logicproof-nets, and argue that natural deduction rather than a proof-net systemis more appropriate for the construction of the PPTs. We also discuss howthe use of PPTs allows us to localize the management of resources, therebyfreeing us from this management as the PPTs are combined. (shrink)

This paper deals with a foundational aspect of Integrated Information Theory of consciousness: the nature of the relation between the axioms of phenomenology and the postulates of cause-effect power. There has been a lack of clarity in the literature regarding this crucial issue, for which IIT has received much criticism of its axiomatic method and basic tenets. The present contribution elucidates the problem by means of a categorial analysis of the theory’s foundations. Its main results are (...) that: IIT has a set of nine fundamental concepts of reason, called categories, which constitute its categorial lexicon and through which it formulates a system of principles incorporating the axioms, the postulates, and the central identity; and the connection between the axioms and postulates is grounded by their common root in this categorial lexicon, the categories of which find their justification by means of a phenomenological and transcendental deduction. Some further results are the unique origin of axioms and postulates in the categories; the distinction between conceptual and formalized postulates; a clarification of the uniqueness problem of categorial lexica in general; and an IIT account of objectivity by explicating how the physical is defined by means of categories. All of this is put to use against various criticism targeting IIT’s theoretical core. If successful, the proposed interpretation illuminates a central issue in the contemporary study of consciousness and contributes to an environment of mutual understanding between defenders and critics of the theory. (shrink)

This article presents a detailed formal approach to concepts and concept combination. Sense generation is a competence‐level theory that attempts to respect constraints from the various cognitive sciences, and postulates “quasi‐classical” conceptual structures where attributes receive only one value (but are defeasible and so do not represent necessary and sufficient conditions on category membership) and where classification is binary (but explicitly context‐sensitive). It is also argued that any general theory of concepts must account for “privative” combinations (e.g., (...) stone lion, fake gun, apparent friend) as extreme test‐cases of representational and classificatory flexibility. The approach presented therefore provides a treatment of these combinations. The approach differentiates between the “lexical concept” (the stable information represented in a mental lexicon) which acts as a base from which the various “senses” (flexible contents associated with words and phrases in context, and used in classification) are “generated.” Generation allows nonmonotonicity, so that in different circumstances, different attributes may be defeated or modified. Classification is treated as relative to the perspective adopted, so that a classification acceptable from one perspective may be unacceptable from another, without contradiction. The result is a view that assumes bottom‐up priority in concept combination, where the range of senses generated by bottom‐up rules of combination is tempered by pragmatic‐communicative constraints on classification. An account of the representational and classification behavior of privative combinations is outlined, and the article concludes with a discussion of some of the implications of the approach. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:Repetition in Latin Poetry: Figures of AllusionMichael C. J. PutnamJeffrey Wills. Repetition in Latin Poetry: Figures of Allusion. Oxford: Clarendon Press, 1996. xvi 1 506 pp. Cloth, $90.Wills offers the first fully systematic codification of repetition in Latin poetry. The introduction deals with the various means, such as morphological or lexical markings, word order, position and the like, that can help the reader distinguish allusion in an act (...) of repetition, and there follow several detailed examples of practice built on theory. But the main body of the book consists of a “grammar” of repetition.The first major segment is devoted to gemination, the repetition of identical forms within the same sense unit. This in turn is divided between a cataloguing of simple gemination, either in nominal form or of verbs and adverbs, and of expanded gemination, where one of the elements repeated is qualified with further detail. Four chapters are devoted to the next rubric, polyptoton and its elaborations, the repetitions of different forms within a simple clause. Then follow detailed discussions of the same phenomena but located across units, entitled “parallelism” where, as in the case of gemination, the forms are the same; and “modification,” akin to polyptoton in that the forms are different. The book concludes with three more general chapters devoted to a detailed analysis of the positional patterns repetition most regularly takes, of compounds as part of repetition, and to prosody and semantic variations in repetition.Such a bald summary does scant justice not only to the sheer quantity of material Wills gathers—a monumental accomplishment in itself—but also to the learning, intelligence and critical sophistication that characterize the undertaking. At the start Wills lays claim only to illustrating the process whereby allusion is generated through repetition, but throughout the whole enterprise, whether in theoretical discussions or in the practical criticism that emanates from his compendia, the results are equally valuable, for the investigation of individual poems and authors as well as for a deeper understanding of the development of Latin modes of imaginative expression, often as analyzed against their Greek intellectual background. If I were to focus on one single accomplishment beyond the mere careful, discrete amassing of material, it would be the stress not only on diction, that is, on the iteration of words, but on such categories [End Page 295] as form, syntax, and word placement in the creation of allusion through repetition. But the main value of this rich work will be as much in the detailed analyses of countless specific instances as in the manifold possibilities for referencing, and cross-referencing, across the history of classical poetry that now become readily available to its scholars.A good example of Wills’s methodology is his initial illustration (26–28), tracing how Virgil adopts and adapts Catullus’ repetitions of perfide, at the opening of Ariadne’s lament (64.132–33) and later (174), through the central reaches of Aeneid 4, from 305 to 421. But there are a myriad others of which I may single out only a few brief samples: on the connection of Cat. 62.20–24 and Vir. Ecl. 8.47–50 where chiasmus and parallel stanzaic structure reinforce repetition’s allusiveness (p. 181); on the repetition of acies at Aen. 10.360 in what Wills calls “battle polyptoton” (194); on the assumed communality of clashing horses (Aen. 11.614–15) and wrestling humans (Ov. Met. 6.243) that allusion from one text to another brings (199); on the connection between Aen. 3.156 and 10.670–72 and the resulting linkage of Aeneas and Turnus at moments of loss (267); on Virgil’s melding of Homeric syntax with Lucretian diction in the impressive phrase gravis graviterque (Aen. 5.447) (239); on the resulting combination of form as well as diction as Propertius borrows from both Ecl. 7.44 and Ecl. 6.55–58 to describe the cattle of Hercules (4.9.16–19) (101–2).From time to time Wills seems swept along by the fact of repetition to the neglect of counterevidence which would be useful to the reader in weighing the value of an exemplum. A case in point is the... (shrink)

0. Introductory remarks. I assume that every serious theory of language must give some explicit account of the relationship between expressions in the language described and expressions in some interpreted language which spells out the semantics of the language.1 Let's call this relationship the translation relation. Theories differ as to how this relation is specified. In the Aspects theory of syntax, taken together with a Katz-Postal view of "semantic rules", it was assumed that the relation was defined on (...) deep structures. Serious problems led to modifications of this view in several directions. Chomsky's latest papers assume that a modified 'intermediate structure' is transformed by rules of interpretation to a level of representation called 'logical form'. Common to all of these approaches is the assumption that the translation rules are defined initially on syntactic structures of one sort or another. Let us call this assumption the configurational hypothesis: the translation rules all have the form: [183]. (shrink)

Language in Action demonstrates the viability of mathematical research into the foundations of categorial grammar, a topic at the border between logic and linguistics. Since its initial publication it has become the classic work in the foundations of categorial grammar. A new introduction to this paperback edition updates the open research problems and records relevant results through pointers to the literature. Van Benthem presents the categorial processing of syntax and semantics as a central component in a more (...) general dynamic logic of information flow, in tune with computational developments in artificial intelligence and cognitive science. Using the paradigm of categorial grammar, he describes the substructural logics driving the dynamics of natural language syntax and semantics. This is a general type-theoretic approach that lends itself easily to proof-theoretic and semantic studies in tandem with standard logic. The emphasis is on a broad landscape of substructural categorial logics and their proof-theoretical and semantic peculiarities. This provides a systematic theory for natural language understanding, admitting of significant mathematical results. Moreover, the theory makes possible dynamic interpretations that view natural languages as programming formalisms for various cognitive activities. (shrink)

A method is described for inducing a type-logical grammar from a sample of bare sentence trees which are annotated by lambda terms, called term-labelled trees . Any type logic from a permitted class of multimodal logics may be specified for use with the procedure, which induces the lexicon of the grammar including the grammatical categories. A first stage of semantic bootstrapping is performed, which induces a general form lexicon from the sample of term-labelled trees using Fulop’s (J Log Lang Inf (...) 14(1):49–86, 2005) procedure. Next we present a two-stage procedure for performing distributional learning by unifying the lexical types that are initially discovered. The first structural unification algorithm in essence unifies the initial family of sets of types so that the resulting grammar will generate all term-labelled trees that follow the usage patterns evident from the learning sample. Further altering the lexical categories to generate a recursively extended language can be accomplished by a second unification. The combined unification algorithm is shown to yield a new type-logical lexicon that extends the learning sample to a possibly infinite (and possibly context-sensitive) language in a principled fashion. Finally, the complete learning strategy is analyzed from the perspective of algorithmic learning theory; the range of the procedure is shown to be a class of term-labelled tree languages which is finitely learnable from good examples (Lange et al in Algorithmic learning theory, Vol 872 of lecture notes in artificial intelligence, Springer, Berlin, pp 423–437), and so is identifiable in the limit as a corollary. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Thucydides 1.22.1: Content and Form in the SpeechesThomas F. GarrityThe interpretive problem posed by the speeches of Thucydides is one of the oldest chestnuts in classical scholarship. It has long been debated whether the historian claimed and/or attempted to present verbatim accounts of the arguments put forward by the speakers on each occasion as best he could, or whether he felt free to modify or to invent particular (...) arguments or even whole speeches. And the controversy has been fueled by what has been widely regarded as the ambiguity of the second of the two parts of Thucydides’ famous statement of aims and methods in 1.22.1,. I propose here, instead, that the language in which scholars have found confusion is actually a clear statement pertaining both to the content and to the form in which the speeches are presented by Thucydides.THE ASSUMPTION IN SCHOLARSHIPThe perceived ambiguity of 1.22.1 has baffled generations of scholars, as they have attempted to relate their understanding of Thucydides’ statement concerning the presentation of speeches to what they themselves perceive as the historian’s practice throughout the History. In general, the debate has been characterized by a concerted and ongoing attempt to control the grammar, syntax, and vocabulary in 1.22.1 as a necessary ingredient in the construction of interpretive arguments. This uncompromising insistence on a study based on a close examination of Thucydides’ Greek is most evident in the early German scholarship, conducted [End Page 361] primarily from the point of view of the problem of composition.1 In subsequent research, scholars begin to place less emphasis on the significance of the programmatic statement strictly in relation to the problem of composition, but they remain devoted to the idea that a correct understanding of the historian’s aims and methods derives from a precise understanding of the Greek in 1.22.1.2 For all the efforts, however, of such well–known students of Greek, scholars remain sharply divided over the precise meaning of Thucydides’ programmatic statement.Not all participants in the debate, however, have felt this obligation to deduce the precise meaning of the Greek contained in the historian’s programmatic statement. And it is perhaps a measure of despair over finding a solution to the perceived enigma in 1.22.1 that some scholars have found it possible, especially in more recent times, to construct elaborate theories about the historian’s presentation of speeches without providing a detailed analysis of Thucydides’ own statement of aims and methods. The accepted ambiguity of 1.22.1, moreover, has provided such scholars with what they consider to be primary evidence with which they might successfully call into question the “objectivity” of Thucydides as a “scientific historian,” and with which they might thereby persuasively promote the view of him as either an impassioned (outraged) moralist or a tendentious manipulator of his reader’s sympathies.3 [End Page 362]In particular, the traditional view that the dependent participial clause,, is a qualification, or refinement, of the main assertion,,..., is what has led to the assumption that Thucydides is making two separate statements limited to the aspect of the content of the speeches.4 The result of this assumption has been to accept the notion that ambiguity exists in 1.22.1, as no satisfactory analysis has been put forward to explain how Thucydides can at one and the same time be presenting—in terms of content—“what was appropriate” () and “what was really said” (). And some scholars, for whom it is not adequate simply to question the reliability of Thucydides as a historical source, have taken a more extreme step: seizing on the traditional acknowledgment of the difficulties present in 1.22.1, they argue that the dependent participial clause,, is not a qualification at all but rather actually an explicit contradiction of the main assertion,.5 Thucydidean scholarship, then, has presented itself with an ironic result: the inherited assumption in scholarship that both parts of 1.22.1 refer only to the content of the speeches, first developed and seemingly permanently entrenched by early readers of Greek—so many of whom were committed to defending... (shrink)

Bursill-Hall, writing as a linguist, has produced a book of interest and use to all students of philosophy who are intrigued either by medieval or by modern theories of language, or by both. Bursill-Hall’s book is the first full-length presentation of this material in English. After a brief, not to say, desultory, survey of the history of linguistic theory from the Greeks until the appearance of the so-called Modistae, the author discusses the descriptive technique and the terminology of the (...) speculative grammarians. The third chapter, "Metalanguage," offers a valuable analysis of the basic "elements" and "categories" of modistic grammar. One especially striking feature of this chapter is the author’s account of the sequence of operations through which a vox, or meaningless sound, becomes, first, a dictio, or sound capable of signifying, and, then, a pars orationis, a part of speech or word-class, capable of entering into syntactic relations with other partes orationis so as to produce a meaningful and well-formed sentence. The next four chapters form the core of the work. Taking as his primary sources the Belgian Siger of Courtrai, the German Thomas of Erfurt, and the Dane Martin of Dacia, Bursill-Hall expounds in detail the modistic treatments of the essential, specific and accidental features of the declinable and indeclinable word-classes and the modistic theories of syntax. An evaluative conclusion comparing modistic and modern linguistic theory is followed by a series of appendices in which detailed diagrams make visible the definitions and interrelations of the various modes and partes orationis in the texts of Siger, Thomas and Martin. The work includes a useful bibliography, a table of passages cited from medieval authors, an index of examples cited in the main text, an index of names and an index of subjects. The exposition and the apparatus combine to yield a volume of quickly apparent value for both reference and research. This said, and with due regard for the fact that the author is writing as a professional linguist, it must be said that a certain sense of philosophical disappointment cannot be suppressed. Looked at linguistically, speculative grammar is an attempt to inventory and describe those features of word-classes in virtue of which an element of language is potentially expressive of meaning and capable of entering into syntactic relations with other significant elements. Looked at philosophically, speculative grammar is a theory of the intelligibility of linguistic expressions—cp. Thomas of Erfurt, #225: the end served by a complete expression is "to express a composite mental concept and to generate a perfect understanding in the mind of the hearer." Intelligibility is seen in this theory as the product of the concurrence or interpenetration of the ontological constitution of extramental realities, the apprehensive powers of the intellect and the manners of signifying conferred by the intellect on the linguistic medium in accordance with its appreciation of extramental reality. The author is certainly aware of the philosophical matrix of the grammatical theories he rehearses. At the same time, he seems to give these underlying philosophical considerations rather short shrift. To say, as he does, that the Modistae "seem to have been unaware of... the fact that their theories were in fact a projection into reality of the basic patterns of the language in which they were expressed," is surely not to do justice to the complex ontological, epistemological and semantic issues informing their work. Similarly, a statement that comparison between modistic and modern theories faces the difficulty that "the medieval vision of man in his environment and the metaphysical theories of the world are entirely different from those of today" is, at best, uninformative and, at worst, a piece of vaporous historicism. At other times, it is not entirely clear what interpretation the author is recommending. This is especially true of his remarks about the inactive character of the modus intelligendi. While the Modistae were, after all, doing grammar and not epistemology or, should one say, rational psychology, still, their grammatical theory rests on their insistence that the forms of language are linked appropriately to the forms of being and it is the modus intelligendi activus that is responsible both for the possibility and the success of this linkage. This volume is well-produced and almost completely free of misprints. However, the obnoxiously high price asked by the publisher is not justified either by the quality of production or by the inclusion of numerous Latin citations; it only serves, I fear, as a barrier to the wide circulation the book deserves.—D. L. (shrink)

In today's philosophy of science, scientific theories are construed as abstract mathematical objects: formal axiomatic systems or classes of set-theoretic models. By focusing exclusively on the logico-mathematical structure of theories, however, this approach ignores their essentially cognitive nature: that theories are conceptualizations of the world produced by some cognitive agents. As a result, traditional philosophical analyses of scientific theories are incapable of coherently accounting for the relevant relations between highly abstract and idealized models in science and concrete empirical phenomena (...) in the world. ;As a more accurate and comprehensive alternative to traditional analyses of scientific theorizing, the dissertation proposes and develops a conception of scientific theories which makes explicit the essential role of cognitive agents--theorizers--in generating abstract scientific models and systematically relating such models to experimentally controlled parts of the world. ;Specifically, by utilizing the conceptually powerful formal framework of the Theory of Categories, the new approach clarifies and makes formally precise the cognitive status of several important aspects of scientific theorizing, including the notion of a scientific model as theorizers' mathematical conceptualization of the world jointly determined by theorizers' physical interactions with the world and their cognitive access to mathematical objects, the distinction between models in science and models in pure mathematics, the distinction between provisional and successful scientific models, the notion of a systematic correspondence between successful scientific models and the world which does not impose upon the world the mathematical structure of scientific models, and the way in which theorizers' modeling strategy determines the general structure of scientific knowledge. (shrink)

This note is based on a lecture delivered at the Conference on the Scien- tic Research of the Mathematical Center of Opole, Turawa, May 10-11th, 1980. A somewhat extended version will be published in the Proceedings of the Conference. At the same time it is an abstract of a part of a planned larger paper, which will involve the theory of label-tokens. The theory is included into the author's monograph in Polish "Teorie Językow Syntaktycznie Kategorialnych", PWN, Warszawa-Wrocław 1985 (...) and into its English version: Theory of Language Syntax. Categorial Approach, Kluwer Academic Publishers, Boston-London-Dordrecht 1991. (shrink)

One well known problem regarding quantifiers, in particular the 1storder quantifiers, is connected with their syntactic categories and denotations. The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for categorial (...) languages generated by the Ajdukiewicz’s classical categorial grammar. The 1st-order quantifiers are typically ambiguous. Every 1st-order quantifier of the type k > 0 is treated as a two-argument functorfunction defined on the variable standing at this quantifier and its scope (the sentential function with exactly k free variables, including the variable bound by this quantifier); a binary function defined on denotations of its two arguments is its denotation. Denotations of sentential functions, and hence also quantifiers, are defined separately in Fregean and in situational semantics. They belong to the ontological categories that correspond to the syntactic categories of these sentential functions and the considered quantifiers. The main result of the paper is a solution of the problem of categories of the 1st-order quantifiers based on the principle of categorial compatibility. (shrink)

The variety $\mathbb{DHMSH}$ of dually hemimorphic semi-Heyting algebras was introduced in 2011 by the second author as an expansion of semi-Heyting algebras by a dual hemimorphism. In this paper, we focus on the variety $\mathbb{DHMSH}$ from a logical point of view. The paper presents an extensive investigation of the logic corresponding to the variety of dually hemimorphic semi-Heyting algebras and of its axiomatic extensions, along with an equally extensive universal algebraic study of their corresponding algebraic semantics. Firstly, we present (...) a Hilbert-style axiomatization of a new logic called "Dually hemimorphic semi-Heyting logic" ($\mathcal{DHMSH}$, for short), as an expansion of semi-intuitionistic logic $\mathcal{SI}$ (also called $\mathcal{SH}$) introduced by the first author by adding a weak negation (to be interpreted as a dual hemimorphism). We then prove that it is implicative in the sense of Rasiowa and that it is complete with respect to the variety $\mathbb{DHMSH}$. It is deduced that the logic $\mathcal{DHMSH}$ is algebraizable in the sense of Blok and Pigozzi, with the variety $\mathbb{DHMSH}$ as its equivalent algebraic semantics and that the lattice of axiomatic extensions of $\mathcal{DHMSH}$ is dually isomorphic to the lattice of subvarieties of $\mathbb{DHMSH}$. A new axiomatization for Moisil's logic is also obtained. Secondly, we characterize the axiomatic extensions of $\mathcal{DHMSH}$ in which the "Deduction Theorem" holds. Thirdly, we present several new logics, extending the logic $\mathcal{DHMSH}$, corresponding to several important subvarieties of the variety $\mathbb{DHMSH}$. These include logics corresponding to the varieties generated by two-element, three-element and some four-element dually quasi-De Morgan semi-Heyting algebras, as well as a new axiomatization for the 3-valued Łukasiewicz logic. Surprisingly, many of these logics turn out to be connexive logics, only a few of which are presented in this paper. Fourthly, we present axiomatizations for two infinite sequences of logics namely, De Morgan Gödel logics and dually pseudocomplemented Gödel logics. Fifthly, axiomatizations are also provided for logics corresponding to many subvarieties of regular dually quasi-De Morgan Stone semi-Heyting algebras, of regular De Morgan semi-Heyting algebras of level 1, and of JI-distributive semi-Heyting algebras of level 1. We conclude the paper with some open problems. Most of the logics considered in this paper are discriminator logics in the sense that they correspond to discriminator varieties. Some of them, just like the classical logic, are even primal in the sense that their corresponding varieties are generated by primal algebras. (shrink)

By formalizing recent syntactic theories for natural languages Stabler shows how their complexity can be handled without guesswork or oversimplification. By formalizing recent syntactic theories for natural languages in the tradition of Chomsky's Barriers, Stabler shows how their complexity can be handled without guesswork or oversimplification. He introduces logical representations of these theories together with special deductive techniques for exploring their consequences that will provide linguists with a valuable tool for deriving and testing theoretical predictions and for experimenting with (...) alternative formulations of grammatical principles. Stabler's novel approach allows results to be deduced with straightforward calculations and provides a systematic framework for tackling the problem of how speakers can infer the properties of an utterance from principles of the grammar. The special treatment of equality, induction principles, and inclusion of a general method for collecting structures from proofs means that sophisticated linguistic arguments can be carried out in detail, giving a rich perspective to issues in linguistic theory and parsing. (shrink)

Among the main concerns of 20th century philosophy was that of the foundations of mathematics. But usually not recognized is the relevance of the choice of a foundational approach to the other main problems of 20th century philosophy, i.e., the logical structure of language, the nature of scientific theories, and the architecture of the mind. The tools used to deal with the difficulties inherent in such problems have largely relied on set theory and its “received view”. There are specific (...) issues, in philosophy of language, epistemology and philosophy of mind, where this dependence turns out to be misleading. The same issues suggest the gain in understanding coming from category theory, which is, therefore, more than just the source of a “non-standard” approach to the foundations of mathematics. But, even so conceived, it is the very notion of what a foundation has to be that is called into question. The philosophical meaning of mathematics is no longer confined to which first principles are assumed and which “ontological” interpretation is given to them in terms of some possibly updated version of logicism, formalism or intuitionism. What is central to any foundational project proper is the role of universal constructions that serve to unify the different branches of mathematics, as already made clear in 1969 by Lawvere. Such universal constructions are best expressed by means of adjoint functors and representability up to isomorphism. In this lies the relevance of a category-theoretic perspective, which leads to wide-ranging consequences. One such is the presence of functorial constraints on the syntax–semantics relationships; another is an intrinsic view of (constructive) logic, as arises in topoi and, subsequently, in more general fibrations. But as soon as theories and their models are described accordingly, a new look at the main problems of 20th century’s philosophy becomes possible. The lack of any satisfactory solution to these problems in a purely logical and set-theoretic setting is the result of too circumscribed an approach, such as a static and punctiform view of objects and their elements, and a misconception of geometry and its historical changes before, during, and after the foundational “crisis”, as if algebraic geometry and synthetic differential geometry – not to mention algebraic topology – were secondary sources for what concerns foundational issues. The objectivity of basic geometrical intuitions also acts against the recent version of structuralism proposed as ‘the’ philosophy of category theory. On the other hand, the need for a consistent and adequate conceptual framework in facing the difficulties met by pre-categorical theories of language and scientific knowledge not only provides the basic concepts of category theory with specific applications but also suggests further directions for their development (e.g., in approaching the foundations of physics or the mathematical models in the cognitive sciences). This ‘virtuous’ circle is by now largely admitted in theoretical computer science; the time is ripe to realise that the same holds for classical topics of philosophy. (shrink)

This paper sketches or signals some ideas, results, and proposals connected with the theoretical issues related to the categorial approach to language which originated from the first author and which form the basis for further research by the second author. The main aims are the following: 1) to bring into common use some Polish ideas concerned with classical categorial grammar; 2) to take into consideration a universal and simultaneously formal-logical perspective; 3) to consider Peirce's well-known differentiation of (...) linguistic objects, i.e. their twofold ontological status as tokens and types and, according to this, to consider the biaspectual formalization of language dealing with the two main orientations in the controversy between nominalism and Platonism; 4) to characterize language according to Frege's ontological canons, according to which each expression of language corresponds to its denotation. All of these factors make possible not only the syntactic characterization of language but also the introduction of syntactic and semantic definitions of a true expression and its denotation. These notions correspond here to the old classical, but not necessarily standard, understanding of semantic concepts. The paper is divided into four sections: the first contains a brief characterization of the categorial approach to syntax; the second presents two strains of this approach; the third touches on certain general semantic issues connected with the notion of truth; and the last gives some final remarks. (shrink)

According to Cantor (Mathematische Annalen 21:545–586, 1883 ; Cantor’s letter to Dedekind, 1899 ) a set is any multitude which can be thought of as one (“jedes Viele, welches sich als Eines denken läßt”) without contradiction—a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root—lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do (...) exist. However we do not understand this logical truth so well as we understand, for example, the logical truth $${\forall x \, x = x}$$ . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29–53, 1906 ) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued $${\in}$$ -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory—the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse–Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse–Kelley set theory. (shrink)

Whether pattern-parsing mechanisms are specific to language or apply across multiple cognitive domains remains unresolved. Formal language theory provides a mathematical framework for classifying pattern-generating rule sets (or “grammars”) according to complexity. This framework applies to patterns at any level of complexity, stretching from simple sequences, to highly complex tree-like or net-like structures, to any Turing-computable set of strings. Here, we explored human pattern-processing capabilities in the visual domain by generating abstract visual sequences made up of abstract tiles differing (...) in form and color. We constructed different sets of sequences, using artificial “grammars” (rule sets) at three key complexity levels. Because human linguistic syntax is classed as “mildly context-sensitive,” we specifically included a visual grammar at this complexity level. Acquisition of these three grammars was tested in an artificial grammar-learning paradigm: after exposure to a set of well-formed strings, participants were asked to discriminate novel grammatical patterns from non-grammatical patterns. Participants successfully acquired all three grammars after only minutes of exposure, correctly generalizing to novel stimuli and to novel stimulus lengths. A Bayesian analysis excluded multiple alternative hypotheses and shows that the success in rule acquisition applies both at the group level and for most participants analyzed individually. These experimental results demonstrate rapid pattern learning for abstract visual patterns, extending to the mildly context-sensitive level characterizing language. We suggest that a formal equivalence of processing at the mildly context sensitive level in the visual and linguistic domains implies that cognitive mechanisms with the computational power to process linguistic syntax are not specific to the domain of language, but extend to abstract visual patterns with no meaning. (shrink)

The aim of this study is to discuss in what sense one can speak about universal character of logic. The authors argue that the role of logic stands mainly in the generality of its language and its unrestricted applications to any field of knowledge and normal human life. The authors try to precise that universality of logic tends in: (a) general character of inference rules and the possibility of using those rules as a tool of justification of theorems of every (...) science, (b) principles of correct formulating of thoughts and using language, and (c) general deductive method of reasoning, i.e in the study of language syntax and semantics. The authors present two theories of language syntax and semantics as exemplifications based on the Tarski’s famous results in metalogic: (1) a formalization of universal syntax system by Andrzej Grzegorczyk based on a new primitive notion of quotation-marks operator, and (2) an enlarged system of axiomatic theory of syntax of any categorial language of Urszula Wybraniec-Skardowska’s in which the main role plays the relation of concatenation understood as a set-theoretical function. The study concludes in arguing that the importance of the result (2) lies not only in solving some philosophical problems but also in different fields of knowledge and spheres of human life as ex. in discussion and education as well. (shrink)

It is the aim of INDICES to document recent explorations in the various fields of philosophical logic and formal linguistics and their applications in other disciplines. The main emphasis of this series is on self-contained monographs covering particular areas of recent research and surveys of methods, problems, and results in all fields of inquiry where recourse to logical analysis and logical methods has been fruitful. INDICES will contain monographs dealing with the central areas of philosophical logic (extensional and intensional systems, (...) indexical logics, non-classical logics, philosophy of logic, etc.) as well as studies in which these systems are applied to specific issues in philosophy, in the formal semantics of natural languages, the foundations of linguistic theory, in computational linguistics, and in theoretical computer science. Constructive type theory was first presented in 1970, by the Swedish logician Per Martin-Lof. It has become one of the main approaches used in the foundations of mathematics and computer science. But it has remained relatively unknown among linguists and philosophers, although it provides a considerable extension of the concepts and techniques of logic. The book first gives an introduction to type theory from the point of view of linguistics and the philosophy of language. Type theory is then applied in the areas of quantification, anaphora, temporal reference, and the structure of text and discourse. By virtue of the type-theoretical concepts of proof object and context, various phenomena of dependence and progression in language can be discussed in precise terms, and several well-known problems can be solved. A categorial grammar is presented togenerate formally a fragment of English, together with an example of a computer implementation. (shrink)

This chapter focuses on the frameworks of Head‐Driven Phrase Structure Grammar (HPSG) as it developed from Generalized Phrase Structure Grammar (GPSG), and Lexical‐Functional Grammar (LFG). Declarative frameworks are not generative, as they do not ‘generate’ anything in the sense of the preceding paragraph. Pullum refers to that kind of approach as Generative‐Enumerative Syntax and differentiates it from Model‐Theoretic Syntax: GPSG, HPSG, and LFG essentially fall in the latter category. It describes some key aspects of declarative frameworks, and the motivation for (...) them. The chapter considers how declarative frameworks instantiate a view of Generative Grammar directly inspired by Noam Chomsky's early work, but without the procedural component. It presents some of the core design features which motivate declarative frameworks, and explores how syntactic phenomena are factorized and formalized in declarative frameworks, with a view to comparison with Minimalist Program analyses. (shrink)

Categorial grammar is well-known for its elegant analysis of coordination enabled by the flexible notion of constituency it entertains. However, to date, no systematic study exists that examines whether this analysis has any obvious empirical advantage over alternative analyses of nonconstituent coordination available in phrase structure-based theories of syntax. This paper attempts precisely such a comparison. We compare the direct constituent coordination analysis of non-canonical coordinations in categorial grammar with an ellipsis-based analysis of the same phenomena in the (...) recent HPSG literature. We provide a set of empirical evidence, consisting of cases in which non-canonical coordinations interact with scopal operators of various sorts, which systematically falsifies the predictions of the latter, ‘linearization-based’ ellipsis approach to coordination. We propose an alternative analysis in a variant of categorial grammar called Hybrid Type-Logical Categorial Grammar. The proposed framework builds on both the Lambek-inspired variants of categorial grammar and a more recent line of work modelling word order via a lambda calculus for the prosodic component. The flexible syntax–semantics interface of this framework straightforwardly captures the interactions between non-canonical coordinations and scopal expressions, demonstrating the broader empirical payoff of the direct constituent coordination analysis of non-canonical coordinations pioneered by Steedman :523–568, 1985; Linguist Philos 13:207–263, 1990) and Dowty hitherto not explicitly recognized in the literature. (shrink)

The theory of language must predict the possible thought—signal (or meaning—sound or sign) pairings of a language. We argue for a Meaning First architecture of language where a thought structure is generated first. The thought structure is then realized using language to communicate the thought, to memorize it, or perhaps with another purpose. Our view contrasts with the T-model architecture of mainstream generative grammar, according to which distinct phrase-structural representations—Phonetic Form (PF) for articulation, Logical Form (LF) for interpretation—are (...) generated within the grammar. At the same time, our view differs from early transformational grammar and generative semantics: We view the relationship between the thought structure and the corresponding signal as one of compression. We specify a formal sketch of compression as a choice between multiple possible pronounciations balancing the desire to transmit information against the effort of pronounciation. The Meaning First architecture allows a greater degree of independence between thought structures and the linguistic signal. We present three arguments favoring this type of independence. First we argue that scopal properties can be better explained if we only compare thought structures independent of the their realization as a sentence. Secondly, we argue that Meaning First architecture allows contentful late insertion, an idea that has been argued for in Distributed Morphology already, but as we argue is also motivated by the division of the logical and socio-emotive meaning content of language. Finally, we show that only the Meaning First architecture provides a satisfying account of the mixing of multiple languages by multilingual speakers, especially for cases of simultaneous articulation across two modalities in bimodal speakers. Our view of the structure of grammar leads to a reassessment of priorities in linguistic analyses: while current mainstream work is often focused on establishing one-to-one relationships between concepts and morphemes, our view makes it plausible that primitive concepts are frequently marked indirectly or unpronounced entirely. Our view therefore assigns great value to the understanding of logical primitives and of compression. (shrink)

Peirce's Law of Triviality: The Implementation of the Trivium of Logic, Rhetoric and Grammar. Basic Categories for Linguistics and Literature Studies from a Universal Semiotic Theory This article focuses on the aspects that refer to linguistics in the works of Charles S. Peirce. His pragmatic philosophy implemented many other sciences and among them is the traditional trivium of logic, grammar, and rhetoric, which Peirce divided into different kinds of logic, grammar, and rhetoric. While the impact of the work of (...) Peirce on theses sciences is weak, the integration of the sciences in his philosophy is interesting as a step in the history of science and his work is an example for ecclecticism and historism of science in the 19th century and the universalism of science deducted from a philosophy that uses the sign as an unitarian principle. Triple constructions are a very common feature in the writings of Peirce, and the trivium is an example of an academic construction Peirce implemented. (shrink)

The article devoted to the study of elaborate correlation between language and ideology, language and culture. The author dwells on the shift in the key concept of social and humanitarian studies from a classical standard and language description to the flexibility in the language use and functioning. It is necessary to point out though that despite some similarities in correlation between language and culture on the one side and language and ideology on the other side, there are some differences (...) in the pragmatic perspectives between these categories. The discourse that has been formed under the ideological influence tends to be formal and ritualized to a greater extent than those language structures that have been developed due to culturally consistent processes i.e. connection and transmission between the generations. The author also makes an attempt to apply the paradox of globalization by A. Giddens to social linguistics. The runaway world theory introduced by a British sociologist A. Giddens singles out that the globalizing world does not become predictable as globalization predominates, but, on the contrary, social and linguistic processes become less and less manageable. The understanding of language and society becomes more complicated and demands new doctrines and innovative concepts, such as post-non-classical paradigm might conjure in. The author also takes into account the causes making standard language too flexible and changeable. The main cause of this process is an intent conditioned by certain communicative situation or by certain reasons to alter illocution of the utterances for representing identity, resulting in turn to more prestigious or more sophisticated language. (shrink)

The paper suggests that the birth of an artwork as an open dynamic system can be described through the axiomatics of the theory of metabolic time. Alexander Levich’s theory of metabolic time and Nikolai Kozyrev’s theory of generated time flows, describing universal laws of the birth of the new, allow for the rethinking of the main categories of literature and aesthetics. The paper takes the rhythmic fractal as a natural referential unit of time in literature, as (...) well as the analogue of the generating fluent in arts. The first part of the paper introduces Chekhov’s “depth poetics” through a body of research, addressing the problems of artistic creativity and the genesis of an artistic work as a new integral space–time unit. The second part of the paper brings “depth poetics” into a larger theoretical context: the theory of artistic creativity by Gej and the theory of metabolic time by Alexander Levich. The final part of the paper, “Rhythmic fractals,” draws the conclusion concerning the perspective of studying the wave nature of “generating fluent.” Using Chekhov’s play The Cherry Orchard as an illustrative example, the rhythmic fractal—“the sound of a burst string”—is considered. In Kozyrev’s formulation, it is the “compression of the flow.” The rhythmic source itself is beyond the limits of the play and can only be found through an in-depth analysis of the neo-mythological structure of the Hamlet–Macbeth code. (shrink)

Semantic justifications of the classical rules of logical inference typically make use of a notion of bivalent truth, understood as a property guaranteed to attach to a sentence or its negation regardless of the prospects for speakers to determine it as so doing. For want of a convincing alternative account of classical logic, some philosophers suspicious of such recognition-transcending bivalence have seen no choice but to declare classical deduction unwarranted and settle for a weaker system; intuitionistic logic (...) in particular, buttressed by assertion-conditional semantics, is often considered to enjoy a degree of meaning-theoretical respectability unattainable by classical logic.The decision to forgo the classical inference rules is not always made lightly. Thus, Dummett: " In the resolution of the conflict between [the view that generally accepted classical modes of inference ought to be theoretically accommodated, and the demand that any such accommodation be achieved without recourse to bivalence] lies, as I see it, one of the most fundamental and intractable problems in the theory of meaning; indeed, in all philosophy. "The present article ventures to suggest that the conflict need not be irresoluble. Helping ourselves only to such conceptual resources as are standardly invoked by proponents of intuitionistic logic, we shall formulate a rudimentary meaning theory for a selection of logical constants, define a relation of valid inferability, and prove that the latter includes all of classical first-order logic. The result is essentially that reported in Sandqvist as Theorem 2.20.2. TheoryWe will be considering a standard-syntax first-order language with ⊃, ⊥ and ∀ as its only primitive logical constants. We assume countable supplies of individual constants, individual functors , and predicates , as well as a denumerably infinite set of individual variables. By a basic 1 formula we will mean one that …[Full Text of this Article]. (shrink)