FPL may be equivalent to FO but not equivalent to PFP
| dc.creator | Shelah, Saharon | |
| dc.date | 2004-04-09 | |
| dc.date.accessioned | 2026-07-07T05:07:20Z | |
| dc.date.available | 2026-07-07T05:07:20Z | |
| dc.description | Given a class of finite models we would like to expand each model (allowing new elements but the old universe is a separate sort), making the expressive power of LFP (least fix point logic) and PFP (inductive logic) similar while not changing the expressive power of FO (first order logic). This continues in math.LO/9411235. | |
| dc.identifier | https://arxiv.org/abs/math/0404205 | |
| dc.identifier | http://arxiv.org/abs/math/0404205 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70819 | |
| dc.subject | Logic | |
| dc.title | FPL may be equivalent to FO but not equivalent to PFP | |
| dc.type | text |