Resumé
Originalsprog  Engelsk 

Titel  Proceedings of Advances in Modal Logic 2016 
Redaktører  Lev Beklemishev, Stéphane Demri, András Máté 
Vol/bind  11 
Forlag  College Publications 
Publikationsdato  2016 
Sider  302321 
ISBN (Trykt)  9781848902015 
Status  Udgivet  2016 
Begivenhed  Advances in Modal Logic 2016  Eotvos University, Budapest, Ungarn Varighed: 30 aug. 2016 → 2 sep. 2016 http://phil.elte.hu/aiml2016/ (Link til konference) 
Konference
Konference  Advances in Modal Logic 2016 

Lokation  Eotvos University 
Land  Ungarn 
By  Budapest 
Periode  30/08/2016 → 02/09/2016 
Internetadresse 

Emneord
 Hybrid logic
 difference operator
 universal modality
 tense logic
 pure axioms
 Bridge rule
 synthetic completeness method
 Seligmanstyle
 tableaus
Citer dette
}
Synthetic Completeness Proofs for Seligmanstyle Tableau Systems. / Jørgensen, Klaus Frovin; Blackburn, Patrick Rowan; Bolander, Thomas; Braüner, Torben.
Proceedings of Advances in Modal Logic 2016. red. / Lev Beklemishev; Stéphane Demri; András Máté. Bind 11 College Publications, 2016. s. 302321.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review
TY  GEN
T1  Synthetic Completeness Proofs for Seligmanstyle Tableau Systems
AU  Jørgensen, Klaus Frovin
AU  Blackburn, Patrick Rowan
AU  Bolander, Thomas
AU  Braüner, Torben
PY  2016
Y1  2016
N2  Hybrid logic is a form of modal logic which allows reference to worlds. We can think of it as ‘modal logic with labelling built into the object language’ and various forms of labelled deduction have played a central role in its proof theory. Jerry Seligman’s work [11,12] in which ‘rules involving labels’ are rejected in favour of ‘rules for all’ is an interesting exception to this. Seligman’s approach was originally for natural deduction; the authors of the present paper recently extended it to tableau inference [1,2]. Our earlier work was syntactic: we showed completeness by translating between Seligmanstyle and labelled tableaus, but our results only covered the minimal hy brid logic; in the present paper we provide completeness results for a wider range of hybrid logics and languages. We do so by adapting the synthetic approach to tableau completeness (due to Smullyan, and widely applied in modal logic by Fitting) so that we can directly build maximal consistent sets of tableau blocks.
AB  Hybrid logic is a form of modal logic which allows reference to worlds. We can think of it as ‘modal logic with labelling built into the object language’ and various forms of labelled deduction have played a central role in its proof theory. Jerry Seligman’s work [11,12] in which ‘rules involving labels’ are rejected in favour of ‘rules for all’ is an interesting exception to this. Seligman’s approach was originally for natural deduction; the authors of the present paper recently extended it to tableau inference [1,2]. Our earlier work was syntactic: we showed completeness by translating between Seligmanstyle and labelled tableaus, but our results only covered the minimal hy brid logic; in the present paper we provide completeness results for a wider range of hybrid logics and languages. We do so by adapting the synthetic approach to tableau completeness (due to Smullyan, and widely applied in modal logic by Fitting) so that we can directly build maximal consistent sets of tableau blocks.
KW  Hybrid logic
KW  difference operator
KW  universal modality
KW  tense logic
KW  pure axioms
KW  Bridge rule
KW  synthetic completeness method
KW  Seligmanstyle
KW  tableaus
M3  Article in proceedings
SN  9781848902015
VL  11
SP  302
EP  321
BT  Proceedings of Advances in Modal Logic 2016
A2  Beklemishev, Lev
A2  Demri, Stéphane
A2  Máté, András
PB  College Publications
ER 