Effective Finite-Valued Approximations of General Propositional Logics
From MaRDI portal
Publication:5452176
DOI10.1007/978-3-540-78127-1_7zbMath1133.03328arXiv1908.01200OpenAlexW2138558100MaRDI QIDQ5452176
Publication date: 25 March 2008
Published in: Pillars of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.01200
Cites Work
- Satisfiability in many-valued sentential logic is NP-complete
- The semantics and proof theory of linear logic
- Semantical investigations in Heyting's intuitionistic logic
- Decidability and the finite model property
- Labeled calculi and finite-valued logics
- A propositional calculus with denumerable matrix
- Systematization of finite many-valued logics through the method of tableaux
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item