The expressive unary truth functions of \(n\)-valued logic (Q558444): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: What is negation? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4895873 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The expressive truth conditions of two-valued logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Contractions of closure systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algebraic approach to non-classical logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5666507 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compactness theorems for finitely-many-valued sentential logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of logical calculi. Basic theory of consequence operations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On compactness in many-valued logic. I / rank | |||
Normal rank |
Latest revision as of 13:22, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The expressive unary truth functions of \(n\)-valued logic |
scientific article |
Statements
The expressive unary truth functions of \(n\)-valued logic (English)
0 references
6 July 2005
0 references
To every (normal) consequence relation there corresponds a notion of closure such that the set of closed sets forms a complete lattice. If the consequence relation is finitary, this lattice has a minimal closed basis consisting of the irreducibles [see \textit{R. Wójcicki}, Theory of logical caculi. Basic theory of consequence operations. Dordrecht: Kluwer Academic Publishers (1988; Zbl 0682.03001)]. If all these irreducibles are maximally consistent, the lattice is said to be expressive. Some truth functions force irreducibles to be maximally consistent and hence are called expressive. In ``The expressive truth conditions of two-valued logic'' [Notre Dame J. Formal Logic 43, 221--230 (2002; Zbl 1050.03008)] the author has identified all expressive truth functions of two-valued logic. This paper identifies the expressive truth functions of \(n\)-valued logic, by characterizing the unary ones.
0 references
many-valued logics
0 references
abstract deductive systems
0 references