On the undecidability of some sub-classical first-order logics

Matthias Baaz; Agata Ciabattoni; Christian Fermüller; Helmut Veith

Conference Proceedings

On the undecidability of some sub-classical first-order logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1738 258-268

DOI: 10.1007/3-540-46691-6_20

3Citations

3Readers

Get full text

Abstract

A general criterion for the undecidabily of sub-classical firstorder logics and important fragments thereof is established.I t is applied, among others, to Urquart’s (original version of) C and the closely related logic C*.In addition, hypersequent systems for (first-order) C and C* are introduced and shown to enjoy cut-elimination. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Baaz, M., Ciabattoni, A., Fermüller, C., & Veith, H. (1999). On the undecidability of some sub-classical first-order logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1738, pp. 258–268). Springer Verlag. https://doi.org/10.1007/3-540-46691-6_20

On the undecidability of some sub-classical first-order logics

Abstract

Cite

Register to see more suggestions