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.
MUltlog 1.0: Towards an Expert System for Many-Valued Logics
MUltlog is a system which takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and a calculus for transforming a many-valued formula to clauses suitable for many-valued resolution. All generated rules are optimized regarding their branching degree. The output is in the form of a scientific paper, written in LATEX.
Net Spaces in Categorical Topology a
In the paper we introduce the notion of S‐nets, S a nonempty construct, as a generalization of the usual nets. S‐net spaces and continuous maps between them are then defined in a natural way. For S‐net spaces we introduce a number of axioms and study the categories obtained. We find some topological and Cartesian closed categories of S‐net spaces and describe their relations to certain known topological categories.