Finite-variable logics do not have weak beth definability property
pp. 125-133
Abstract
We prove that n-variable logics do not have the weak Beth definability property, for all (ngeq 3). This was known for n = 3 (Ildikó Sain and András Simon), and for (ngeq 5) (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 (ngeq 3). The case for n = 2 is left open.
Publication details
Published in:
Koslow Arnold, Buchsbaum Arthur (2015) The road to universal logic II: Festschrift for the 50th birthday of Jean-Yves Béziau. Basel, Birkhäuser.
Pages: 125-133
DOI: 10.1007/978-3-319-15368-1_4
Full citation:
Andréka Hajnal, Németi István (2015) „Finite-variable logics do not have weak beth definability property“, In: A. Koslow & A. Buchsbaum (eds.), The road to universal logic II, Basel, Birkhäuser, 125–133.