Concept

Truth-bearer

A truth-bearer is an entity that is said to be either true or false and nothing else. The thesis that some things are true while others are false has led to different theories about the nature of these entities. Since there is divergence of opinion on the matter, the term truth-bearer is used to be neutral among the various theories. Truth-bearer candidates include propositions, sentences, sentence-tokens, statements, beliefs, thoughts, intuitions, utterances, and judgements but different authors exclude one or more of these, deny their existence, argue that they are true only in a derivative sense, assert or assume that the terms are synonymous, or seek to avoid addressing their distinction or do not clarify it. Some distinctions and terminology as used in this article, based on Wolfram 1989 (Chapter 2 Section1) follow. It should be understood that the terminology described is not always used in the ways set out, and it is introduced solely for the purposes of discussion in this article. Use is made of the type–token and use–mention distinctions. Reflection on occurrences of numerals might be helpful. In grammar a sentence can be a declaration, an explanation, a question, a command. In logic a declarative sentence is considered to be a sentence that can be used to communicate truth. Some sentences which are grammatically declarative are not logically so. A character is a typographic character (printed or written) etc. A word-token is a pattern of characters. A word-type is an identical pattern of characters. A meaningful-word-token is a meaningful pattern of characters. Two word-tokens which mean the same are of the same word-meaning A sentence-token is a pattern of word-tokens. A meaningful-sentence-token is a meaningful sentence-token or a meaningful pattern of meaningful-word-tokens. Two sentence-tokens are of the same sentence-type if they are identical patterns of word-tokens characters A declarative-sentence-token is a sentence-token which that can be used to communicate truth or convey information.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
Cours associés (1)
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
Séances de cours associées (4)
Logique principale : quantificateurs, FNC, DNF
Couvre Predice Logic, en mettant l'accent sur les quantificateurs, le FNC et le DNF.
Mathématiques discrètes: Logique, Structures, Algorithmes
Couvre les bases des mathématiques discrètes, y compris la logique, les structures et les algorithmes.
Afficher plus
Concepts associés (16)
Logique
La logique — du grec , qui est un terme dérivé de signifiant à la fois « raison », « langage » et « raisonnement » — est, dans une première approche, l'étude de l'inférence, c'est-à-dire des règles formelles que doit respecter toute argumentation correcte. Le terme aurait été utilisé pour la première fois par Xénocrate. La logique antique se décompose d'abord en dialectique et rhétorique. Elle est depuis l'Antiquité l'une des grandes disciplines de la philosophie, avec l'éthique (philosophie morale) et la physique (science de la nature).
Atomic sentence
In logic and analytic philosophy, an atomic sentence is a type of declarative sentence which is either true or false (may also be referred to as a proposition, statement or truthbearer) and which cannot be broken down into other simpler sentences. For example, "The dog ran" is an atomic sentence in natural language, whereas "The dog ran and the cat hid" is a molecular sentence in natural language. From a logical analysis point of view, the truth or falsity of sentences in general is determined by only two things: the logical form of the sentence and the truth or falsity of its simple sentences.
Sentence (mathematical logic)
In mathematical logic, a sentence (or closed formula) of a predicate logic is a Boolean-valued well-formed formula with no free variables. A sentence can be viewed as expressing a proposition, something that must be true or false. The restriction of having no free variables is needed to make sure that sentences can have concrete, fixed truth values: as the free variables of a (general) formula can range over several values, the truth value of such a formula may vary.
Afficher plus

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.