一貫性

関: consistent

WordNet

logical coherence and accordance with the facts; "a rambling argument that lacked any consistency"
a harmonious uniformity or agreement among things or parts (同)consistence
the property of holding together and retaining its shape; "wool has more body than rayon"; "when the dough has enough consistency it is ready to bake" (同)consistence, eubstance, body
(logic) an attribute of a logical system that is so constituted that none of the propositions deducible from the axioms contradict one another
(sometimes followed by `with'
the same throughout in structure or composition; "bituminous coal is often treated as a consistent and homogeneous product" (同)uniform
the quality of being inconsistent and lacking a harmonious uniformity among things or parts

PrepTutorEJDIC

〈U〉(言南・匡理などの)一致,一貫性 / 〈U〉〈C〉(特に液体の)濃度,濃さ;(物質の)堅さ,ねばり
『矛盾のない』 / (主義・考え方などが)不変の,(人が)節操のある
〈U〉不一致,矛盾した事(物)

Wikipedia preview

出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2014/05/08 17:32:22」(JST)

wiki en

[Wiki en表示]

In classical deductive logic, a consistent theory is one that does not contain a contradiction.^[1]^[2] The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent if and only if it has a model, i.e. there exists an interpretation under which all formulas in the theory are true. This is the sense used in traditional Aristotelian logic, although in contemporary mathematical logic the term satisfiable is used instead. The syntactic definition states that a theory is consistent if and only if there is no formula P such that both P and its negation are provable from the axioms of the theory under its associated deductive system.

If these semantic and syntactic definitions are equivalent for a particular deductive logic, the logic is complete.^{[citation needed]} The completeness of the sentential calculus was proved by Paul Bernays in 1918^{[citation needed]}^[3] and Emil Post in 1921,^[4] while the completeness of predicate calculus was proved by Kurt Gödel in 1930,^[5] and consistency proofs for arithmetics restricted with respect to the induction axiom schema were proved by Ackermann (1924), von Neumann (1927) and Herbrand (1931).^[6] Stronger logics, such as second-order logic, are not complete.

A consistency proof is a mathematical proof that a particular theory is consistent. The early development of mathematical proof theory was driven by the desire to provide finitary consistency proofs for all of mathematics as part of Hilbert's program. Hilbert's program was strongly impacted by incompleteness theorems, which showed that sufficiently strong proof theories cannot prove their own consistency (provided that they are in fact consistent).

Although consistency can be proved by means of model theory, it is often done in a purely syntactical way, without any need to reference some model of the logic. The cut-elimination (or equivalently the normalization of the underlying calculus if there is one) implies the consistency of the calculus: since there is obviously no cut-free proof of falsity, there is no contradiction in general.

Consistency and completeness in arithmetic and set theory

In theories of arithmetic, such as Peano arithmetic, there is an intricate relationship between the consistency of the theory and its completeness. A theory is complete if, for every formula φ in its language, at least one of φ or ¬ φ is a logical consequence of the theory.

Presburger arithmetic is an axiom system for the natural numbers under addition. It is both consistent and complete.

Gödel's incompleteness theorems show that any sufficiently strong effective theory of arithmetic cannot be both complete and consistent. Gödel's theorem applies to the theories of Peano arithmetic (PA) and Primitive recursive arithmetic (PRA), but not to Presburger arithmetic.

Moreover, Gödel's second incompleteness theorem shows that the consistency of sufficiently strong effective theories of arithmetic can be tested in a particular way. Such a theory is consistent if and only if it does not prove a particular sentence, called the Gödel sentence of the theory, which is a formalized statement of the claim that the theory is indeed consistent. Thus the consistency of a sufficiently strong, effective, consistent theory of arithmetic can never be proven in that system itself. The same result is true for effective theories that can describe a strong enough fragment of arithmetic – including set theories such as Zermelo–Fraenkel set theory. These set theories cannot prove their own Gödel sentences – provided that they are consistent, which is generally believed.

Because consistency of ZF is not provable in ZF, the weaker notion relative consistency is interesting in set theory (and in other sufficiently expressive axiomatic systems). If T is a theory and A is an additional axiom, T + A is said to be consistent relative to T (or simply that A is consistent with T) if it can be proved that if T is consistent then T + A is consistent. If both A and ¬A are consistent with T, then A is said to be independent of T.

First-order logic

Notation

⊢ (Turnstyle symbol) in the following context of Mathematical logic, means "provable from". That is, a ⊢ b reads: b is provable from a (in some specified formal system) -- see List of logic symbols) . In other cases, the turnstyle symbol may stand to mean infers; derived from. See: List of mathematical symbols.

Definition

A set of formulas in first-order logic is consistent (written Con) if and only if there is no formula such that and . Otherwise is inconsistent and is written Inc.

is said to be simply consistent if and only if for no formula of , both and the negation of are theorems of .

is said to be absolutely consistent or Post consistent if and only if at least one formula of is not a theorem of .

is said to be maximally consistent if and only if for every formula , if Con () then .

is said to contain witnesses if and only if for every formula of the form there exists a term such that . See First-order logic.

Basic results

The following are equivalent:
1. Inc
2. For all
Every satisfiable set of formulas is consistent, where a set of formulas is satisfiable if and only if there exists a model such that .
For all and :
1. if not , then Con;
2. if Con and , then Con;
3. if Con , then Con or Con.
Let be a maximally consistent set of formulas and contain witnesses. For all and :
1. if , then ,
2. either or ,
3. if and only if or ,
4. if and , then ,
5. if and only if there is a term such that .

Henkin's theorem

Let be a maximally consistent set of -formulas containing witnesses.

Define a binary relation on the set of -terms such that if and only if ; and let denote the equivalence class of terms containing ; and let where is the set of terms based on the symbol set .

Define the -structure over the term-structure corresponding to by:

for -ary , if and only if ;
for -ary , ;
for , .

Let be the term interpretation associated with , where .

For all , if and only if .

Sketch of proof

There are several things to verify. First, that is an equivalence relation. Then, it needs to be verified that (1), (2), and (3) are well defined. This falls out of the fact that is an equivalence relation and also requires a proof that (1) and (2) are independent of the choice of class representatives. Finally, can be verified by induction on formulas.

Footnotes

^ Tarski 1946 states it this way: "A deductive theory is called CONSISTENT or NON-CONTRADICTORY if no two asserted statements of this theory contradict each other, or in other words, if of any two contradictory sentences . . . at least one cannot be proved," (p. 135) where Tarski defines contradictory as follows: "With the help of the word not one forms the NEGATION of any sentence; two sentences, of which the first is a negation of the second, are called CONTRADICTORY SENTENCES" (p. 20). This definition requires a notion of "proof". Gödel in his 1931 defines the notion this way: "The class of provable formulas is defined to be the smallest class of formulas that contains the axioms and is closed under the relation "immediate consequence", i.e. formula c of a and b is defined as an immediate consequence in terms of modus ponens or substitution; cf Gödel 1931 van Heijenoort 1967:601. Tarski defines "proof" informally as "statements follow one another in a definite order according to certain principles . . . and accompanied by considerations intended to establish their validity[true conclusion for all true premises -- Reichenbach 1947:68]" cf Tarski 1946:3. Kleene 1952 defines the notion with respect to either an induction or as to paraphrase) a finite sequence of formulas such that each formula in the sequence is either an axiom or an "immediate consequence" of the preceding formulas; "A proof is said to be a proof of its last formula, and this formula is said to be (formally) provable or be a (formal) theorem" cf Kleene 1952:83.
^ Paraconsistent logic tolerates contradictions, but toleration of contradiction does not entail consistency.
^ van Heijenoort 1967:265 states that Bernays determined the independence of the axioms of Principia Mathematica, a result not published until 1926, but he says nothing about Bernays proving their consistency.
^ Post proves both consistency and completeness of the propositional calculus of PM, cf van Heijenoort's commentary and Post's 1931 Introduction to a general theory of elementary propositons in van Heijenoort 1967:264ff. Also Tarski 1946:134ff.
^ cf van Heijenoort's commentary and Gödel's 1930 The completeness of the axioms of the functional calculus of logic in van Heijenoort 1967:582ff
^ cf van Heijenoort's commentary and Herbrand's 1930 On the consistency of arithmetic in van Heijenoort 1967:618ff.

References

Stephen Kleene, 1952 10th impression 1991, Introduction to Metamathematics, North-Holland Publishing Company, Amsterday, New York, ISBN 0-7204-2103-9.
Hans Reichenbach, 1947, Elements of Symbolic Logic, Dover Publications, Inc. New York, ISBN 0-486-24004-5,
Alfred Tarski, 1946, Introduction to Logic and to the Methodology of Deductive Sciences, Second Edition, Dover Publications, Inc., New York, ISBN 0-486-28462-X.
Jean van Heijenoort, 1967, From Frege to Gödel: A Source Book in Mathematical Logic, Harvard University Press, Cambridge, MA, ISBN 0-674-32449-8 (pbk.)
The Cambridge Dictionary of Philosophy, consistency
H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic
Jevons, W.S., 1870, Elementary Lessons in Logic

External links

Chris Mortensen, Inconsistent Mathematics, Stanford Encyclopedia of Philosophy

UpToDate Contents

全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.

1. 2型糖尿病における栄養上の考慮事項 nutritional considerations in type 2 diabetes mellitus
2. 1型糖尿病における栄養上の考慮事項 nutritional considerations in type 1 diabetes mellitus
3. 緩和ケアにおける嚥下障害および誤嚥：評価およびマネージメント戦略 swallowing disorders and aspiration in palliative care assessment and strategies for management
4. テレビおよびメディアの暴力 television and media violence
5. 幹細胞の概要 overview of stem cells

English Journal

Flavour generation during commercial barley and malt roasting operations: A time course study.

Yahya H, Linforth RS, Cook DJ.SourceFaculty of Science and Technology, Islamic Science University of Malaysia, Bandar Baru Nilai, 71800 Negeri Sembilan, Malaysia.
Food chemistry.Food Chem.2014 Feb 15;145:378-87. doi: 10.1016/j.foodchem.2013.08.046. Epub 2013 Aug 20.
The roasting of barley and malt products generates colour and flavour, controlled principally by the time course of product temperature and moisture content. Samples were taken throughout the industrial manufacture of three classes of roasted product (roasted barley, crystal malt and black malt) and
PMID 24128492

Konjac glucomannan-induced changes in thiol/disulphide exchange and gluten conformation upon dough mixing.

Zhou Y, Zhao D, Foster TJ, Liu Y, Wang Y, Nirasawa S, Tatsumi E, Cheng Y.SourceBeijing Key Laboratory of Functional Food from Plant Resources, College of Food Science and Nutritional Engineering, China Agricultural University, Beijing 100083, PR China.
Food chemistry.Food Chem.2014 Jan 15;143:163-9. doi: 10.1016/j.foodchem.2013.07.088. Epub 2013 Jul 26.
Effects of konjac glucomannan (KGM) on the changes in gluten upon dough mixing were investigated in this study. Wheat flour was blended with KGM and processed into dough. Farinographic analysis showed that KGM caused a significant increase in water absorption and dough development time to reach maxi
PMID 24054226

Validation and psychometric properties of the Delirium Motor Subtype Scale in elderly hip fracture patients (Dutch version).

Slor CJ, Adamis D, Jansen RW, Meagher DJ, Witlox J, Houdijk AP, de Jonghe JF.SourceDepartment of Geriatric Medicine, Medical Center Alkmaar, Alkmaar, The Netherlands. Electronic address: c.slor@mca.nl.
Archives of gerontology and geriatrics.Arch Gerontol Geriatr.2014 Jan-Feb;58(1):140-4. doi: 10.1016/j.archger.2013.07.014. Epub 2013 Aug 8.
The Delirium Motor Subtype Scale (DMSS) was developed to capture all the previous different approaches to delirium motor subtyping into one new instrument and emphasize disturbances of motor activity rather than associated psychomotoric symptoms. We investigated reliability and validity of the DMSS
PMID 23993271

Mediterranean dietary pattern and chronic diseases.

Panico S, Mattiello A, Panico C, Chiodini P.SourceDepartment of Clinical and Experimental Medicine, Federico II University, Naples, Italy, spanico@unina.it.
Cancer treatment and research.Cancer Treat Res.2014;159:69-81. doi: 10.1007/978-3-642-38007-5_5.
The study of the relationship between the Mediterranean way of eating and the occurrence of diseases typical of the economically developed countries has been considered the starting point of nutritional epidemiology. From the Seven Countries Study in the 1950s to the recent European EPIC collaborati
PMID 24114475

Japanese Journal

Keynote Speech: Human/Technology Interface and Interactivity

Kia Ng
情報処理学会研究報告. [音楽情報科学] 2012-MUS-97(11), 1, 2012-12-14
… Among the many challenges, it requires knowledge, time, care, dedication and focus to learn gesture related controls and techniques, and to progress from "knowing" what to do, into "doing" it, and to transform "doing" into an expressive performance with a high degree of control, repeatability and consistency with confidence. …
NAID 110009493058

Cassandraによる局所性を考慮した分散並列処理の提案

菱沼直子,竹房あつ子,中田秀基,小口正人
情報処理学会研究報告. データベース・システム研究会報告 2012-DBS-156(25), 1-5, 2012-12-05
近年,大量のデータを高速に処理することが必要な場面が増え,分散 KVS (Key Value Store) と呼ばれる NoSQL 型データベース管理システムが注目され始めた.分散 KVS に格納された大容量データを効率よく活用するには,データの並列処理が必要となるが,分散 KVS から対象データを取り出した後,再度データを分散させて並列処理を行うと,処理効率が悪くなってしまう.そこで本研究では, …
NAID 110009490423