A Strong Completeness Theorem for the Gentzen systems associated with finite algebras
ABSTRACT In this paper we study consequence relations on the set of many sided sequents over a propositional language. We deal with the consequence relations axiomatized by the sequent calculi defined in [2] and associated with arbitrary finite algebras. These consequence relations are examples of what we call Gentzen systems. We define a semantics for these systems and prove a Strong Completeness Theorem, which is an extension of the Completeness Theorem for provable sequents stated in [2]. For the special case of the finite linear MV-algebras, the Strong Completeness Theorem was proved in [10], as a consequence of McNaughton's Theorem. The main tool to prove this result for arbitrary algebras is the deduction-detachment theorem for Gentzen systems.
Generic Decision Procedures for Many-valued Logics
Remark. The regulations for Acciones Integradas are different in Austria and Spain. In Austria, the application is for one year with the possibility to prolong for another year; in Spain, the application is for two years from the outset. Since this project is laid out as a two-years enterprise and our Spanish partners need it anyway, this proposal describes the activities planned for both years.
A new class of numerical sequences and its applications to sine and cosine series
First, it is proved that the class of classical quasi-monotone sequences is not comparable to the newly defined class of sequences of ‘rest bounded variation’. Considering this result, we prove three sample theorems for sequences of rest bounded variation, being analogues of the theorems proved earlier for monotone or quasi-monotone sequences. One of them gives a partial answer to a question raised by R. P. Boas Jr.