Switch to: References

Add citations

You must login to add citations.
  1. Amalgamation through quantifier elimination for varieties of commutative residuated lattices.Enrico Marchioni - 2012 - Archive for Mathematical Logic 51 (1-2):15-34.
    This work presents a model-theoretic approach to the study of the amalgamation property for varieties of semilinear commutative residuated lattices. It is well-known that if a first-order theory T enjoys quantifier elimination in some language L, the class of models of the set of its universal consequences \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\rm T_\forall}$$\end{document} has the amalgamation property. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm Th}(\mathbb{K})}$$\end{document} be the theory of an elementary subclass (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Finite axiomatizability in Łukasiewicz logic.Daniele Mundici - 2011 - Annals of Pure and Applied Logic 162 (12):1035-1047.
    We classify every finitely axiomatizable theory in infinite-valued propositional Łukasiewicz logic by an abstract simplicial complex equipped with a weight function . Using the Włodarczyk–Morelli solution of the weak Oda conjecture for toric varieties, we then construct a Turing computable one–one correspondence between equivalence classes of weighted abstract simplicial complexes, and equivalence classes of finitely axiomatizable theories, two theories being equivalent if their Lindenbaum algebras are isomorphic. We discuss the relationship between our classification and Markov’s undecidability theorem for PL-homeomorphism of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Interpretation of De Finetti coherence criterion in Łukasiewicz logic.Daniele Mundici - 2010 - Annals of Pure and Applied Logic 161 (2):235-245.
    De Finetti gave a natural definition of “coherent probability assessment” β:E→[0,1] of a set E={X1,…,Xm} of “events” occurring in an arbitrary set of “possible worlds”. In the particular case of yes–no events, , Kolmogorov axioms can be derived from his criterion. While De Finetti’s approach to probability was logic-free, we construct a theory Θ in infinite-valued Łukasiewicz propositional logic, and show: a possible world of is a valuation satisfying Θ, β is coherent iff it is a convex combination of valuations (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Functional representation of finitely generated free algebras in subvarieties of BL-algebras.Manuela Busaniche, José Luis Castiglioni & Noemí Lubomirsky - 2020 - Annals of Pure and Applied Logic 171 (2):102757.
    Consider any subvariety of BL-algebras generated by a single BL-chain which is the ordinal sum of the standard MV-algebra on [0, 1] and a basic hoop H. We present a geometrical characterization of elements in the finitely generated free algebra of each of these subvarieties. In this characterization there is a clear insight of the role of the regular and dense elements of the generating chain. As an application, we analyze maximal and prime filters in the free algebra.
    Download  
     
    Export citation  
     
    Bookmark