CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. This is Part 3 of a five-part introduction. The focus here is on explaining the semantic model for CAT4. Points in CAT4 graphs represent facts. We introduce all the formal (data) elements used in the classic semantic model: sense or intension (1st and 2nd joins), reference (3rd join), functions (4th join), (...) time and truth (logical fields), and symbolic content (name/value fields). Concepts are introduced through examples alternating with theoretical discussion. Some concepts are assumed from Part 1 and 2, but key ideas are re-introduced. The purpose is to explain the CAT4 interpretation, and why the data structure and CAT4 axioms have been chosen: to make the semantic model consistent and complete. We start with methods to translate information from database tables into graph DBs and into CAT4. We conclude with a method for translating natural language into CAT4. We conclude with a comparison of the system with an advanced semantic logic, the hyper-intensional logic TIL, which also aims to translate NL into a logical calculus. The CAT4 Natural Language Translator is discussed in further detail in Part 4, when we introduce functions more formally. Part 5 discusses software design considerations. (shrink)

Introduction to alternative ontology of mind and physics based on the multi-dimensional model of A Geometric Theory of the Universe (Holster).

n various publications over the past years, Floridi has developed a theory of semantic information as well-formed, meaningful, and truthful data. This theory is more or less orthogonal to the standard entropy-based notions of information known from physics, information theory, and computer science that all define the amount of information in a certain system as a scalar value without any direct semantic implication. In this context the question rises what the exact relation between these various conceptions of information is and (...) whether there is a real need to enrich these mathematically more or less rigid definitions with a less formal notion of semantic information. I investigate various philosophical aspects of the more formal definitions of information in the light of Floridi’s theory. The position I defend is that the formal treatment of the notion of information as a general theory of entropy is one of the fundamental achievements of modern science that in itself is a rich source for new philosophical reflection. This makes information theory a competitor of classical epistemology rather than a servant. In this light Floridi’s philosophy of information is more a reprise of classical epistemology that only pays lip service to information theory but fails to address the important central questions of philosophy of information. Specifically, I will defend the view that notions that are associated with truth, knowledge, and meaning all can adequately be reconstructed in the context of modern information theory and that consequently there is no need to introduce a concept of semantic information. (shrink)

This paper explores the nature of curiosity from an epistemological point of view. First it motivates this exploration by explaining why epistemologists do and should care about what curiosity is. Then it surveys the relevant literature and develops a particular approach.

The philosophy of information (PI) is a new area of research with its own field of investigation and methodology. This article, based on the Herbert A. Simon Lecture of Computing and Philosophy I gave at Carnegie Mellon University in 2001, analyses the eighteen principal open problems in PI. Section 1 introduces the analysis by outlining Herbert Simon's approach to PI. Section 2 discusses some methodological considerations about what counts as a good philosophical problem. The discussion centers on Hilbert's famous analysis (...) of the central problems in mathematics. The rest of the article is devoted to the eighteen problems. These are organized into five sections: problems in the analysis of the concept of information, in semantics, in the study of intelligence, in the relation between information and nature, and in the investigation of values. (shrink)

This article surveys the state of the art in the field of semantic universals. We examine potential semantic universals in three areas: (i) the lexicon, (ii) semantic “glue” (functional morphemes and composition principles), and (iii) pragmatics. At the level of the lexicon, we find remarkably few convincing semantic universals. At the level of functional morphemes and composition principles, we discuss a number of promising constraints, most of which require further empirical testing and/or refinement. In the realm of pragmatics, we predict (...) that Gricean mechanisms are universal, but suggest that the precise nature of presuppositions may be subject to cross-linguistic variation. Finally, we follow E.L. Keenan in concluding that the overarching universal of effability or translatability between languages cannot be upheld in its strongest form. A recurring theme throughout this survey is how much work still remains to be done in the relatively young field of cross-linguistic formal semantics. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. It is based on a special type of relation called CAT4, which is interpreted to provide a semantic representation. This is Part 1 of a five-part introduction. The focus here is on defining the key mathematical structures first, and presenting the semantic-database application in subsequent Parts. We focus in Part 1 (...) on general axioms for the structures, and introduce key concepts. Part 2 analyses the CAT2 sub-relation of CAT4 in more detail. The interpretation of fact networks is introduced in Part 3, where we turn to interpreting semantics. We start with examples of relational and graph databases, with methods to translate them into CAT3 networks, with the aim of retaining the meaning of information. The full application to semantic theory comes in Part 4, where we introduce general functions, including the language interpretation or linguistic functions. The representation of linear symbolic languages, including natural languages and formal symbolic languages, is a function that CAT4 is uniquely suited to. In Part 5, we turn to software design considerations, to show how files, indexes, functions and screens can be defined to implement a CAT4 system efficiently. (shrink)

This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input called feature-tagged examples. A learning algorithm based on the parsing strategy presented in the first part is given. Its validity (...) is proved and its properties are examplified. (shrink)

We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars. The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (preordered) bilinear algebras and pregroups whose universe is an arbitrary monoid.

In various publications over the past years, Floridi has developed a theory of semantic information as well-formed, meaningful, and truthful data. This theory is more or less orthogonal to the standard entropy-based notions of information known from physics, information theory, and computer science that all define the amount of information in a certain system as a scalar value without any direct semantic implication. In this context the question rises what the exact relation between these various conceptions of information is and (...) whether there is a real need to enrich these mathematically more or less rigid definitions with a less formal notion of semantic information. I investigate various philosophical aspects of the more formal definitions of information in the light of Floridi’s theory. The position I defend is that the formal treatment of the notion of information as a general theory of entropy is one of the fundamental achievements of modern science that in itself is a rich source for new philosophical reflection. This makes information theory a competitor of classical epistemology rather than a servant. In this light Floridi’s philosophy of information is more a reprise of classical epistemology that only pays lip service to information theory but fails to address the important central questions of philosophy of information. Specifically, I will defend the view that notions that are associated with truth, knowledge, and meaning all can adequately be reconstructed in the context of modern information theory and that consequently there is no need to introduce a concept of semantic information. (shrink)

Charles S. Peirce’s pragmatist theory of logic teaches us to take the context of utterances as an indispensable logical notion without which there is no meaning. This is not a spat against compositionality per se , since it is possible to posit extra arguments to the meaning function that composes complex meaning. However, that method would be inappropriate for a realistic notion of the meaning of assertions. To accomplish a realistic notion of meaning (as opposed e.g. to algebraic meaning), Sperber (...) and Wilson’s Relevance Theory (RT) may be applied in the spirit of Peirce’s Pragmatic Maxim (PM): the weighing of information depends on (i) the practical consequences of accommodating the chosen piece of information introduced in communication, and (ii) what will ensue in actually using that piece in further cycles of discourse. Peirce’s unpublished papers suggest a relevance-like approach to meaning. Contextual features influenced his logic of Existential Graphs (EG). Arguments are presented pro and con the view in which EGs endorse non-compositionality of meaning. (shrink)

Semantics in the Montagovian tradition combines two basic tenets. One tenet is that the semantic value of a sentence is an intension, a function from points of evaluations into truth-values. The other tenet is that the semantic value of a composite expression is the result of applying the function denoted by one component to arguments denoted by the other components. Many philosophers object to intensional semantics on the grounds that intensionally equivalent sentences do not substitute salva veritate into attitude ascriptions. (...) They propose instead that the semantic values of sentences must be structured propositions. In rejecting intensional semantics, philosophers who endorse structured propositions also usually reject functional compositionality, undermining both tenets of the Montagovian programme. I defend a semantic theory that incorporates both structured propositions and functional compositionality. I argue that this semantic theory can preserve many explanatory benefits of Montague semantics. Finally, I show how treating composition functional application can resolve core problems internal to a theory of structured propositions. (shrink)

Logically, weighting is transitive, but similarity is not, so clustering cannot be either. Entailments must help a child to review attribute lists more efficiently. Children's understanding of exceptions to generic claims precedes their ability to articulate explanations. So agency, as enabling constraint, may show coherent covariation with attributes, as mere extensional, observable effect of intensional entailments.

In this paper, I defend the thesis that alleffects of extra-linguistic context on thetruth-conditions of an assertion are traceable toelements in the actual syntactic structure of thesentence uttered. In the first section, I develop thethesis in detail, and discuss its implications for therelation between semantics and pragmatics. The nexttwo sections are devoted to apparent counterexamples.In the second section, I argue that there are noconvincing examples of true non-sentential assertions.In the third section, I argue that there are noconvincing examples of what (...) John Perry has called`unarticulated constituents''. I conclude by drawingsome consequences of my arguments for appeals tocontext-dependence in the resolution of problems inepistemology and philosophical logic. (shrink)

Proponents of deflationism about meaning often claim that the principle of compositionality, when properly understood, places no constraint whatsoever on the nature of lexical meaning. This deflationary thesis admits of both strong and weak readings. On the strong reading, the principle does not rule out any theory of lexical meaning either alone or in conjunction with other independently plausible semantic assumptions. On the weak reading, the principle alone does not rule out any such theory. I argue that, though weak deflationism (...) about compositionality has better initial prospects than strong, neither version of the thesis is credible. In particular, weak deflationism cannot be maintained in conformity with the deflationist commitment to explaining facts about phrase meanings in compositional terms, that is, by appeal to facts about the lexicon. (shrink)

Geach’s rich paper ‘A Program for Syntax’ introduced many ideas into the arena of categorial grammar, not all of which have been given the attention they warrant in the thirty years since its first publication. Rather surprisingly, one of our findings (Section 3 below) is that the paper not only does not contain a statement of what has widely come to be known as “Geach’s Rule”, but in fact presents considerations which are inimical to the adoption of the rule in (...) question. With regard to at least some amongst the numerous other points extracted here from Geach’s discussion, we shall not be able to reach so definitive a conclusion, and content ourselves with giving the issues an airing. (shrink)

This essay attempts to give substance to the claim that the liar''sparadox shows the truth predicate to be context sensitive. The aim ismodest: to provide an account of the truth predicate''s contextsensitivity (1) that derives from a more general understanding ofcontext sensitivity, (2) that does not depend upon a hierarchy ofpredicates and (3) that is able to address the liar''s paradox. Theconsequences of achieving this goal are not modest, though. Perhapssurprisingly, for reasons that will be discussed in the last section (...) ofthis essay, a natural account of the truth predicate''s contextsensitivity appears to lead naturally to a version of the correspondencetheory of truth according to which the truth predicate can be understoodas a relation holding between a sentence and a salient set of contexts.The plan of this essay is as follows. Section 1 contains a generalaccount of context sensitivity. The purpose of this section is toisolate certain features of context sensitivity and formal methods oftreating them, which we will then apply to the truth predicate. Section 2then outlines two minimal conditions to be satisfied by a truthpredicate. In Section 3, I present a version of the liar paradoxthat results from these conditions and the assumption that the truthpredicate is not context sensitive in the sense described in sectionone. Finally, in section four, I provide what appear to be naturalconsequences of a truth predicate''s context sensitivity. Section 4 isadmittedly speculative and points in the direction for future research. (shrink)

In this paper we will discuss the first order multiplicative intuitionistic fragment of linear logic, MILL1, and its applications to linguistics. We give an embedding translation from formulas in the Lambek Calculus to formulas in MILL1 and show this translation is sound and complete. We then exploit the extra power of the first order fragment to give an account of a number of linguistic phenomena which have no satisfactory treatment in the Lambek Calculus.