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.
Recommendations
- TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
- scientific article; zbMATH DE number 1303438
- scientific article; zbMATH DE number 859792
- Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic
- Non-deterministic logic of informal provability has no finite characterization
- Beth definability in the logic KR
- scientific article; zbMATH DE number 446838
- scientific article; zbMATH DE number 877753
- A non-finitizability result in algebraic logic
- Not every ``tabular predicate logic is finitely axiomatizable
Cites work
- scientific article; zbMATH DE number 446838 (Why is no real title available?)
- scientific article; zbMATH DE number 3941494 (Why is no real title available?)
- scientific article; zbMATH DE number 3799636 (Why is no real title available?)
- Comparing theories: the dynamics of changing vocabulary
- Cylindric algebras. Part II
- Definability issues in universal logic
- Epimorphisms in cylindric algebras and definability in finite variable logic
- Modal languages and bounded fragments of predicate logic
- Model theory
- On finite rigid structures
- On the Restraining Power of Guards
- The Beth property in algebraic logic
- The logical study of science
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)