Switch to: References

Add citations

You must login to add citations.
  1. ŁΠ logic with fixed points.Luca Spada - 2008 - Archive for Mathematical Logic 47 (7-8):741-763.
    We study a system, μŁΠ, obtained by an expansion of ŁΠ logic with fixed points connectives. The first main result of the paper is that μŁΠ is standard complete, i.e., complete with regard to the unit interval of real numbers endowed with a suitable structure. We also prove that the class of algebras which forms algebraic semantics for this logic is generated, as a variety, by its linearly ordered members and that they are precisely the interval algebras of real closed (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Note on witnessed Gödel logics with Delta.Matthias Baaz & Oliver Fasching - 2010 - Annals of Pure and Applied Logic 161 (2):121-127.
    Witnessed Gödel logics are based on the interpretation of () by minimum instead of supremum . Witnessed Gödel logics appear for many practical purposes more suited than usual Gödel logics as the occurrence of proper infima/suprema is practically irrelevant. In this note we characterize witnessed Gödel logics with absoluteness operator w.r.t. witnessed Gödel logics using a uniform translation.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • First-order Gödel logics.Richard Zach, Matthias Baaz & Norbert Preining - 2007 - Annals of Pure and Applied Logic 147 (1):23-47.
    First-order Gödel logics are a family of finite- or infinite-valued logics where the sets of truth values V are closed subsets of [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics GV (sets of those formulas which evaluate to 1 in every interpretation into V). It is shown that GV is axiomatizable iff V is finite, V is uncountable with 0 isolated in V, or every neighborhood of 0 in V is uncountable. Complete (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Gentzen Calculi for the Existence Predicate.Matthias Baaz & Rosalie Iemhoff - 2006 - Studia Logica 82 (1):7-23.
    We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.
    Download  
     
    Export citation  
     
    Bookmark   7 citations