Atomic sentence

Last updated

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.

Contents

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. This is to say, for example, that the truth of the sentence "John is Greek and John is happy" is a function of the meaning of "and", and the truth values of the atomic sentences "John is Greek" and "John is happy". However, the truth or falsity of an atomic sentence is not a matter that is within the scope of logic itself, but rather whatever art or science the content of the atomic sentence happens to be talking about. [1]

Logic has developed artificial languages, for example sentential calculus and predicate calculus, partly with the purpose of revealing the underlying logic of natural-language statements, the surface grammar of which may conceal the underlying logical structure. In these artificial languages an atomic sentence is a string of symbols which can represent an elementary sentence in a natural language, and it can be defined as follows. In a formal language, a well-formed formula (or wff) is a string of symbols constituted in accordance with the rules of syntax of the language. A term is a variable, an individual constant or an n-place function letter followed by n terms. An atomic formula is a wff consisting of either a sentential letter or an n-place predicate letter followed by n terms. A sentence is a wff in which any variables are bound. An atomic sentence is an atomic formula containing no variables. It follows that an atomic sentence contains no logical connectives, variables, or quantifiers. A sentence consisting of one or more sentences and a logical connective is a compound (or molecular) sentence.

Examples

Assumptions

In the following examples:

Atomic sentences

These wffs are atomic sentences; they contain no free variables or conjunctions:

Atomic formulae

These wffs are atomic formulae, but are not sentences (atomic or otherwise) because they include free variables:

Compound sentences

These wffs are compound sentences. They are sentences, but are not atomic sentences because they are not atomic formulae:

Compound formulae

These wffs are compound formulae. They are not atomic formulae but are built up from atomic formulae using logical connectives. They are also not sentences because they contain free variables:

Interpretations

A sentence is either true or false under an interpretation which assigns values to the logical variables. We might for example make the following assignments:

Individual constants

Predicates

Sentential variables

Under this interpretation the sentences discussed above would represent the following English statements:

Translating sentences from a natural language into an artificial language

Sentences in natural languages can be ambiguous, whereas the languages of the sentential logic and predicate logics are precise. Translation can reveal such ambiguities and express precisely the intended meaning.

For example, take the English sentence “Father Ted married Jack and Jill”. Does this mean Jack married Jill? In translating we might make the following assignments: Individual Constants

Predicates:

Using these assignments the sentence above could be translated as follows:

To establish which is the correct translation of “Father Ted married Jack and Jill”, it would be necessary to ask the speaker exactly what was meant.

Philosophical significance

Atomic sentences are of particular interest in philosophical logic and the theory of truth and, it has been argued, there are corresponding atomic facts.

An atomic sentence (or possibly the meaning of an atomic sentence) is called an elementary proposition by Ludwig Wittgenstein and an atomic proposition by Bertrand Russell:

Note the distinction between an elementary/atomic proposition and an atomic fact.

No atomic sentence can be deduced from (is not entailed by) any other atomic sentence, no two atomic sentences are incompatible, and no sets of atomic sentences are self-contradictory. Wittgenstein made much of this in his Tractatus. If there are any atomic sentences then there must be "atomic facts" which correspond to those that are true, and the conjunction of all true atomic sentences would say all that was the case, i.e., "the world" since, according to Wittgenstein, "The world is all that is the case". (TLP:1). Similarly the set of all sets of atomic sentences corresponds to the set of all possible worlds (all that could be the case).

The T-schema, which embodies the theory of truth proposed by Alfred Tarski, defines the truth of arbitrary sentences from the truth of atomic sentences.

See also

Related Research Articles

First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists" is a quantifier, while x is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic.

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions.

<i>Principia Mathematica</i> Book on the foundations of mathematics

The Principia Mathematica is a three-volume work on the foundations of mathematics written by mathematician–philosophers Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1913. In 1925–1927, it appeared in a second edition with an important Introduction to the Second Edition, an Appendix A that replaced ✸9 and all-new Appendix B and Appendix C. PM is not to be confused with Russell's 1903 The Principles of Mathematics. PM was originally conceived as a sequel volume to Russell's 1903 Principles, but as PM states, this became an unworkable suggestion for practical and philosophical reasons: "The present work was originally intended by us to be comprised in a second volume of Principles of Mathematics... But as we advanced, it became increasingly evident that the subject is a very much larger one than we had supposed; moreover on many fundamental questions which had been left obscure and doubtful in the former work, we have now arrived at what we believe to be satisfactory solutions."

<span class="mw-page-title-main">Sheffer stroke</span> Logical operation

In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called nand or the alternative denial, since it says in effect that at least one of its operands is false. In digital electronics, it corresponds to the NAND gate. It is named after Henry M. Sheffer and written as ↑ or as |. In Bocheński notation it can be written as Dpq.

<i>Tractatus Logico-Philosophicus</i> 1921 philosophical work by Ludwig Wittgenstein

The Tractatus Logico-Philosophicus is the only book-length philosophical work by the Austrian philosopher Ludwig Wittgenstein that was published during his lifetime. The project had a broad goal: to identify the relationship between language and reality and to define the limits of science. Wittgenstein wrote the notes for the Tractatus while he was a soldier during World War I and completed it during a military leave in the summer of 1918. It was originally published in German in 1921 as Logisch-Philosophische Abhandlung. In 1922 it was published together with an English translation and a Latin title, which was suggested by G. E. Moore as homage to Baruch Spinoza's Tractatus Theologico-Politicus (1670).

A proposition is a central concept in philosophy of language and related fields, often characterized as the primary bearer of truth or falsity. Propositions are also often characterized as being the kind of thing that declarative sentences denote. For instance the sentence "The sky is blue" denotes the proposition that the sky is blue. However, crucially, propositions are not themselves linguistic expressions. For instance, the English sentence "Snow is white" denotes the same proposition as the German sentence "Schnee ist weiß" even though the two sentences are not the same. Similarly, propositions can also be characterized as the objects of belief and other propositional attitudes. For instance if one believes that the sky is blue, what one believes is the proposition that the sky is blue.

In mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language. A formal language can be identified with the set of formulas in the language.

In philosophy and logic, a deflationary theory of truth is one of a family of theories that all have in common the claim that assertions of predicate truth of a statement do not attribute a property called "truth" to such a statement.

In logic, a truth function is a function that accepts truth values as input and produces a unique truth value as output. In other words: The input and output of a truth function are all truth values; a truth function will always output exactly one truth value; and inputting the same truth value(s) will always output the same truth value. The typical example is in propositional logic, wherein a compound statement is constructed using individual statements connected by logical connectives; if the truth value of the compound statement is entirely determined by the truth value(s) of the constituent statement(s), the compound statement is called a truth function, and any logical connectives used are said to be truth functional.

In mathematical logic, a predicate variable is a predicate letter which functions as a "placeholder" for a relation, but which has not been specifically assigned any particular relation. Common symbols for denoting predicate variables include capital roman letters such as , and , or lower case roman letters, e.g., . In first-order logic, they can be more properly called metalinguistic variables. In higher-order logic, predicate variables correspond to propositional variables which can stand for well-formed formulas of the same logic, and such variables can be quantified by means of second-order quantifiers.

In mathematical logic, a propositional variable is an input variable of a truth function. Propositional variables are the basic building-blocks of propositional formulas, used in propositional logic and higher-order logics.

In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional formula may also be called a propositional expression, a sentence, or a sentential formula.

In mathematical logic, a sentence 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.

In mathematical logic, an atomic formula is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformulas. Atoms are thus the simplest well-formed formulas of the logic. Compound formulas are formed by combining the atomic formulas using the logical connectives.

In mathematical logic, a tautology is a formula or assertion that is true in every possible interpretation. An example is "x=y or x≠y". Similarly, "either the ball is green, or the ball is not green" is always true, regardless of the colour of the ball.

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.

Logic is the formal science of using reason and is considered a branch of both philosophy and mathematics and to a lesser extent computer science. Logic investigates and classifies the structure of statements and arguments, both through the study of formal systems of inference and the study of arguments in natural language. The scope of logic can therefore be very large, ranging from core topics such as the study of fallacies and paradoxes, to specialized analyses of reasoning such as probability, correct reasoning, and arguments involving causality. One of the aims of logic is to identify the correct and incorrect inferences. Logicians study the criteria for the evaluation of arguments.

An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any meaning until they are given some interpretation. The general study of interpretations of formal languages is called formal semantics.

According to Rudolf Carnap, in logic, an interpretation is a descriptive interpretation if at least one of the undefined symbols of its formal system becomes, in the interpretation, a descriptive sign. In his Introduction to Semantics he makes a distinction between formal interpretations which are logical interpretations and descriptive interpretations: a formal interpretation is a descriptive interpretation if it is not a logical interpretation.

The mathematical concept of a function emerged in the 17th century in connection with the development of the calculus; for example, the slope of a graph at a point was regarded as a function of the x-coordinate of the point. Functions were not explicitly considered in antiquity, but some precursors of the concept can perhaps be seen in the work of medieval philosophers and mathematicians such as Oresme.

References

  1. The Philosophy of Logic by Willard Van Orman Quine (1970).
  2. "Russell's Logical Atomism". Stanford Encyclopedia of Philosophy.
  3. "Wittgenstein's Logical Atomism". Stanford Encyclopedia of Philosophy.

Bibliography