Forcing operators on MTL-algebras

&
Mathematical Logic Quarterly 57 (1):47-64 (2011)
  Copy   BIBTEX

Abstract

We study the forcing operators on MTL-algebras, an algebraic notion inspired by the Kripke semantics of the monoidal t -norm based logic . At logical level, they provide the notion of the forcing value of an MTL-formula. We characterize the forcing operators in terms of some MTL-algebras morphisms. From this result we derive the equality of the forcing value and the truth value of an MTL-formula

Categories

Keywords

Reprint years

DOI

10.1002/malq.200910117

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Fatal Heyting Algebras and Forcing Persistent Sentences.Leo Esakia & Benedikt Löwe - 2012 - Studia Logica 100 (1-2):163-173.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.
Understanding preservation theorems: chapter VI of Proper and Improper Forcing, I.Chaz Schlindwein - 2014 - Archive for Mathematical Logic 53 (1-2):171-202.
Sweet & sour and other flavours of ccc forcing notions.Andrzej Rosłanowski & Saharon Shelah - 2004 - Archive for Mathematical Logic 43 (5):583-663.
σ-Continuity and related forcings.Marcin Sabok - 2009 - Archive for Mathematical Logic 48 (5):449-464.
A Reduction Theorem for the Kripke–Joyal Semantics: Forcing Over an Arbitrary Category can Always be Replaced by Forcing Over a Complete Heyting Algebra. [REVIEW]Imants Barušs & Robert Woodrow - 2013 - Logica Universalis 7 (3):323-334.
A variant of Mathias forcing that preserves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document}. [REVIEW]François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
Forcing many positive polarized partition relations between a cardinal and its powerset.Saharon Shelah & Lee J. Stanley - 2001 - Journal of Symbolic Logic 66 (3):1359-1370.
Forcing in łukasiewicz predicate logic.Antonio Di Nola, George Georgescu & Luca Spada - 2008 - Studia Logica 89 (1):111-145.
Small forcing makes any cardinal superdestructible.Joel David Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.

Analytics

Added to PP
2013-12-01

Downloads
19 (#775,535)

6 months
5 (#652,053)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Algebraic semantics for modal logics I.E. J. Lemmon - 1966 - Journal of Symbolic Logic 31 (1):46-65.

View all 9 references / Add more references