Wikipedia:WikiProject Mathematics/PlanetMath Exchange/03-XX Mathematical logic and foundations

Add links
From Wikipedia, the free encyclopedia

This page provides a list of all articles available at PlanetMath in the following topic:

03-XX Mathematical logic and foundations.

This list will be periodically updated. Each entry in the list has three fields:

  1. PM : The first field is the link to the PlanetMath article, along with the article's object ID.
  2. WP : The second field is either a "guessed" link to a correspondingly named Wikipedia article, produced by the script which generated the list, or one or more manually entered links to the corresponding Wikipedia articles on the subject.
  3. Status : The third field is the status field, which explains the current status of the entry. The recommended status entries are:
Status means PM article
N not needed
A adequately covered
C copied
M merged
NC needs copying
NM needs merging
  • Please update the WP and Status fields as appropriate.
  • if the WP field is correct please remove the qualifier "guess".
  • If the corresponding Wikipedia article exists, but the link to it is wrong, please fix the link.
  • If you copy or merge an article from PlanetMath, please update the WP and Status fields for that entry.
  • If you have any comments, for example, thoughts on how the PlanetMath article compares to the corresponding Wikipedia article(s), please place such comments on a new indented line following the entry. Comments of this kind are very valuable.

Don't forget to include the relevant template if you copy over text or feel like an external link is warranted

  • {{planetmath|id=|title=}} for copied over text
  • {{planetmath reference|id=|title=}} for an external link

See the main page for examples and usage criteria.

One can use the web-based program Pmform to convert PlanetMath articles to the Wikipedia format. As a side benefit, this tool will place the PlanetMath template for you.

03-00 General reference works (handbooks, dictionaries, bibliographies, etc.)[edit]

Needs to be reviewed: 2. Paul August ☎ 20:04, 27 May 2006 (UTC)[reply]
Copied the section "Colloquial Usage" from PM into WP article. Paul August ☎ 20:37, Feb 4, 2005 (UTC)
Paul August ☎ 15:03, Feb 2, 2005 (UTC)
Paul August ☎ 15:22, Feb 2, 2005 (UTC)
Actually the PM article is misnamed, it is really about "Cantor's Theorem". WP does not have an article about "Cantor's Paradox" but should. Paul August ☎ 02:21, Feb 3, 2005 (UTC)
Paul August ☎ 02:25, Feb 3, 2005 (UTC)
Paul August ☎ 02:43, Feb 3, 2005 (UTC)
Paul August ☎ 03:35, 10 October 2005 (UTC)[reply]
Paul August ☎ 03:08, Feb 3, 2005 (UTC)
Paul August ☎ 03:15, Feb 3, 2005 (UTC)
Paul August ☎ 21:27, August 25, 2005 (UTC)
Paul August ☎ 00:08, Feb 4, 2005 (UTC)
Paul August ☎ 00:10, Feb 4, 2005 (UTC)
Paul August ☎ 00:22, Feb 4, 2005 (UTC)
Paul August ☎ 00:22, Feb 4, 2005 (UTC)
Paul August ☎ 03:49, Feb 4, 2005 (UTC)
Paul August ☎ 03:49, Feb 4, 2005 (UTC)
PM article gives a definition of the integers as an equivalence class on NxN. Also conntains some additional algebraic properties: integral domain, ordered ring, valuation. Paul August ☎ 03:49, Feb 4, 2005 (UTC)
I would say this should go in a separate article, called say construction of integers. This in order to keep the integer page elementary. We will discuss this more. Oleg Alexandrov | talk 20:36, 5 Feb 2005 (UTC)
Well I've gone ahead and done the merging, including the bit on the construction from the natural numbers. If someone (Oleg?) wants to move this to its own article be my guest ;-) Paul August ☎ 20:38, 5 May 2006 (UTC)[reply]
Merged. Paul August ☎ 21:14, 5 May 2006 (UTC)[reply]
Paul August ☎ 22:17, 5 May 2006 (UTC)[reply]
Paul August ☎ 04:16, Feb 4, 2005 (UTC)
Paul August ☎ 04:32, Feb 4, 2005 (UTC)
Paul August ☎ 04:32, Feb 4, 2005 (UTC)
Paul August ☎ 01:13, 6 May 2006 (UTC)[reply]
Paul August ☎ 20:37, Feb 4, 2005 (UTC)
Paul August ☎ 20:57, Feb 4, 2005 (UTC)
Paul August ☎ 04:27, Feb 16, 2005 (UTC)
  • PM: pullback, id=4569 -- WP: none -- Status: N
I don't think we need this article. It seems really to be an article about function composition. I've never heard the term "pullback" used in this context. Paul August ☎ 15:28, 5 May 2006 (UTC)[reply]
Paul August ☎ 22:51, Feb 4, 2005 (UTC)
Paul August ☎ 15:38, 5 May 2006 (UTC)[reply]
The PM article contains a proposition and proof about the "signature of a permutation" which me may or may not want to include. Paul August ☎ 21:07, Feb 5, 2005 (UTC)
Paul August ☎ 04:06, 10 October 2005 (UTC)[reply]
Paul August ☎ 03:58, Feb 5, 2005 (UTC)
Paul August ☎ 03:58, Feb 5, 2005 (UTC)
Paul August ☎ 00:32, August 26, 2005 (UTC)
Paul August ☎ 03:58, Feb 5, 2005 (UTC)
Paul August ☎ 01:38, 6 May 2006 (UTC)[reply]
Paul August ☎ 01:38, 6 May 2006 (UTC)[reply]
Paul August ☎ 20:02, 27 May 2006 (UTC)[reply]
Paul August ☎ 18:25, 3 May 2006 (UTC)[reply]
  • PM: fix, id=8277new! -- WP guess: fix -- Status:

03A05 Philosophical and critical[edit]

All articles reviewed. Paul August ☎ 17:09, 7 May 2006 (UTC)[reply]
The PM article gives a better treatment for the historical development of the ideas of "axiom" and "postulate", which should be included in our article, in its own section called "Historical development". Paul August ☎ 17:09, 7 May 2006 (UTC)[reply]
I've now merged this content. Paul August ☎ 22:12, 9 May 2006 (UTC)[reply]

03B05 Classical propositional logic[edit]

NM: 1. Paul August ☎ 20:53, 27 May 2006 (UTC)[reply]
PM article is essentially empty. Paul August ☎ 03:50, Feb 6, 2005 (UTC)
Paul August ☎ 03:55, Feb 6, 2005 (UTC)
Paul August ☎ 04:56, Feb 6, 2005 (UTC)
Paul August ☎ 05:01, Feb 6, 2005 (UTC)
The PM article is empty. Paul August ☎ 05:10, Feb 6, 2005 (UTC)
Paul August ☎ 05:28, Feb 6, 2005 (UTC)
Paul August ☎ 05:34, Feb 6, 2005 (UTC)
Rich Farmbrough, 19:45 11 January 2007 (GMT).
Paul August ☎ 21:04, 27 May 2006 (UTC)[reply]
Paul August ☎ 21:22, 27 May 2006 (UTC)[reply]
Alba 21:54, 25 Feb 2005 (UTC)
Paul August ☎ 01:49, 6 May 2006 (UTC)[reply]
Paul August ☎ 23:12, 3 May 2006 (UTC)[reply]
Paul August ☎ 23:03, 3 May 2006 (UTC)[reply]

03B10 Classical first-order logic[edit]

NM: 4. Paul August ☎ 04:51, 6 October 2005 (UTC)[reply]
Needs to be reviewed: 25. Paul August ☎ 02:43, 28 May 2006 (UTC)[reply]
Paul August ☎ 18:33, Feb 6, 2005 (UTC)
Actually, this one needs more than a merge. Neither the WP article nor the PM article describes the arithmetical hierarchy on sets of reals, only on sets of naturals. They're pretty much the same thing from the descriptive set theoretic perspective, though not from the computability perspective. Article needs to be rewritten with the more inclusive descriptive set theory definitions, then the computability ones should be explained as consequences. --Trovatore 04:20, 6 October 2005 (UTC)[reply]
Paul August ☎ 01:50, 30 May 2006 (UTC)[reply]
Paul August ☎ 21:47, 27 May 2006 (UTC)[reply]
Paul August ☎ 20:37, Feb 6, 2005 (UTC)
Paul August ☎ 22:00, 27 May 2006 (UTC)[reply]
Currently first-order language is a redirect to first-order logic, which contains all this content, it could perhaps have its own article. Paul August ☎ 22:37, 28 May 2006 (UTC)[reply]
Paul August ☎ 03:41, 6 October 2005 (UTC)[reply]
Paul August ☎ 21:17, Feb 16, 2005 (UTC)
Paul August ☎ 21:36, Feb 16, 2005 (UTC)
copied by someone else. linas (talk) 22:31, 4 June 2008 (UTC)[reply]
Mathemens (talk) 22:16, 30 April 2008 (UTC) Someone has seemingly already covered this article. Changed status.[reply]
Paul August ☎ 03:22, 6 October 2005 (UTC)[reply]
Paul August ☎ 03:10, 6 October 2005 (UTC)[reply]
Paul August ☎ 03:54, Feb 13, 2005 (UTC)
Paul August ☎ 02:43, 28 May 2006 (UTC)[reply]
Paul August ☎ 23:10, 3 May 2006 (UTC)[reply]

03B15 Higher-order logic and type theory[edit]

Needs to be merged: 1. Paul August ☎ 05:17, Feb 17, 2005 (UTC)
Needs to be reviewed: 4. Paul August ☎ 05:17, Feb 17, 2005 (UTC)
PM article has erroneous title; we have the correct one. Our article still needs work. --Trovatore 05:00, 6 October 2005 (UTC)[reply]
Paul August ☎ 05:17, Feb 17, 2005 (UTC)

03B22 Abstract deductive systems[edit]

03B35 Mechanization of proofs and logical operations[edit]

03B40 Combinatory logic and lambda-calculus[edit]

Needs to be merged: 2. Paul August ☎ 04:50, Feb 17, 2005 (UTC)
Paul August ☎ 04:50, Feb 17, 2005 (UTC)
Paul August ☎ 04:45, Feb 17, 2005 (UTC)
Paul August ☎ 21:08, Feb 16, 2005 (UTC)

03B48 Probability and inductive logic[edit]

Needs to be merged: 1. Paul August ☎ 04:51, Feb 17, 2005 (UTC)
Paul August ☎ 04:10, Feb 13, 2005 (UTC)
Paul August ☎ 04:04, Feb 13, 2005 (UTC)

03B50 Many-valued logic[edit]

All articles processed. Paul August ☎ 05:10, Feb 17, 2005 (UTC)
Apparently deleted. See also neutrosophic probability in 60A10 Probabilistic measure theory. Ben Cairns 06:10, 3 Feb 2005 (UTC).

03B53 Logics admitting inconsistency (paraconsistent logics, discussive logics, etc.)[edit]

All articles processed. Paul August ☎ 05:11, Feb 17, 2005 (UTC)

03B60 Other nonclassical logic[edit]

All articles processed. Paul August ☎ 05:12, Feb 17, 2005 (UTC)

03B65 Logic of natural languages[edit]

03B70 Logic in computer science[edit]

03B99 Miscellaneous[edit]

Needs to be reviewed: 6. Paul August ☎ 03:01, 28 May 2006 (UTC)[reply]
Paul August ☎ 02:58, 28 May 2006 (UTC)[reply]
Paul August ☎ 03:01, 28 May 2006 (UTC)[reply]

03Bxx General logic[edit]

03C05 Equational classes, universal algebra[edit]

Needs to be reviewed: 6. Paul August ☎ 05:06, Feb 17, 2005 (UTC)

03C07 Basic properties of first-order languages and structures[edit]

Needs to be reviewed: 20. Paul August ☎ 05:04, 28 May 2006 (UTC)[reply]
NM: 2. Paul August ☎ 05:04, 28 May 2006 (UTC)[reply]
Paul August ☎ 05:04, 28 May 2006 (UTC)[reply]
in the "formal theory" section. CryptoDerk 20:18, Apr 30, 2005 (UTC)
  • PM: type, id=3913 -- WP guess: type -- Status:
Paul August ☎ 05:04, 28 May 2006 (UTC)[reply]

03C10 Quantifier elimination, model completeness and related topics[edit]

All articles processed. Paul August ☎ 05:23, Feb 17, 2005 (UTC)

03C15 Denumerable structures[edit]

Needs to be merged: 1. Paul August ☎ 05:27, Feb 17, 2005 (UTC)
Paul August ☎ 05:27, Feb 17, 2005 (UTC)

03C30 Other model constructions[edit]

All articles processed. Paul August ☎ 05:35, Feb 17, 2005 (UTC)

03C35 Categoricity and completeness of theories[edit]

Needs to be merged: 2. Paul August ☎ 05:42, Feb 17, 2005 (UTC)
Arthur Rubin 21:25, 22 August 2005 (UTC)[reply]
Paul August ☎ 05:42, Feb 17, 2005 (UTC)
Paul August ☎ 05:42, Feb 17, 2005 (UTC)

03C45 Classification theory, stability and related concepts[edit]

All articles processed. Paul August ☎ 05:43, Feb 17, 2005 (UTC)

03C50 Models with special properties (saturated, rigid, etc.)[edit]

Needs to be reviewed: 3. Paul August ☎ 05:46, Feb 17, 2005 (UTC)

03C52 Properties of classes of models[edit]

Needs to be reviewed: 1. Paul August ☎ 05:47, Feb 17, 2005 (UTC)

03C57 Effective and recursion-theoretic model theory[edit]

Needs to be reviewed: 1. Paul August ☎ 05:50, Feb 17, 2005 (UTC)

03C64 Model theory of ordered structures; o-minimality[edit]

Needs to be merged: 1. Paul August ☎ 05:57, Feb 17, 2005 (UTC)
Needs to be reviewed: 2. Paul August ☎ 05:57, Feb 17, 2005 (UTC)
Paul August ☎ 02:23, Feb 14, 2005 (UTC)

03C68 Other classical first-order model theory[edit]

Needs to be reviewed: 1. Paul August ☎ 05:58, Feb 17, 2005 (UTC)

03C80 Logic with extra quantifiers and operators[edit]

All articles processed. Paul August ☎ 05:58, Feb 17, 2005 (UTC)

03C90 Nonclassical models (Boolean-valued, sheaf, etc.)[edit]

All articles processed. Paul August ☎ 05:14, 28 May 2006 (UTC)[reply]
Paul August ☎ 05:14, 28 May 2006 (UTC)[reply]

03C95 Abstract model theory[edit]

All articles processed. Paul August ☎ 06:00, Feb 17, 2005 (UTC)

03C99 Miscellaneous[edit]

Needs to be merged: 5. Paul August ☎ 06:01, Feb 17, 2005 (UTC)
Paul August ☎ 01:27, Feb 14, 2005 (UTC)
A bit of notation could be merged. Paul August ☎ 01:37, Feb 14, 2005 (UTC)
Paul August ☎ 01:53, Feb 14, 2005 (UTC)
Or perhaps it could be copied to say: Model (model theory). Paul August ☎ 01:58, Feb 14, 2005 (UTC)
Paul August ☎ 02:00, Feb 14, 2005 (UTC)

03Cxx Model theory[edit]

03D05 Automata and formal grammars in connection with logical questions[edit]

Needs to be merged: 1. Paul August ☎ 19:58, Feb 16, 2005 (UTC)
Paul August ☎ 02:46, Feb 14, 2005 (UTC)

03D10 Turing machines and related notions[edit]

Needs to be merged: 4. Paul August ☎ 06:02, Feb 17, 2005 (UTC)
Paul August ☎ 02:34, Feb 14, 2005 (UTC)
Paul August ☎ 02:39, Feb 14, 2005 (UTC)
Paul August ☎ 03:08, Feb 14, 2005 (UTC)
Paul August ☎ 03:01, Feb 14, 2005 (UTC)

03D20 Recursive functions and relations, subrecursive hierarchies[edit]

Needs to be merged: 3. Paul August ☎ 06:24, Feb 17, 2005 (UTC)
Paul August ☎ 06:20, Feb 17, 2005 (UTC)
Paul August ☎ 06:24, Feb 17, 2005 (UTC)
Paul August ☎ 06:12, Feb 17, 2005 (UTC)
Paul August ☎ 06:18, Feb 17, 2005 (UTC)
Paul August ☎ 06:24, Feb 17, 2005 (UTC)

03D25 Recursively (computably) enumerable sets and degrees[edit]

Needs to be merged: 2. Paul August ☎ 19:59, Feb 17, 2005 (UTC)
Paul August ☎ 19:55, Feb 17, 2005 (UTC)
Paul August ☎ 19:59, Feb 17, 2005 (UTC)

03D40 Word problems, etc.[edit]

03D75 Abstract and axiomatic computability and recursion theory[edit]

All articles processed. Paul August ☎ 20:17, Feb 17, 2005 (UTC)
Paul August ☎ 20:11, Feb 17, 2005 (UTC)
Paul August ☎ 20:17, Feb 17, 2005 (UTC)

03D80 Applications of computability and recursion theory[edit]

03Dxx Computability and recursion theory[edit]

03E02 Partition relations[edit]

All articles processed. Paul August ☎ 00:05, August 23, 2005 (UTC)
Rich Farmbrough 22:43, 22 August 2005 (UTC)[reply]
This is related to but different from Golomb ruler. Paul August ☎ 20:36, Feb 17, 2005 (UTC)

03E04 Ordered sets and their cofinalities; pcf theory[edit]

Needs to be merged: 5. Paul August ☎ 04:53, Feb 18, 2005 (UTC)
Paul August ☎ 20:51, Feb 17, 2005 (UTC)
Paul August ☎ 20:51, Feb 17, 2005 (UTC)
Paul August ☎ 20:59, Feb 17, 2005 (UTC)
Paul August ☎ 04:24, Feb 18, 2005 (UTC)
Paul August ☎ 04:26, Feb 18, 2005 (UTC)
Paul August ☎ 04:53, Feb 18, 2005 (UTC)

03E05 Other combinatorial set theory[edit]

Needs to be merged: 3. Paul August ☎ 05:09, Feb 18, 2005 (UTC)
Needs to be reviewed: 8. Paul August ☎ 05:09, Feb 18, 2005 (UTC)
Paul August ☎ 04:57, Feb 18, 2005 (UTC)
Paul August ☎ 05:09, Feb 18, 2005 (UTC)
Paul August ☎ 05:09, Feb 18, 2005 (UTC)

03E10 Ordinal and cardinal numbers[edit]

NM: 14. Paul August ☎ 17:07, August 26, 2005 (UTC)
Needs to be reviewed: 11. Paul August ☎ 03:22, 28 May 2006 (UTC)[reply]
Mathemens (talk) 22:32, 30 April 2008 (UTC)[reply]
Paul August ☎ 05:32, Feb 18, 2005 (UTC)
Paul August ☎ 05:32, Feb 18, 2005 (UTC)
Paul August ☎ 15:10, Feb 18, 2005 (UTC)
Paul August ☎ 15:30, Feb 18, 2005 (UTC)
Paul August ☎ 15:46, Feb 18, 2005 (UTC)
Paul August ☎ 15:48, Feb 18, 2005 (UTC)
Paul August ☎ 15:56, Feb 18, 2005 (UTC)
Paul August ☎ 15:58, Feb 18, 2005 (UTC)
Paul August ☎ 16:07, Feb 18, 2005 (UTC)
Paul August ☎ 16:12, Feb 18, 2005 (UTC)
Paul August ☎ 01:04, August 26, 2005 (UTC)
Paul August ☎ 16:46, Feb 18, 2005 (UTC)
Porcher 17:06, 3 Apr 2005 (UTC)
Porcher 16:56, 3 Apr 2005 (UTC)
Paul August ☎ 18:32, Feb 18, 2005 (UTC)
Paul August ☎ 22:05, Feb 19, 2005 (UTC)
Paul August ☎ 22:07, Feb 19, 2005 (UTC)
This PM article along with the PM article "Proof of Fordor's lemma" has been copied to Fodor's lemma and mildly edited. Porcher 16:55, 1 Apr 2005 (UTC)
Paul August ☎ 20:26, Feb 20, 2005 (UTC)
Paul August ☎ 16:02, Mar 13, 2005 (UTC)
The PM article has a proof of the theorem. Paul August ☎ 21:05, Feb 20, 2005 (UTC)
Paul August ☎ 21:12, Feb 20, 2005 (UTC)
Paul August ☎ 21:20, Feb 20, 2005 (UTC)
Paul August ☎ 03:26, Mar 13, 2005 (UTC)
Paul August ☎ 03:20, Mar 13, 2005 (UTC)
Paul August ☎ 03:30, Mar 13, 2005 (UTC)
Paul August ☎ 03:34, Mar 13, 2005 (UTC)
This PM article along with the PM article "Fordor's lemma" has been copied to Fodor's lemma and mildly edited. Porcher 16:58, 1 Apr 2005 (UTC)
The PM proof is more detailed and could perhaps be merged. Paul August ☎ 04:03, Mar 13, 2005 (UTC)
The PM proof is actually just plain different. I added a link to the WP article, that should suffice. linas 04:42, 24 November 2006 (UTC)[reply]
Paul August ☎ 04:09, Mar 13, 2005 (UTC)
This proof could be merged into Countable set. Paul August ☎ 15:07, Mar 13, 2005 (UTC)
Paul August ☎ 04:03, Mar 13, 2005 (UTC)
The PM article contains a generalization of sequence to a function whose domain is any ordinal, not just N. Paul August ☎ 20:13, Mar 13, 2005 (UTC)
This article has been copied prom the PM original and classified as a stub. Porcher 17:09, 1 Apr 2005 (UTC)
This article no longer uses any PM text, so I've changed the status to "A". Paul August ☎ 16:05, 21 February 2006 (UTC)[reply]
Paul August ☎ 02:45, Mar 14, 2005 (UTC)
Paul August ☎ 03:58, Mar 14, 2005 (UTC)
The PM article uses the term "von Neumann integer", not used in WP. Paul August ☎ 03:05, Mar 14, 2005 (UTC)
The PM article uses the term "von Neumann ordinal", not used in WP. Paul August ☎ 03:05, Mar 14, 2005 (UTC)

03E15 Descriptive set theory[edit]

… (former caveats have been rectified by Determinacy article) --Trovatore 03:17, 7 September 2005 (UTC)[reply]
Mathemens (talk) 22:34, 30 April 2008 (UTC)[reply]
Paul August ☎ 05:29, 28 May 2006 (UTC)[reply]

03E17 Cardinal characteristics of the continuum[edit]

All articles processed. Paul August ☎ 03:37, Mar 14, 2005 (UTC)

03E20 Other classical set theory (including functions, relations, and set algebra)[edit]

Needs to be merged: 15. Paul August ☎ 17:03, August 25, 2005 (UTC)
Needs to be copied: 2. Paul August ☎ 17:03, August 25, 2005 (UTC)
Paul August ☎ 00:48, August 27, 2005 (UTC)
The PM article gives some finite examples, and gives fromulas for the number of relations and antisymmetric relations on a set with n elements. This content could be included, but I'm not sure it needs to be. Paul August ☎ 14:37, Mar 15, 2005 (UTC)
The PM articles content is covered in complex analysis, real part and imaginary part. We could, however, make complex function its own article. Paul August ☎ 13:45, Mar 17, 2005 (UTC)
Paul August ☎ 04:54, Mar 18, 2005 (UTC)
This topic is related to Matroids. Paul August ☎ 16:50, August 25, 2005 (UTC)
The only article linking to dependence relation is on using the term in a way that suggests redirecting to statistical independence, not the concept occuring in matroid theory. Should this become a disambiguation page? Michael Hardy 20:49, August 31, 2005 (UTC)
Perhaps, I don't know much about this. Paul August ☎ 22:54, August 31, 2005 (UTC)
Paul August ☎ 05:06, Mar 18, 2005 (UTC)
The PM article contains the more general notion of domain of a relation. Paul August ☎ 01:02, Apr 23, 2005 (UTC)
Paul August ☎ 01:56, August 27, 2005 (UTC)
Paul August ☎ 01:12, Apr 23, 2005 (UTC)
Paul August ☎ 02:26, Apr 23, 2005 (UTC)
Paul August ☎ 16:15, Apr 23, 2005 (UTC)
Paul August ☎ 02:59, August 27, 2005 (UTC)
Paul August ☎ 16:27, August 25, 2005 (UTC)
Paul August ☎ 03:41, Apr 29, 2005 (UTC)
Paul August ☎ 13:23, August 5, 2005 (UTC)
Paul August ☎ 18:34, August 8, 2005 (UTC)
Paul August ☎ 20:37, Apr 23, 2005 (UTC)
Paul August ☎ 15:38, August 5, 2005 (UTC)
Paul August ☎ 01:32, August 16, 2005 (UTC)
PM article is just a definition, but Mathworld has a nice article. Paul August ☎ 01:33, August 28, 2005 (UTC)
Paul August ☎ 17:45, August 7, 2005 (UTC)
Paul August ☎ 17:50, August 7, 2005 (UTC)
Paul August ☎ 17:55, August 7, 2005 (UTC)
I think the WP article needs some work though. Paul August ☎ 18:12, August 7, 2005 (UTC)
Or perhaps merged with the PM article right function notation (below) into it's own article say function notation. Paul August ☎ 16:14, August 25, 2005 (UTC)
PM defines level set as a synonym of fiber. Our article has a more restrictive definition. I don't know which is more correct, but this should be reconciled, and if the fiber definition is common, it should be mentioned in our article. Paul August ☎ 16:13, August 8, 2005 (UTC)
Paul August ☎ 19:05, August 7, 2005 (UTC)
Paul August ☎ 19:41, August 7, 2005 (UTC)
Paul August ☎ 19:48, August 7, 2005 (UTC)
Paul August ☎ 20:34, August 7, 2005 (UTC)
partial mapping redirects to partial function. The PM article is about an entirely different thing, which should probably be merged into WP in some form. Paul August ☎ 16:13, August 8, 2005 (UTC)
Paul August ☎ 19:41, August 7, 2005 (UTC)
Paul August ☎ 17:18, August 8, 2005 (UTC)
NC changed to A, its now in WP of its own accord. linas 04:49, 24 November 2006 (UTC)[reply]
This proof might (or might not) be useful. Paul August ☎ 16:13, August 8, 2005 (UTC)
Paul August ☎ 17:28, August 8, 2005 (UTC)
Paul August ☎ 03:25, Apr 29, 2005 (UTC)
The PM article defines the more general notion of range of a relation. Paul August ☎ 19:27, August 8, 2005 (UTC)
Paul August ☎ 19:39, August 8, 2005 (UTC)
Paul August ☎ 20:03, August 8, 2005 (UTC)
Paul August ☎ 21:07, August 10, 2005 (UTC)
Or perhaps merged with the PM article left function notation (above) into it's own article say function notation. Paul August ☎ 16:14, August 25, 2005 (UTC)
Paul August ☎ 19:06, May 20, 2005 (UTC)
Paul August ☎ 01:39, August 16, 2005 (UTC)
Paul August ☎ 01:51, August 16, 2005 (UTC)
Paul August ☎ 16:18, August 25, 2005 (UTC)
Paul August ☎ 01:59, August 16, 2005 (UTC)
Paul August ☎ 03:38, August 25, 2005 (UTC)
Paul August ☎ 03:41, August 25, 2005 (UTC)
PM gives a construction of the transitive closure of a set and our article should probably include one, but I'm not sure that the PM one is correct. Paul August ☎ 15:58, August 25, 2005 (UTC)
I wrote a new article inspired by the PM article. Oleg Alexandrov (talk) 01:49, 21 July 2006 (UTC)[reply]

03E25 Axiom of choice and related propositions[edit]

Paul August ☎ 20:37, August 28, 2005 (UTC)
Paul August ☎ 21:42, August 28, 2005 (UTC)
Paul August ☎ 00:24, August 29, 2005 (UTC)
Needs to be copied or merged into some article, not sure where. linas 02:36, 8 April 2007 (UTC)[reply]
Zorn's lemma has a sketch of a proof that AC implies Zorn, I think it would be good to include the reverse implication. Paul August ☎ 04:07, August 31, 2005 (UTC)
PM has a proof using Zorn's lemma, which would be good to include. Paul August ☎ 04:45, August 31, 2005 (UTC)
Changed from NM to A, as I just added text that is more or less equivalent, I think. linas 02:18, 8 April 2007 (UTC)[reply]
Paul August ☎ 20:20, August 31, 2005 (UTC)
Paul August ☎ 20:29, August 31, 2005 (UTC)
Paul August ☎ 02:51, 18 August 2009 (UTC)[reply]
Paul August ☎ 19:45, August 31, 2005 (UTC)
Paul August ☎ 04:01, August 31, 2005 (UTC)

03E30 Axiomatics of classical set theory and its fragments[edit]

Paul August ☎ 04:17, Apr 29, 2005 (UTC)
Paul August ☎ 02:35, 8 May 2006 (UTC)[reply]
Paul August ☎ 01:31, September 4, 2005 (UTC)
Paul August ☎ 19:09, 14 September 2005 (UTC)[reply]
Paul August ☎ 02:30, 8 May 2006 (UTC)[reply]
Paul August ☎ 02:26, 15 September 2005 (UTC)[reply]

03E35 Consistency and independence results[edit]

03E40 Other aspects of forcing and Boolean-valued models[edit]

03E45 Inner models, including constructibility, ordinal definability, and core models[edit]

03E50 Continuum hypothesis and Martin's axiom[edit]

Trovatore 15:25, 30 August 2005 (UTC)[reply]
Paul August ☎ 01:44, 11 October 2005 (UTC)[reply]
Paul August ☎ 00:32, 11 October 2005 (UTC)[reply]

03E55 Large cardinals[edit]

Trovatore 15:02, 30 August 2005 (UTC)[reply]

03E65 Other hypotheses and axioms[edit]

03E70 Nonclassical and second-order set theories[edit]

All articles processed. Paul August ☎ 05:46, 28 May 2006 (UTC)[reply]
Apparently a deleted article. See also neutrosophic probability in 60A10 Probabilistic measure theory. Ben Cairns 06:07, 3 Feb 2005 (UTC).
A somewhat eccentric notion of Florentin Smarandache. Paul August ☎ 05:46, 28 May 2006 (UTC)[reply]

03E72 Fuzzy set theory[edit]

03E75 Applications of set theory[edit]

03E99 Miscellaneous[edit]

Paul August ☎ 04:21, Feb 13, 2005 (UTC)
Paul August ☎ 04:26, Feb 13, 2005 (UTC)
Paul August ☎ 04:30, Feb 13, 2005 (UTC)
Paul August ☎ 04:32, Feb 13, 2005 (UTC)
Paul August ☎ 04:38, Feb 13, 2005 (UTC)
Paul August ☎ 04:44, Feb 13, 2005 (UTC)
Article helps the understanding of Fodor's lemma and club filter, so I copied and edited it; Porcher 17:25, 1 Apr 2005 (UTC)
In fact the MP article should replace (almost) our article. Paul August ☎ 05:03, Feb 13, 2005 (UTC)
Paul August ☎ 05:22, Feb 13, 2005 (UTC)
Paul August ☎ 05:30, Feb 13, 2005 (UTC)
The more common term (in my experience) is "filter base".Paul August ☎ 21:08, Feb 14, 2005 (UTC)
Paul August ☎ 21:14, Feb 14, 2005 (UTC)
Paul August ☎ 21:22, Feb 14, 2005 (UTC)
Paul August ☎ 21:26, Feb 14, 2005 (UTC)
Paul August ☎ 21:30, Feb 14, 2005 (UTC)
Paul August ☎ 21:48, Feb 14, 2005 (UTC)
  • PM: set, id=1635 -- WP: set -- Status: A
Paul August ☎ 22:09, Feb 14, 2005 (UTC)
Paul August ☎ 01:54, Feb 15, 2005 (UTC)
Paul August ☎ 02:00, Feb 15, 2005 (UTC)
Paul August ☎ 02:26, 8 May 2006 (UTC)[reply]

03Exx Set theory[edit]

03F03 Proof theory, general[edit]

Paul August ☎ 02:11, Feb 15, 2005 (UTC)
Paul August ☎ 02:38, 21 September 2005 (UTC)[reply]

03F07 Structure of proofs[edit]

03F15 Recursive ordinals and ordinal notations[edit]

03F20 Complexity of proofs[edit]

03F30 First-order arithmetic and fragments[edit]

Paul August ☎ 19:16, 6 January 2006 (UTC)[reply]
Jeekc 11:50, 12 November 2005 (UTC)[reply]

03F35 Second- and higher-order arithmetic and fragments[edit]

NM: 1. Paul August ☎ 05:10, 31 May 2006 (UTC)[reply]
Paul August ☎ 05:10, 31 May 2006 (UTC)[reply]
Paul August ☎ 05:10, 31 May 2006 (UTC)[reply]
Paul August ☎ 04:07, 31 May 2006 (UTC)[reply]
Paul August ☎ 21:36, 4 October 2005 (UTC)[reply]
The axiom of induction (or induction axiom) in its various forms is described in WP in several places: Peano axioms, second-order arithmetic, Kripke–Platek set theory, number system, but it should have its own article.

03F55 Intuitionistic mathematics[edit]

Paul August ☎ 03:56, 31 May 2006 (UTC)[reply]

03F60 Constructive and recursive analysis[edit]

NC: 1. Mathemens (talk) 22:46, 30 April 2008 (UTC)[reply]
Mathemens (talk) 22:46, 30 April 2008 (UTC)[reply]
Paul August ☎ 20:42, 29 May 2006 (UTC)[reply]

03Fxx Proof theory and constructive mathematics[edit]

03G05 Boolean algebras[edit]

All articles processed. Paul August ☎ 05:37, 28 May 2006 (UTC)[reply]
CryptoDerk 15:56, Apr 30, 2005 (UTC)
Paul August ☎ 05:37, 28 May 2006 (UTC)[reply]

03G10 Lattices and related structures[edit]

All articles processed. Paul August ☎ 20:43, Apr 30, 2005 (UTC)
CryptoDerk 15:52, Apr 30, 2005 (UTC)
CryptoDerk 15:51, Apr 30, 2005 (UTC)
CryptoDerk 15:50, Apr 30, 2005 (UTC)

03G12 Quantum logic[edit]

03G20 Lukasiewicz and Post algebras[edit]

03G25 Other algebras related to logic[edit]

03G30 Categorical logic, topoi[edit]

  • PM: topos, id=8796new! -- WP guess: topos -- Status:

03G99 Miscellaneous[edit]

NM: 4. Paul August ☎ 20:24, 29 May 2006 (UTC)[reply]
Paul August ☎ 20:24, 29 May 2006 (UTC)[reply]
Paul August ☎ 20:24, 29 May 2006 (UTC)[reply]
Paul August ☎ 20:24, 29 May 2006 (UTC)[reply]
Paul August ☎ 20:24, 29 May 2006 (UTC)[reply]
Paul August ☎ 20:24, 29 May 2006 (UTC)[reply]

03Gxx Algebraic logic[edit]

03H05 Nonstandard models in mathematics[edit]

03Hxx Nonstandard models[edit]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Wikipedia:WikiProject_Mathematics/PlanetMath_Exchange/03-XX_Mathematical_logic_and_foundations&oldid=1136065051"