scientific article; zbMATH DE number 2217307
From MaRDI portal
Publication:5699230
Recommendations
- A completeness proof for a regular predicate logic with undefined truth value
- The cylindric algebras of three-valued logic
- scientific article; zbMATH DE number 1163566
- scientific article; zbMATH DE number 856945
- Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
Cited in
(23)- The strong completeness of a system based on Kleene's strong three-valued logic
- Completeness criterion for the enumeration closure operator in three-valued logic
- Kleene algebras and logic: Boolean and rough set representations, 3-valued, rough set and perp semantics
- A new version of the proof of completeness criterion for k-valued logic functions
- scientific article; zbMATH DE number 4135917 (Why is no real title available?)
- scientific article; zbMATH DE number 4037865 (Why is no real title available?)
- Algebraische Eigenschaften Eines Funktional Unvollständigen Dreiwertigen Aussagenkalküls
- The cylindric algebras of three-valued logic
- scientific article; zbMATH DE number 1735935 (Why is no real title available?)
- scientific article; zbMATH DE number 1046390 (Why is no real title available?)
- scientific article; zbMATH DE number 1163566 (Why is no real title available?)
- scientific article; zbMATH DE number 1746889 (Why is no real title available?)
- scientific article; zbMATH DE number 3993546 (Why is no real title available?)
- A Three-valued Formalization of Provability
- scientific article; zbMATH DE number 856945 (Why is no real title available?)
- scientific article; zbMATH DE number 883896 (Why is no real title available?)
- scientific article; zbMATH DE number 1424897 (Why is no real title available?)
- Algebraic properties of if-then-else and commutative three-valued tests
- \(\mathbf{G}_3'\) as the logic of modal 3-valued Heyting algebras
- Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis
- Two kinds of (binary) Kripke-style semantics for three-valued logic
- A completeness proof for a regular predicate logic with undefined truth value
- A probability measure for partial events
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5699230)