scientific article; zbMATH DE number 1303438
From MaRDI portal
Publication:4250047
Beth's theorem, for a logic \(L\), states: Whenever a set of formulas \(\Sigma\) implicitly defines a variable \(Q\) in \(L\) then \(\Sigma\) explicitly defines \(Q\) in \(L\). The author shows, using a proof based on the fact that complements are unique in distributive lattices, that Beth's theorem fails in many relevant logics. This leads to a new and much simpler proof that Craig's interpolation theorem fails for all logics between \(T\) and \(R\). For the entire collection see [Zbl 0910.00016].
Recommendations
Cited in
(14)- A category equivalence for odd Sugihara monoids and its applications
- Beth definability and the Stone-Weierstrass theorem
- Epimorphism surjectivity in varieties of Heyting algebras
- Epimorphisms in varieties of subidempotent residuated structures
- On propositional definability
- Epimorphisms in varieties of residuated structures
- The Beth property in algebraic logic
- scientific article; zbMATH DE number 4072934 (Why is no real title available?)
- Tarskian Classical Relevant Logic
- Beth definability in the logic KR
- Idempotent residuated structures: Some category equivalences and their applications
- Finite-Variable Logics Do Not Have Weak Beth Definability Property
- Beth definability, interpolation and language splitting
- An institution-independent proof of the Beth definability theorem
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 Q4250047)