More on regular reduced products
| dc.creator | Kennedy, Juliette | |
| dc.creator | Shelah, Saharon | |
| dc.date | 2005-04-10 | |
| dc.date.accessioned | 2026-07-07T05:18:58Z | |
| dc.date.available | 2026-07-07T05:18:58Z | |
| dc.description | The authors show, by means of a finitary version square^{fin}_{lambda,D} of the combinatorial principle square^{b^*}_{lambda}, the consistency of the failure, relative to the consistency of supercompact cardinals, of the following: for all regular filters D on a cardinal lambda, if M_i and N_i are elementarily equivalent models of a language of size <= lambda, then the second player has a winning strategy in the Ehrenfeucht-Fraisse game of length lambda^+ on prod_i M_i/D and prod_i N_i/D. If in addition 2^{lambda}= lambda^+ and i<lambda implies |M_i|+|N_i| <= lambda^+ this means that the ultrapowers are isomorphic. | |
| dc.identifier | https://arxiv.org/abs/math/0504200 | |
| dc.identifier | http://arxiv.org/abs/math/0504200 | |
| dc.identifier | J. Symbolic Logic 69 No. 4 (2004) 1261--1266 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/74850 | |
| dc.subject | Logic | |
| dc.title | More on regular reduced products | |
| dc.type | text |