Characterizing finite-valuedness
From MaRDI portal
Publication:1795205
DOI10.1016/j.fss.2017.10.014zbMath1397.03026OpenAlexW2765635985MaRDI QIDQ1795205
Carlos Caleiro, Umberto Rivieccio, Sérgio Marcelino
Publication date: 16 October 2018
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2017.10.014
cancellationlocal finitenessmany-valuednessfinite-determinednessfinite-valuednesslocal tabularitylogical matrix semanticsstrong finiteness
Related Items
An unexpected Boolean connective, Compositional meaning in logic, The value of the one value: \textit{exactly true logic} revisited, Axiomatizing non-deterministic many-valued generalized consequence relations, Plug and Play Negations, Non-distributive relatives of ETL and NFL, Containment logics: algebraic completeness and axiomatization, Combining fragments of classical logic: when are interaction principles needed?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extendible formulas in two variables in intuitionistic logic
- Gödel algebras free over finite distributive lattices
- What is a non-truth-functional logic?
- Theory of logical calculi. Basic theory of consequence operations
- Matrix approach in methodology of sentential calculi
- Metamathematics of fuzzy logic
- Locally tabular \(\neq \) locally finite
- Algebraic foundations of many-valued reasoning
- The Kuznetsov-Gerčiu and Rieger-Nishimura logics
- 3088 varieties: A solution to the Ackermann constant problem
- Algebraizable logics
- Belnap's Four-Valued Logic and De Morgan Lattices
- Logics of varieties, logics of semilattices and conjunction
- Decidability and complexity of fibred logics without shared connectives
- The simplest protoalgebraic logic
- Deducibility and many-valuedness
- Algebras and their subalgebras
- Protoalgebraic logics