Electronic filter topology: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
No edit summary
en>Sasuke Sarutobi
m Changed from refimprove to more footnotes
 
Line 1: Line 1:
'''Tarski–Grothendieck set theory''' ('''TG''', named after mathematicians [[Alfred Tarski]] and [[Alexander Grothendieck]]) is an [[axiomatic set theory]] that was introduced as part of the [[Mizar system]] for formal verification of proofs.
Marvella is what you can contact her but it's not the most female name out there. For many years he's been operating as a receptionist. California is our birth place. What I love performing is performing ceramics but I haven't made a dime with it.<br><br>Here is my web site - std testing at home, [http://www.ddhelicam.com/board_Kurr59/59568 click the following document],
 
Tarski–Grothendieck set theory  is a [[non-conservative extension]] of [[Zermelo–Fraenkel set theory]] (ZFC) and is distinguished from other axiomatic set theories by the inclusion of '''Tarski's axiom''' which states that for each set there is a [[Grothendieck universe]] it belongs to (see below). Tarski's axiom implies the existence of [[inaccessible cardinal]]s, providing a richer [[ontology]] than that of conventional set theories such as ZFC.
 
==Axioms==
 
While the [[axiom]]s and [[definition]]s defining Mizar's basic objects and processes are fully [[Formal system|formal]], they are described informally below.
 
* Given any set <math>A</math>, the singleton <math>\{A\}</math> exists.
* Given any two sets, their unordered and ordered pairs exist.
* Given any family of sets, its union exists.
 
'''TG''' includes the following axioms, which are conventional because also part of [[ZFC]]:
* Set axiom:  Quantified variables range over sets alone; everything is a set (the same [[ontology]] as [[ZFC]]).
* [[Extensionality]] axiom:  Two sets are identical if they have the same members.
* [[Axiom of regularity]]:  No set is a member of itself, and circular chains of membership are impossible.
* [[Axiom schema of replacement]]: Let the [[domain (mathematics)|domain]] of the [[function (mathematics)|function]] <math>F</math> be the set <math>A</math>. Then the [[range (mathematics)|range]] of <math>F</math> (the values of <math>F(x)</math> for all members <math>x</math> of <math>A</math>) is also a set.
 
It is Tarski's axiom that distinguishes '''TG''' from other axiomatic set theories. Tarski's axiom also implies the axioms of [[axiom of infinity|infinity]], [[axiom of choice|choice]],<ref>Tarski (1938)</ref><ref>http://mmlquery.mizar.org/mml/current/wellord2.html#T26</ref> and [[axiom of power set|power set]].<ref>Robert Solovay, [http://www.cs.nyu.edu/pipermail/fom/2008-March/012783.html Re: AC and strongly inaccessible cardinals].</ref><ref>[http://us.metamath.org/mpegif/grothpw.html Metamath '''grothpw'''.]</ref> It also implies the existence of [[inaccessible cardinal]]s, thanks to which the [[ontology]] of '''TG''' is much richer than that of conventional set theories such as [[ZFC]].
 
* '''Tarski's axiom''' (adapted from Tarski 1939<ref>Tarski (1939)</ref>). For every set <math>x</math>, there exists a set <math>y</math> whose members include:
 
- <math>x</math> itself;
 
- every subset of every member of <math>y</math>;
 
- the power set of every member of <math>y</math>;
 
- every subset of <math>y</math> of [[cardinality]] less than that of <math>y</math>.
 
More formally:
 
:<math>\exists y [x\in y \wedge \forall z\in y(\mathcal P(z)\subseteq y\wedge\mathcal P(z)\in y) \wedge \forall z\in\mathcal P(y)(\neg z\approx y\to z\in y)]</math>
 
where "<math>\mathcal P(x)</math>" denotes the power class of ''x'' and "<math>\approx</math>" denotes [[equinumerosity]]. What Tarski's axiom states (in the vernacular) for each set <math>x</math> there is a [[Grothendieck universe]] it belongs to.
 
==Implementation in the Mizar system==
 
The Mizar language, underlying the implementation of '''TG''' and providing its logical syntax, is typed and the types are assumed to be non-empty. Hence, the theory is implicitly taken to be [[Axiom of empty set|non-empty]]. The existence axioms, e.g. the existence of the unordered pair, is also implemented indirectly by the definition of term constructors.
 
The system includes equality, the membership predicate and the following standard definitions:
* [[Singleton (mathematics)|Singleton]]:  A set with one member;
* [[Unordered pair]]:  A set with two distinct members. <math>\{a,b\} = \{b,a\}</math>;
* [[Ordered pair]]:  The set <math>\{\{a,b\},\{a\}\} = (a,b) \neq (b,a)</math>;
* [[Subset]]:  A set all of whose members are members of another given set;
* The [[union (set theory)|union]] of a family of sets <math>Y</math>:  The set of all members of every member of <math>Y</math>.
 
==See also==
*[[Mizar system]]
*[[Grothendieck universe]]
*[[Axiom of limitation of size]]
 
==Notes==
<references/>
 
==References==
*Andreas Blass, I.M. Dimitriou, and [[Benedikt Löwe]] (2007) "[http://dare.uva.nl/document/25381 Inaccessible Cardinals without the Axiom of Choice,]" ''Fundamenta Mathematicae'' 194: 179-89.
* {{cite conference
| first = Nicolas
| last = Bourbaki
| authorlink = Nicolas Bourbaki
| year = 1972
| title = Univers
| booktitle = Séminaire de Géométrie Algébrique du Bois Marie – 1963-64 – Théorie des topos et cohomologie étale des schémas – (SGA 4) – vol. 1 (Lecture notes in mathematics '''269''')
| editor = [[Michael Artin]], [[Alexandre Grothendieck]], [[Jean-Louis Verdier]], eds.
| publisher = [[Springer Science+Business Media|Springer-Verlag]]
| location = Berlin; New York
| language = French
| pages = 185&ndash;217
| url = http://modular.fas.harvard.edu/sga/sga/4-1/4-1t_185.html
}}
* [[Patrick Suppes]] (1960) ''Axiomatic Set Theory''. Van Nostrand. Dover reprint, 1972.
* {{cite journal
| last = Tarski
| first = Alfred
| authorlink = Alfred Tarski
| year = 1938
| title = Über unerreichbare Kardinalzahlen
| journal = Fundamenta Mathematicae
| volume = 30
| pages = 68&ndash;89
| url = http://matwbn.icm.edu.pl/ksiazki/fm/fm30/fm30113.pdf
}}
* {{cite journal
| last = Tarski
| first = Alfred
| authorlink = Alfred Tarski
| year = 1939
| title = On the well-ordered subsets of any set
| journal = Fundamenta Mathematicae
| volume = 32
| pages = 176&ndash;183
| url = http://matwbn.icm.edu.pl/ksiazki/fm/fm32/fm32115.pdf
}}
 
==External links==
*Trybulec, Andrzej, 1989, "[http://mizar.uwb.edu.pl/JFM/Axiomatics/tarski.html Tarski–Grothendieck Set Theory]", ''Journal of Formalized Mathematics''.
*[[Metamath]]: "[http://us.metamath.org/mpegif/mmset.html Proof Explorer Home Page.]" Scroll down to "Grothendieck's Axiom."
* [[PlanetMath]]: "[http://planetmath.org/encyclopedia/TarskisAxiom.html Tarski's Axiom]"
 
{{DEFAULTSORT:Tarski-Grothendieck set theory}}
[[Category:Systems of set theory]]

Latest revision as of 20:28, 8 November 2014

Marvella is what you can contact her but it's not the most female name out there. For many years he's been operating as a receptionist. California is our birth place. What I love performing is performing ceramics but I haven't made a dime with it.

Here is my web site - std testing at home, click the following document,