Timeline for Pullbacks for primitive recursive functions.
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25, 2010 at 18:02 | history | edited | Joel David Hamkins | CC BY-SA 2.5 |
edited body; added 2 characters in body
|
| Feb 25, 2010 at 17:58 | vote | accept | Doctor Gibarian | ||
| Feb 25, 2010 at 17:57 | vote | accept | Doctor Gibarian | ||
| Feb 25, 2010 at 17:57 | |||||
| Feb 25, 2010 at 17:38 | history | edited | Joel David Hamkins | CC BY-SA 2.5 |
added 674 characters in body; added 9 characters in body; edited body
|
| Feb 25, 2010 at 17:35 | comment | added | Doctor Gibarian | Yes, you can construct that diagram and that (prim rec) set but not to do it with all pair of functions. So that category has not pullbacks, as Reid Barton explains below. I was not sure about it. Thank you to all. | |
| Feb 25, 2010 at 17:11 | history | answered | Joel David Hamkins | CC BY-SA 2.5 |