Recursive logic frames
| dc.creator | Shelah, Saharon | |
| dc.creator | Väänänen, Jouko | |
| dc.date | 2004-05-01 | |
| dc.date.accessioned | 2026-07-07T05:07:52Z | |
| dc.date.available | 2026-07-07T05:07:52Z | |
| dc.description | We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive logic frame is called recursively (countably) compact, if every recursive (respectively, countable) finitely consistent theory has a model. We show that for logic frames built from the cardinality quantifiers ''there exists at least lambda'' recursive compactness always implies countable compactness. On the other hand we show that a recursively compact extension need not be countably compact. | |
| dc.identifier | https://arxiv.org/abs/math/0405016 | |
| dc.identifier | http://arxiv.org/abs/math/0405016 | |
| dc.identifier | MLQ Math. Log. Q. 52 No. 2 (2006) 151--164 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71033 | |
| dc.subject | Logic | |
| dc.title | Recursive logic frames | |
| dc.type | text |