Switch to: References

Add citations

You must login to add citations.
  1. An Algebraic Proof of Completeness for Monadic Fuzzy Predicate Logic.Jun Tao Wang & Hongwei Wu - forthcoming - Review of Symbolic Logic:1-27.
    Monoidal t-norm based logic $\mathbf {MTL}$ is the weakest t-norm based residuated fuzzy logic, which is a $[0,1]$ -valued propositional logical system having a t-norm and its residuum as truth function for conjunction and implication. Monadic fuzzy predicate logic $\mathbf {mMTL\forall }$ that consists of the formulas with unary predicates and just one object variable, is the monadic fragment of fuzzy predicate logic $\mathbf {MTL\forall }$, which is indeed the predicate version of monoidal t-norm based logic $\mathbf {MTL}$. The main (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Model theory of monadic predicate logic with the infinity quantifier.Facundo Carreiro, Alessandro Facchini, Yde Venema & Fabio Zanasi - 2022 - Archive for Mathematical Logic 61 (3):465-502.
    This paper establishes model-theoretic properties of \, a variation of monadic first-order logic that features the generalised quantifier \. We will also prove analogous versions of these results in the simpler setting of monadic first-order logic with and without equality and \, respectively). For each logic \ we will show the following. We provide syntactically defined fragments of \ characterising four different semantic properties of \-sentences: being monotone and continuous in a given set of monadic predicates; having truth preserved under (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Maximality of Logic Without Identity.Guillermo Badia, Xavier Caicedo & Carles Noguera - 2024 - Journal of Symbolic Logic 89 (1):147-162.
    Lindström’s theorem obviously fails as a characterization of first-order logic without identity ( $\mathcal {L}_{\omega \omega }^{-} $ ). In this note, we provide a fix: we show that $\mathcal {L}_{\omega \omega }^{-} $ is a maximal abstract logic satisfying a weak form of the isomorphism property (suitable for identity-free languages and studied in [11]), the Löwenheim–Skolem property, and compactness. Furthermore, we show that compactness can be replaced by being recursively enumerable for validity under certain conditions. In the proofs, we (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Logica Universalis: Towards a General Theory of Logic.Jean-Yves Béziau (ed.) - 2007 - Boston: Birkhäuser Basel.
    Universal Logic is not a new logic, but a general theory of logics, considered as mathematical structures. The name was introduced about ten years ago, but the subject is as old as the beginning of modern logic: Alfred Tarski and other Polish logicians such as Adolf Lindenbaum developed a general theory of logics at the end of the 1920s based on consequence operations and logical matrices. The subject was revived after the flowering of thousands of new logics during the last (...)
    Download  
     
    Export citation  
     
    Bookmark