Natural deduction for first-order hybrid logic

Abstract
This is a companion paper to Braüner (2004b, Journal of Logic and Computation 14, 329–353) where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geometric theories. We prove soundness and completeness and we prove a normalisation theorem. Moreover, we give an axiom system first-order hybrid logic.
Keywords First-order hybrid logic  first-order modal logic  natural deduction
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,404
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Torben Braüner (2007). Why Does the Proof-Theory of Hybrid Logic Work so Well? Journal of Applied Non-Classical Logics 17 (4):521-543.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

9 ( #160,013 of 1,102,998 )

Recent downloads (6 months)

1 ( #297,567 of 1,102,998 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.