Finite-Variable Logics Do Not Have Weak Beth Definability Property

From MaRDI portal
Publication:5350328




Abstract: We prove that n-variable logics do not have the weak Beth definability property, for all n greater than 2. This was known for n=3 (Ildik'o Sain and Andr'as Simon), and for n greater than 4 (Ian Hodkinson). Neither of the previous proofs works for n=4. In this paper we settle the case of n=4, and we give a uniform, simpler proof for all n greater than 2. The case for n=2 is still open.









This page was built for publication: Finite-Variable Logics Do Not Have Weak Beth Definability Property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350328)