On the Undecidability of some Sub-Classical First-Order Logics

Authors:
Matthias Baaz;Agata Ciabattoni;Christian G. Fermüller;Helmut Veith
Affiliations:
-;-;-;-
Venue:
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1999

Citing 4
Cited 1

Linear logic

Theoretical Computer Science
The method of hypersequents in the proof theory of propositional non-classical logics

Logic: from foundations to applications
Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Bounded Contraction in Systems with Linearity

TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

Analytic Calculi for Monoidal T-norm Based Logic

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general criterion for the undecidabily of sub-classical first-order logics and important fragments thereof is established. It 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.