Switch to: References

Citations of:

Free l-algebras

Journal of Symbolic Logic 34 (3):475-480 (1969)

Add citations

You must login to add citations.
  1. Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
    In 1979, H. Lewis shows that the computational complexity of the Boolean satisfiability problem dichotomizes, depending on the Boolean operations available to formulate instances: intractable (NP-complete) if negation of implication is definable, and tractable (in P) otherwise [21]. Recently, an investigation in the same spirit has been extended to nonclassical propositional logics, modal logics in particular [2, 3]. In this note, we pursue this line in the realm of many-valued propositional logics, and obtain complexity classifications for the parameterized satisfiability problem (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Expansions of Semi-Heyting Algebras I: Discriminator Varieties.H. P. Sankappanavar - 2011 - Studia Logica 98 (1-2):27-81.
    This paper is a contribution toward developing a theory of expansions of semi-Heyting algebras. It grew out of an attempt to settle a conjecture we had made in 1987. Firstly, we unify and extend strikingly similar results of [ 48 ] and [ 50 ] to the (new) equational class DHMSH of dually hemimorphic semi-Heyting algebras, or to its subvariety BDQDSH of blended dual quasi-De Morgan semi-Heyting algebras, thus settling the conjecture. Secondly, we give a criterion for a unary expansion (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Gödel algebras free over finite distributive lattices.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Annals of Pure and Applied Logic 155 (3):183-193.
    Gödel algebras form the locally finite variety of Heyting algebras satisfying the prelinearity axiom =. In 1969, Horn proved that a Heyting algebra is a Gödel algebra if and only if its set of prime filters partially ordered by reverse inclusion–i.e. its prime spectrum–is a forest. Our main result characterizes Gödel algebras that are free over some finite distributive lattice by an intrisic property of their spectral forest.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Free Algebras in Varieties of Glivenko MTL-Algebras Satisfying the Equation 2(x²) = (2x)².Roberto Cignoli & Antoni Torrens Torrell - 2006 - Studia Logica 83 (1-3):157 - 181.
    The aim of this paper is to give a description of the free algebras in some varieties of Glivenko MTL-algebras having the Boolean retraction property. This description is given (generalizing the results of [9]) in terms of weak Boolean products over Cantor spaces. We prove that in some cases the stalks can be obtained in a constructive way from free kernel DL-algebras, which are the maximal radical of directly indecomposable Glivenko MTL-algebras satisfying the equation in the title. We include examples (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Free Algebras in Varieties of Glivenko MTL-algebras Satisfying the Equation 2(x2) = (2x)2.Roberto Cignoli & Antoni Torrens Torrell - 2006 - Studia Logica 83 (1-3):157-181.
    The aim of this paper is to give a description of the free algebras in some varieties of Glivenko MTL-algebras having the Boolean retraction property. This description is given (generalizing the results of [9]) in terms of weak Boolean products over Cantor spaces. We prove that in some cases the stalks can be obtained in a constructive way from free kernel DL-algebras, which are the maximal radical of directly indecomposable Glivenko MTL-algebras satisfying the equation in the title. We include examples (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • О formułach m-zmiennych w rachunkach Łukasiewlcza.Резо Григолия - 1985 - Acta Universitatis Lodziensis. Folia Philosophica. Ethica-Aesthetica-Practica 3:29-36.
    Tematyka pracy nawiązuje do niezmiernie ważnego nurtu badań logicznych - badań algebr wolnych w klasie algebraicznych (matrycowych) modeli danego rachunku logicznego i uzyskiwanie charakteryzacji tzw. algebr Lindenbauma. Rozważania prowadzone są w dwóch przypadkach: nieskończonej logiki Łukasiewicze i skończenie wartościowych logik Łukasiewicza. W przypadku pierwszym algebraicznymi modelami są tzw. MVn-algebry Changa, a w drugim zdefiniowane przez autora MVn-algebry. Głównymi wynikami są: twierdzenie 4 podające kształt wolnej m-generowanej MNm-algebry oraz twierdzenie 5, uogólniające ten rezultat na klasę algebr Changa.
    Download  
     
    Export citation  
     
    Bookmark  
  • Bi-intermediate logics of trees and co-trees.Nick Bezhanishvili, Miguel Martins & Tommaso Moraschini - 2024 - Annals of Pure and Applied Logic 175 (10):103490.
    Download  
     
    Export citation  
     
    Bookmark  
  • XI Latin American Symposium on Mathematical Logic.Carlos Augusto Di Prisco - 1999 - Bulletin of Symbolic Logic 5 (4):495-524.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)De Finetti’s No-Dutch-Book Criterion for Gödel logic.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Studia Logica 90 (1):25 - 41.
    We extend de Finetti’s No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)De Finetti’s No-Dutch-Book Criterion for Gödel logic.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Studia Logica 90 (1):25-41.
    We extend de Finetti's No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Aggregation and idempotence.Lloyd Humberstone - 2013 - Review of Symbolic Logic 6 (4):680-708.
    A 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context. All 1-ary contexts are aggregative according to the consequence relation of classical propositional logic (though not, for example, according to the consequence relation of intuitionistic propositional logic), and here we explore the extent of this (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Computing coproducts of finitely presented Gödel algebras.Ottavio M. D’Antona & Vincenzo Marra - 2006 - Annals of Pure and Applied Logic 142 (1):202-211.
    We obtain an algorithm to compute finite coproducts of finitely generated Gödel algebras, i.e. Heyting algebras satisfying the prelinearity axiom =1. We achieve this result using ordered partitions of finite sets as a key tool to investigate the category opposite to finitely generated Gödel algebras . We give two applications of our main result. We prove that finitely presented Gödel algebras have free products with amalgamation; and we easily obtain a recursive formula for the cardinality of the free Gödel algebra (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations