Finite-Variable Logics Do Not Have Weak Beth Definability Property

From MaRDI portal
Publication:5350328

DOI10.1007/978-3-319-15368-1_4zbMATH Open1371.03042arXiv1409.5059OpenAlexW1791238186MaRDI QIDQ5350328FDOQ5350328


Authors: István Németi, Hajnal Andréka Edit this on Wikidata


Publication date: 28 August 2017

Published in: Studies in Universal Logic (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1409.5059




Recommendations




Cites Work


Cited In (2)





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)