Consistency in the context of "Structural proof theory"

Play Trivia Questions online!

or

Skip to study material about Consistency in the context of "Structural proof theory"

Ad spacer

⭐ Core Definition: Consistency

In deductive logic, a consistent theory is one that does not lead to a logical contradiction. A theory is consistent if there is no formula such that both and its negation are elements of the set of consequences of . Let be a set of closed sentences (informally "axioms") and the set of closed sentences provable from under some (specified, possibly implicitly) formal deductive system. The set of axioms is consistent when there is no formula such that and . A trivial theory (i.e., one which proves every sentence in the language of the theory) is clearly inconsistent. Conversely, in an explosive formal system (e.g., classical or intuitionistic propositional or first-order logics) every inconsistent theory is trivial. Consistency of a theory is a syntactic notion, whose semantic counterpart is satisfiability. A theory is satisfiable if it has a model, i.e., there exists an interpretation under which all axioms in the theory are true. This is what consistent meant in traditional Aristotelian logic, although in contemporary mathematical logic the term satisfiable is used instead.

In a sound formal system, every satisfiable theory is consistent, but the converse does not hold. If there exists a deductive system for which these semantic and syntactic definitions are equivalent for any theory formulated in a particular deductive logic, the logic is called complete. The completeness of the propositional calculus was proved by Paul Bernays in 1918 and Emil Post in 1921, while the completeness of (first order) predicate calculus was proved by Kurt Gödel in 1930, and consistency proofs for arithmetics restricted with respect to the induction axiom schema were proved by Ackermann (1924), von Neumann (1927) and Herbrand (1931). Stronger logics, such as second-order logic, are not complete.

↓ Menu

>>>PUT SHARE BUTTONS HERE<<<
In this Dossier

Consistency in the context of Formal system

A formal system (or deductive system) is an abstract structure and formalization of an axiomatic system used for deducing, using rules of inference, theorems from axioms.

In 1921, David Hilbert proposed to use formal systems as the foundation of knowledge in mathematics.However, in 1931 Kurt Gödel proved that any consistent formal system sufficiently powerful to express basic arithmetic cannot prove its own completeness. This effectively showed that Hilbert's program was impossible as stated.

↑ Return to Menu

Consistency in the context of Rigour

Rigour (British English) or rigor (American English; see spelling differences) describes a condition of stiffness or strictness. These constraints may be environmentally imposed, such as "the rigours of famine"; logically imposed, such as mathematical proofs which must maintain consistent answers; or socially imposed, such as the process of defining ethics and law.

↑ Return to Menu

Consistency in the context of Self-refuting idea

A self-refuting idea or self-defeating idea is an idea or statement whose falsehood is a logical consequence of the act or situation of holding them to be true. Many ideas are called self-refuting by their detractors, and such accusations are therefore almost always controversial, with defenders stating that the idea is being misunderstood or that the argument is invalid. For these reasons, none of the ideas below are unambiguously or incontrovertibly self-refuting. These ideas are often used as axioms, which are definitions taken to be true (tautological assumptions), and cannot be used to test themselves, for doing so would lead to only two consequences: consistency (circular reasoning) or exception (self-contradiction).

↑ Return to Menu

Consistency in the context of Fallacies of relevance

An irrelevant conclusion, also known as ignoratio elenchi (Latin for 'ignoring refutation') or missing the point, is the informal fallacy of presenting an argument whose conclusion fails to address the issue in question. It falls into the broad class of relevance fallacies.

The irrelevant conclusion should not be confused with formal fallacy, an argument whose conclusion does not follow from its premises; instead, it is that despite its formal consistency it is not relevant to the subject being talked about.

↑ Return to Menu

Consistency in the context of Foundations of mathematics

Foundations of mathematics are the logical and mathematical framework that allows the development of mathematics without generating self-contradictory theories, and to have reliable concepts of theorems, proofs, algorithms, etc. in particular. This may also include the philosophical study of the relation of this framework with reality.

↑ Return to Menu

Consistency in the context of Zeno's paradoxes

Zeno's paradoxes are a series of philosophical arguments presented by the ancient Greek philosopher Zeno of Elea (c. 490–430 BC), primarily known through the works of Plato, Aristotle, and later commentators like Simplicius of Cilicia. Zeno devised these paradoxes to support his teacher Parmenides's philosophy of monism, which posits that despite people's sensory experiences, reality is singular and unchanging. The paradoxes famously challenge the notions of plurality (the existence of many things), motion, space, and time by suggesting they lead to logical contradictions.

Zeno's work, primarily known from second-hand accounts since his original texts are lost, comprises forty "paradoxes of plurality," which argue against the coherence of believing in multiple existences, and several arguments against motion and change. Of these, only a few are definitively known today, including the renowned "Achilles Paradox", which illustrates the problematic concept of infinite divisibility in space and time. In this paradox, Zeno argues that a swift runner like Achilles cannot overtake a slower moving tortoise with a head start, because the distance between them can be infinitely subdivided, implying Achilles would require an infinite number of steps to catch the tortoise.

↑ Return to Menu