نتایج جستجو برای: true meaning

تعداد نتایج: 202042  

2013
Sylvain Kahane

This paper shows how to introduce predicative adjunction in a dependency grammar inspired from TAG, MTT and RG. The addition of predicative adjunction allows us to obtain a modular surface syntactic grammar, the derivation structures of which can be interpreted as semantic representations.

2014
Zhaohui Luo

In this talk, we contend that, for NLs, the divide between model-theoretic semantics and proof-theoretic semantics has not been well-understood. In particular, the formal semantics based on modern type theories (MTTs) may be seen as both model-theoretic and prooftheoretic. To be more precise, it may be seen both ways in the sense that the NL semantics can first be represented in an MTT in a mod...

Journal: :Signs and media 2021

Abstract Truth is the core issue of any theory meaning, and pursuit truth fundamental driving force human consciousness. Is appearance true? In what sense it truth? How do we obtain Can a final be obtained? These are among most difficult questions to answer in meaning best divergence points various theories. Peirce’s semiotic phenomenology puts forward view that can grasped clearly but neverthe...

2008
L. A. ZADEH

PRUF--an acronym for Possibilistie Relational Universal Fuzzy--is a meaning representation language for natural languages which departs from the conventional approaches to the theory of meaning in several important respects. First, a basic assumption underlying PRUF is that the imprecision that is intrinsic in natural languages is, for the most part, possibilistic rather than probabilistic in n...

2014
Ivano Ciardelli

Introduction To know the meaning of a declarative sentence is to know what the world should be like for the sentence to be true. To know the meaning of an interrogative sentence is to know what information is needed to resolve it. Like the meaning of a declarative sentence is equated with its truth-conditions—and identified with the set of worlds satisfying these conditions—the meaning of an in...

2007
Jonathan Cohen

If semantics is the study of meanings, and the meaning of an expression e is understood as what speakers of the language must know use e competently, then a natural first guess is that the correct semantics of names will involve their referents. One might, initially, make the further supposition that the meaning of a name is just its referent. However, this sort of ‘Fido’-Fido view immediately ...

Journal: :J. Symb. Log. 2006
Thomas E. Forster

It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T -function which is peculiar to NF turn out to be equivalent to the truth-in-certain-permutation-models of assertions which have perfectly sensible ZF-style meanings, such as: the existence of wellfounded sets of great size or rank, or the nonexistence of small counterexamples to the wellfoundedness o...

Journal: :Frontiers in bioscience 2009
Charlotte Schiestel Denita Ryan

Health-related quality of life (QOL) is a complex subject that requires assessment of patients' perceptions about their lives after surgery or illness in addition to the perceptions of surgeons about outcomes and radiographic findings. Patients should be asked about the effect of the disease on their work life, relationships, emotional and physical well being, and level of independence. Even th...

2011
Lina Maria Rojas-Barahona Matthieu Quignard

The semantic annotation of dialogue corpora permits building efficient language understanding applications for supporting enjoyable and effective human-machine interactions. Nevertheless, the annotation process could be costly, time-consuming and complicated, particularly the more expressive is the semantic formalism. In this work, we propose a bootstrapping architecture for the semantic annota...

Journal: :Math. Log. Q. 2006
Amélie Gheerbrant Marcin Mostowski

We consider first order modal logic C firstly defined by Carnap in “Meaning and Necessity” [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-Löwenheim theorem for C. We also evaluate the degree of unsolvability for C, by showing that it is exactly 0′. We compare this logic with the logics of Henkin quantifiers, Σ1 logic, and SO. We also shortly d...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید