Internalization: The case of hybrid logics

Journal of Logic and Computation

Volumn 11, Issue 5, 2001, Pages 671-689

  Seligman, J ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Cut elimination; Hybrid logic; Internalization; Modal logic; Proof theory; Sequent calculus; Subformula property

Indexed keywords

FORMAL LANGUAGES; GEOMETRY; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; THEOREM PROVING;

CUT ELIMINATION METHOD; HYBRID LOGICS; INTERNALIZATION; MODAL LOGIC; SEQUENT CALCULUS; SUBFORMULA PROPERTY;

FORMAL LOGIC;

EID: 0035485205     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/11.5.671     Document Type: Article

References (16)

1. The computational complexity of hybrid temporal logics
2. Hybrid logics: Characterization, interpolation and complexity
3. Internalizing labelled deduction
4. Hybrid languages
5. What are hybrid languages?
6. Hybrid languages and temporal logic
7. Sequent calculi for nominal tense logics: A step towards mechanization?
8. Cut-free display calculi for nominal tense logics
9. In the neighbourhood
10. A cut-free sequent calculus for elementary situated reasoning
11. Situated consequence in elementary situation theory
12. The logic of correct description
13. Proof theory for contextual reasoning
14. Tableaux calculi for hybrid logics