Switch to: References

Citations of:

Incompleteness of a first-order Gödel logic and some temporal logics of programs

In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15 (1996)

Add citations

You must login to add citations.
  1. Commodious axiomatization of quantifiers in multiple-valued logic.Reiner Hähnle - 1998 - Studia Logica 61 (1):101-121.
    We provide tools for a concise axiomatization of a broad class of quantifiers in many-valued logic, so-called distribution quantifiers. Although sound and complete axiomatizations for such quantifiers exist, their size renders them virtually useless for practical purposes. We show that for quantifiers based on finite distributive lattices compact axiomatizations can be obtained schematically. This is achieved by providing a link between skolemized signed formulas and filters/ideals in Boolean set lattices. Then lattice theoretic tools such as Birkhoff's representation theorem for finite (...)
    Export citation  
    Bookmark   2 citations