WordNet
- the state of being crude and incomplete and imperfect; "the study was criticized for incompleteness of data but it stimulated further research"; "the rawness of his diary made it unpublishable" (同)rawness
Wikipedia preview
出典(authority):フリー百科事典『ウィキペディア(Wikipedia)』「2014/02/06 20:30:30」(JST)
[Wiki en表示]
|
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (January 2014) |
In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields.
Contents
- 1 Logical completeness
- 2 Mathematical completeness
- 3 Computing
- 4 Economics, finance, and industry
- 5 Botany
- 6 References
Logical completeness[edit]
In logic, semantic completeness is the converse of soundness for formal systems. A formal system is "semantically complete" when all its tautologies are theorems, whereas a formal system is "sound" when all theorems are tautologies (that is, they are semantically valid formulas: formulas that are true under every interpretation of the language of the system that is consistent with the rules of the system). Kurt Gödel, Leon Henkin, and Emil Post all published proofs of completeness. (See History of the Church–Turing thesis.) A formal system is consistent if for all formulas φ of the system, the formulas φ and ¬φ (the negation of φ) are not both theorems of the system (that is, they cannot be both proved with the rules of the system).
- A formal system S is semantically complete or simply complete, if every tautology of S is a theorem of S. That is, .[1]
- A formal system S is strongly complete or complete in the strong sense if for every set of premises Γ, any formula which semantically follows from Γ is derivable from Γ. That is, .
- A formal system S is syntactically complete or deductively complete or maximally complete or simply complete if for each sentence (closed formula) φ of the language of the system either φ or ¬φ is a theorem of S. This is also called negation completeness. In another sense, a formal system is syntactically complete if and only if no unprovable axiom can be added to it as an axiom without introducing an inconsistency. Truth-functional propositional logic and first-order predicate logic are semantically complete, but not syntactically complete (for example, the propositional logic statement consisting of a single propositional variable A is not a theorem, and neither is its negation, but these are not tautologies). Gödel's incompleteness theorem shows that any recursive system that is sufficiently powerful, such as Peano arithmetic, cannot be both consistent and syntactically complete.
- A system of logical connectives is functionally complete if and only if it can express all propositional functions.
- A language is expressively complete if it can express the subject matter for which it is intended.[citation needed]
- A formal system is complete with respect to a property if and only if every sentence that has the property is a theorem.[citation needed]
Mathematical completeness[edit]
In mathematics, "complete" is a term that takes on specific meanings in specific situations, and not every situation in which a type of "completion" occurs is called a "completion". See, for example, algebraically closed field or compactification.
- The completeness of the real numbers is one of the defining properties of the real number system. It may be described equivalently as either the completeness of R as metric space or as a partially ordered set (see below).
- A metric space is complete if every Cauchy sequence in it converges. See Complete metric space.
- A uniform space is complete if every Cauchy net in it converges (or equivalently every Cauchy filter in it converges).
- In functional analysis, a subset S of a topological vector space V is complete if its span is dense in V. In the particular case of Hilbert spaces (or more generally, inner product spaces), an orthonormal basis is a set that is both complete and orthonormal.
- A measure space is complete if every subset of every null set is measurable. See complete measure.
- In commutative algebra, a commutative ring can be completed at an ideal (in the topology defined by the powers of the ideal). See Completion (ring theory).
- More generally, any topological group can be completed at a decreasing sequence of open subgroups.
- In statistics, a statistic is called complete if it does not allow an unbiased estimator of zero. See completeness (statistics).
- In graph theory, a complete graph is an undirected graph in which every pair of vertices has exactly one edge connecting them.
- In category theory, a category C is complete if every diagram from a small category to C has a limit; it is cocomplete if every such functor has a colimit.
- In order theory and related fields such as lattice and domain theory, completeness generally refers to the existence of certain suprema or infima of some partially ordered set. Notable special usages of the term include the concepts of complete Boolean algebra, complete lattice, and complete partial order (cpo). Furthermore, an ordered field is complete if every non-empty subset of it that has an upper bound within the field has a least upper bound within the field, which should be compared to the (slightly different) order-theoretical notion of bounded completeness. Up to isomorphism there is only one complete ordered field: the field of real numbers (but note that this complete ordered field, which is also a lattice, is not a complete lattice).
- In algebraic geometry, an algebraic variety is complete if it satisfies an analog of compactness. See complete algebraic variety.
- In quantum mechanics, a complete set of commuting operators (or CSCO) is one whose eigenvalues are sufficient to specify the physical state of a system.
Computing[edit]
- In algorithms, the notion of completeness refers to the ability of the algorithm to find a solution if one exists, and if not, to report that no solution is possible.
- In computational complexity theory, a problem P is complete for a complexity class C, under a given type of reduction, if P is in C, and every problem in C reduces to P using that reduction.
For example, each problem in the class NP-complete is complete for the class NP, under polynomial-time, many-one reduction.
- In computing, a data-entry field can autocomplete the entered data based on the prefix typed into the field; that capability is known as autocompletion.
- In software testing, completeness has for goal the functional verification of call graph (between software item) and control graph (inside each software item).
- The concept of completeness is found in knowledge base theory.
Economics, finance, and industry[edit]
- Complete markets versus incomplete markets
- In auditing, completeness is one of the financial statement assertions that have to be ensured. For example, auditing classes of transactions. Rental expense which includes 12-month or 52-week payments should be all booked according to the terms agreed in the tenancy agreement.
- Oil or gas well completion, the process of making a well ready for production.
Botany[edit]
- A complete flower is a flower with both male and female reproductive structures as well as petals and sepals. See Sexual reproduction in plants.
References[edit]
- ^ Hunter, Geoffrey, Metalogic: An Introduction to the Metatheory of Standard First-Order Logic, University of California Pres, 1971
UpToDate Contents
全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.
English Journal
- Graph-regularized dual Lasso for robust eQTL mapping.
- Cheng W, Zhang X, Guo Z, Shi Y, Wang W.
- Bioinformatics (Oxford, England).Bioinformatics.2014 Jun 15;30(12):i139-i148. doi: 10.1093/bioinformatics/btu293.
- MOTIVATION: As a promising tool for dissecting the genetic basis of complex traits, expression quantitative trait loci (eQTL) mapping has attracted increasing research interest. An important issue in eQTL mapping is how to effectively integrate networks representing interactions among genetic marker
- PMID 24931977
- The holist tradition in twentieth century genetics. Wilhelm Johannsen's genotype concept.
- Roll-Hansen N.
- The Journal of physiology.J Physiol.2014 Jun 1;592(Pt 11):2431-2438.
- The terms 'genotype', 'phenotype' and 'gene' originally had a different meaning from that in the Modern Synthesis. These terms were coined in the first decade of the twentieth century by the Danish plant physiologist Wilhelm Johannsen. His bean selection experiment and his theoretical analysis of th
- PMID 24882823
- City block distance and rough-fuzzy clustering for identification of co-expressed microRNAs.
- Paul S1, Maji P.
- Molecular bioSystems.Mol Biosyst.2014 Jun;10(6):1509-23. doi: 10.1039/c4mb00101j. Epub 2014 Mar 31.
- The microRNAs or miRNAs are short, endogenous RNAs having ability to regulate mRNA expression at the post-transcriptional level. Various studies have revealed that miRNAs tend to cluster on chromosomes. The members of a cluster that are in close proximity on chromosomes are highly likely to be proce
- PMID 24682049
Japanese Journal
- Numerical solver for first-principles transport calculation based on real-space finite-difference method
- Iwase Shigeru,Hoshi Takeo,Ono Tomoya
- Physical review E 91(6), 063305, 2015-06
- … The proposed scheme opens the possibility of performing large-scale RSFD-NEGF transport calculations using massively parallel computers without the loss of accuracy originating from the incompleteness of the localized basis set. …
- NAID 120005646537
- 個人档案に着目した中国のアーカイブ管理における現状と問題について
- 林 瓏
- レコード・マネジメント : 記録管理学会誌 (68), 35-45, 2015-03-23
- 本稿では中国の「個人档案」を中心に、個人档案に関わる法制度、運用の現状、問題点について概説する。「個人档案」は、中国の計画経済体制下において、個人の進学や就職、昇進などに利用され、中国国民の私生活にも関わる重要なものである。よって、本稿では個人档案の重要性、新卒者の個人档案・社員档案・流動人口の档案の「移交」・保存について、事例を挙げながらその詳細を示すこととする。まず、中国の行政区画に基づいた国 …
- NAID 110009923267
- 「ナガサキ」から「フクシマ」へ -本島等による「浦上燔祭説」の解釈をめぐる一考察-
- 菅原 潤
- 長崎大学総合環境研究 17(1), 19-30, 2014-10-01
- … Accounting for the thought of Gunther Anders, we can assert that the atomic bomb and Fukushima's catastrophe which the Promethean shamefulness (feeling ashamed of one's incompleteness in the face of the complete works that one has produced) produces crushes the humanism that has brought up this shamefulness over many years. …
- NAID 120005477107
Related Pictures