Semantic Singularities

Doğal dillerde sözlüksel muğlaklığın iki türü bulunmaktadır. Birincisi, farklı anlamların birbirleriyle ilişkili olmadığı eşadlılık durumu, ikincisi ise farklı anlamların ilişkili olduğu çok anlamlılık durumudur. Kelimelerin farklı anlamları arasındaki ilişkiler anlam kavramına nasıl yaklaşmamız gerektiği konusunda belirleyici bir rol oynamaktadır. Doğal dillerdeki çok anlamlılık olgusu biçimsel ve bilişsel anlambilim geleneklerinin arasındaki karşıtlıkta önemli bir rol oynamaktadır. Biçimsel anlambilim, mantık ve bilgisayar biliminin de yardımıyla, anlamı öznel deneyimlerden olabildiğince ayırarak modellerken, bilişsel anlambilim ise dilsel anlamın deneyimlerimizle bir bütün oluşturduğunu iddia etmektedir. Bilişsel anlambilim dilsel ifadeleri anlamlandırma sürecinin arkasındaki mekanizmayı, diğer bir ifadeyle, yaşam formunun dilsel anlama katkısını ortaya çıkarmayı hedeflemektedir. Dilsel anlam, biçimsel bir şekilde, deneyimlerimizden, kavramsal derinliklerimizden, bilişsel süreçlerimizin bütününden bağımsız olarak incelenebilir mi? Bilişsel anlambilimciler bu soruya çok anlamlılık üzerinden cevap vermektedirler: Bilişsel anlambilimcilere göre, çok anlamlılık, deneyimlerimiz ile dilsel anlam arasında bulunan güçlü ilişkilerin bir yansımasıdır. Dolayısıyla, dilsel anlamın insan deneyimlerinden bağımsız incelenemeyeceğini iddia etmektedirler. Bu çalışmada bilişsel anlambilimin iddiaları çok anlamlılık üzerinden ele alınmaktadır.

Chapter 9 begins by examining the impact of revenge paradoxes on contextual theories of truth, including those of Parsons, Burge, Barwise and Etchemendy, and Glanzberg. These theories are hierarchical, and so are subject to revenge paradoxes that, roughly speaking, quantify over all levels. But the singularity theory is not hierarchical, and so is not subject to this kind of revenge. This chapter argues that a use of ‘true’ (or ‘denotes’ or ‘extension’) in a given context applies everywhere except to its singularities, and what escapes its reach is captured by other uses of ‘true’ in other contexts. Moreover, any use of ‘true’ applies even to the truths of the singularity theory, since these theoretical truths are not identified as singularities. The chapter concludes that the singularity theory is not compromised by revenge paradoxes, and respects Tarski’s intuition that natural languages are universal, while preserving classical logic and semantics.

This study delves into the intriguing realm of paradoxes that have long fascinated philosophers and logicians throughout history. It begins by discussing the nature and purpose of paradoxes, ranging from their role in entertainment to their capacity to reveal flaws within logical systems. This work emphasizes the challenge paradoxes pose to the completeness of systems and the subsequent development of axiomatic systems that aim to eliminate paradoxes. Rather than providing definitive solutions to paradoxes, the primary aim of this study is to defend the idea that systems containing paradoxes can coexist with completeness. The focus is on categorizing paradoxes, with special attention given to the group known as liar paradoxes, including Russell’s famous variation. The text demonstrates how these paradoxes are intrinsically linked to the principle of non-contradiction and argues that the truth and contradiction of propositions are both the cause and consequence of these paradoxes, presenting a dilemma within the system. The work introduces the concept of Aristotelian Sets (A-Sets) and Empty Sets as potential solutions to these paradoxes. It explores the idea that these sets, when carefully defined, can provide a meaningful representation of individual substances and predicates without violating the principle of non-contradiction. By proposing the inclusion of non-existents within a naive set theory and introducing A-Sets, this work seeks to contribute to the ongoing discourse surrounding paradoxes and their resolution. Ultimately, this study offers a fresh perspective on the handling of paradoxes, emphasizing the importance of reevaluating the foundations of formal and natural languages in the pursuit of a more comprehensive understanding of logic and philosophy.

John Buridan was a fourteenth-century philosopher who enjoyed an enormous reputation for about two hundred years, was then totally neglected, and is now being 'rediscovered' through his relevance to contemporary work in philosophical logic. The final chapter of Buridan's Sophismata deals with problems about self-reference, and in particular with the semantic paradoxes. He offers his own distinctive solution to the well-known 'Liar Paradox' and introduces a number of other paradoxes that will be unfamiliar to most logicians. Buridan also moves on from these problems to more general questions about the nature of propositions, the criteria of their truth and falsity and the concepts of validity and knowledge. This edition of that chapter is intended to make Buridan's ideas and arguments accessible to a wider range of readers. The volume should interest many philosophers, linguists and logicians, who are increasingly finding in medieval work striking anticipations of their own concerns.

John Sowa has often pointed out that his proposal of conceptual graphs develops and updates intuitions by Peirce, as well as by other thinkers in the areas of psychology and linguistics like Selz and Tesni~re. To the ideas of the latter refers the Fields medal Ren6 Thorn, who developed catastrophe theory and made several innovative proposals for the application of catastrophist formalism to natural language. Thorn's ideas have been developed in specifically linguistic terms by Wildgen, while Petitot has paid particularly close attention to the relationship between language and visual perception (Cf. in particular [Wildgen 1982] and [1994], [Petitot 1985] and [1995]). The contributions of Thorn, Wildgen and Petitot can be better understood as aspects of a broader research programme which we may call 'cognitive semantics.' In its turn, cognitive semantics is a component of an even broader programme which undertakes the transition from the paradigm of computational systems theory to the paradigm of dynamic systems theory. The first embedding that of the modern developments of proposals by Tesni~re and other structuralists working in cognitive semantics can be characterized by setting them against Chomskian theory. Indeed, cognitive semantics can also be viewed as a reaction against the cultural and academic hegemony of generativism, since cognitive linguistics regards language as a product of cognitive processes. For cognitive semanticists, "the basic principles of the cognitive organization of the world (perception of reality, construction of mental models, reference to encyclopedic knowledge, conceptualization, mental images and schemata, the grounding of meaning in bodily and social experience, and so on) can and should be accommodated into linguistic analysis ... On the other hand, the idea that the components of grammar should be analyzed separately is also rejected" ([Serra Borneto 1993], 445-6). Cognitive semantics, moreover, rejects the thesis of the overall independence of syntax from semantics. Generally speaking, this theory articulates into the following two branches:

The semantic paradoxes show that semantic theories that internalize their semantic concepts, such as truth and validity, cannot validate all classical logic. That is, it is necessary to weaken some connective of the object language, taken as the guilty of the paradoxes, or give up some property of the consequence relation of the logical theory. Both strategies may distance us from classical logic, the logic commonly used in our current mathematical theories. So, a desirable solution to semantic paradoxes cannot distance us from classical logic. This paper analyzes two interesting proposals that aim to maintain classical logic as most as possible. The first strategy, the Barrio & Pailos & Szmuc-approach (2017) (BPS-approach), proposes the paraconsistent logic MSC that contains in its object language a connective capable of recovering classical inference whenever the sentences at issue are consistent. So, they show that it is possible to build a semantic theory over this logic that is immune to the semantic paradoxes. The second approach is based on the hierarchy STω of non-transitive systems STn, proposed by Pailos (2020a). This hierarchy recovers classical metainferences as many as possible in higher levels of the hierarchy. We argue in favor of the second approach by arguing that the first strategy must adopt weak self-referential procedures to avoid the paradoxes.

It is always a challenge by using statistical method in corpus database to analyze semantics of natural language Sentences (NLS). This paper proposes a method of recognizing and translating ontology query in natural language, called OntoQuery-NLP. With the help of pre-create semantic templates, the OntoQuery-NLP maps NLSs matching the format of the semantic templates into formal semantic expressions. By parsing these semantic expressions, the OntoQuery-NLP recognizes the queries and gets the correct answers from ontology. Compared with other methods, the OntoQuery-NLP, without the support of any corpus, has faster retrieving speed and higher retrieving accuracy.

Voice Capture of Medical Residents' Clinical Information Needs During an Inpatient Rotation

For semantic modeling of a first-order language, it is proposed to use the thesis expressed by the recognized specialist in mathematical logic E. Mendelson that in mathematical logic “semantic concepts are of a set-theoretic nature”. This idea was not implemented for the reason that paradoxes were discovered in set theory. Therefore, it is proposed to use set algebra instead of set theory. The report formulates its differences from theory of sets, substantiates impossibility of paradoxes in it. The interpretation of the first-order language proposed by E. Mendelson is considered, its shortcomings are analyzed, and an interpretation variant is proposed closer to modeling of natural reasoning. It is established that the mathematical model of this interpretation is n-tuple algebra developed by the authors, which is isomorphic to algebra of sets. Because of this, modeling of reasoning based on this algebra can be called semantic modeling. The paper shows correspondences between predicate calculus formulas and expressions of n-tuple algebra, explains connections of these expressions with reasoning in natural languages. Positive results of semantic modeling based on n-tuple algebra are shown. A list of unresolved issues is provided.

An original model of linguistic summaries extracted from episodic data is briefly presented. In particular, a class of linguistic summaries expressed as modal equivalences is considered. The model is tailored to the concept of autonomous agent systems, and is supported by several detailed, non-technical, natural language processing and knowledge representation theories. Complementary to the well known classic interpretation of linguistic summaries, based on the fuzzy sets theory, the proposed model deals with a different class of vague cognitive concepts. The class consists of epistemic modalities, in particular the concepts of knowledge, belief and possibility. Each sub-class of linguistic summaries is processed as understood in the context of natural systems and supported by related cognitive semantics. Remarks on relevant implementation technologies are given, and an illustrative computational example is presented.

Referential Practice is an anthropological study of language use in a contemporary Maya community. It examines the routine conversational practices in which Maya speakers make reference to themselves and to each other, to their immediate contexts, and to their world. Drawing on extensive fieldwork in Oxkutzcab, Yucatan, William F. Hanks develops a sociocultural approach to reference in natural languages. The core of this approach lies in treating speech as a social engagement and reference as a practice through which actors orient themselves in the world. The conceptual framework derives from cultural anthropology, linguistic pragmatics, interpretive sociology, and cognitive semantics. As his central case, Hanks undertakes a comprehensive analysis of deixis-linguistic forms that fix reference in context, such as English I, you, this, that, here, and there. He shows that Maya deixis is a basic cultural construct linking language with body space, domestic space, agricultural and ritual practices, and other fields of social activity. Using this as a guide to ethnographic description, he discovers striking regularities in person reference and modes of participation, the role of perception in reference, and varieties of spatial orientation, including locative deixis. Traditionally considered a marginal area in linguistics and virtually untouched in the ethnographic literature, the study of referential deixis becomes in Hanks's treatment an innovative and revealing methodology. Referential Practice is the first full-length study of actual deictic use in a non-Western language, the first in-depth study of speech practice in Yucatec Maya culture, and the first detailed account of the relation between routine conversation, embodiment, and ritual discourse.

Autonomous on-line knowledge discovery and acquisition play an important role in cognitive informatics, cognitive computing, knowledge engineering, and computational intelligence. On the basis of the latest advances in cognitive informatics and denotational mathematics, this paper develops a web knowledge discovery engine for web document restructuring and comprehension, which decodes on-line knowledge represented in informal documents into cognitive knowledge represented by concept algebra and concept networks. A visualized concept network explorer and a semantic analyzer are implemented to capture and refine queries based on concept algebra. A graphical interface is built using concept and semantic models to refine users’ queries. To enable autonomous information restructuring by machines, a two-level knowledge base that mimics human lexical/syntactical and semantic cognition is introduced. The information restructuring model provides a foundation for automatic concept indexing and knowledge extraction from web documents. The web knowledge discovery engine extends machine learning capability from imperative and adaptive information processing to autonomous and cognitive knowledge processing with unstructured documents in natural languages.

The purpose of this study is to suggest and explain an engaging approach to three distinct types of (alleged or genuine) semantic paradoxes, the White-Horse-Not-Horse Paradox, the Ultimate-Unspeakable Paradox, and the Liar Paradox, in a unifying way that is sensitive to distinct features of them. Although the three types of semantic paradoxes address distinct types of objects, and although their seemingly paradoxical features are different (alleged or genuine), their distinct structures and contents can be understood and treated on the same common ground, which is jointly conceived in people’s pretheoretic understandings of truth and of the double-reference feature of people’s basic employment of language (saying something about an object), and from the unifying vantage point of a double-reference approach.

Is ‘same’ always used in the same sense? Do the truth conditions of statements of the form ‘x is the same as y’ remain constant throughout the variety of uses in which they may be embedded? These questions have been worrying linguists and logicians for some time. This paper is designed as a modest attempt toward the clarification of these issues. Its main claim is that we must distinguish the concepts of identity, persistence through time, and individuation: concepts which are interwoven in a variety of ways in our uses of ‘same’. On the basis of these distinctions a rigorous semantics can be developed that clarifies the meanings of a number of key phrases in natural languages like English. It should also aid those who probe the depths of certain metaphysical and logical problems concerning identity.

Why relational nominals make good concealed questions