Timeline for Undecidable completion of undecidable theory, and pairs of RCF
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2010 at 19:18 | vote | accept | Artem Chernikov | ||
| Aug 4, 2010 at 19:18 | vote | accept | Artem Chernikov | ||
| Aug 4, 2010 at 19:18 | |||||
| Aug 4, 2010 at 19:17 | vote | accept | Artem Chernikov | ||
| Aug 4, 2010 at 19:18 | |||||
| Aug 4, 2010 at 10:10 | comment | added | Artem Chernikov | Dear Mariano, given a real closed field $F$ and a proper elementary extension $G \succ F$ we consider the structure $(G,F)$ in the language of RCF expanded by a new predicate naming F inside G - this is an elementary pair. Now the theory of pairs of real closed fields is an (incomplete) theory satisfied by all such structures, and what I am asking for is to find a particular pair $(G,F)$ such that $Th(G,F)$ is undecidable. | |
| Aug 4, 2010 at 1:24 | comment | added | Mariano Suárez-Álvarez | WHat is the theory of a pair of real closed fields? | |
| Aug 4, 2010 at 0:56 | answer | added | Dave Marker | timeline score: 5 | |
| Aug 3, 2010 at 23:54 | answer | added | Noah Schweber | timeline score: 5 | |
| Aug 3, 2010 at 22:50 | answer | added | Gabriel Ebner | timeline score: 2 | |
| Aug 3, 2010 at 22:39 | history | edited | Artem Chernikov | CC BY-SA 2.5 |
added 211 characters in body; edited title
|
| Aug 3, 2010 at 22:27 | history | asked | Artem Chernikov | CC BY-SA 2.5 |