Continuity, proof systems and the theory of transfinite computations
We use the theory of domains with totality to construct some logics generalizing [omega]-logic and [beta]-logic and we prove a completeness theorem for these logics. The key application is E-logic, the logic related to the functional 3E. We prove a compactness theorem for sets of sentences semicompu...
Gespeichert in:
Veröffentlicht in: | Archive for mathematical logic 2002-11, Vol.41 (8), p.765-788 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We use the theory of domains with totality to construct some logics generalizing [omega]-logic and [beta]-logic and we prove a completeness theorem for these logics. The key application is E-logic, the logic related to the functional 3E. We prove a compactness theorem for sets of sentences semicomputable in 3E. [PUBLICATION ABSTRACT] |
---|---|
ISSN: | 0933-5846 1432-0665 |
DOI: | 10.1007/s001530200138 |