Untestable Properties Expressible with Four First-Order Quantifiers

DOI10.1007/978-3-642-13089-2_28MaRDI QIDQ3564875zbMATH OpenOpenAlexFDO

Authors Charles Jordan, Thomas Zeugmann

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13089-2_28

zbMATH Keywords

logicproperty testing

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Computational learning theory (68Q32)

Recommendations

• Testable and untestable classes of first-order formulae
• Relational Properties Expressible with One Universal Quantifier Are Testable
• Undefinability of propositional quantifiers in the modal system S4
• Undecidable properties of extensions of the logic of provability
• Axiomatizing universal properties of quantifiers
• scientific article; zbMATH DE number 4189692
• scientific article; zbMATH DE number 3861119
• The non-definability notion and first order logic
• Undecidability results for restricted universally quantified formulae of set theory
• scientific article; zbMATH DE number 850397

Cited in

(4)

• Untestable Properties in the Kahr-Moore-Wang Class
• Indistinguishability and First-Order Logic
• Relational Properties Expressible with One Universal Quantifier Are Testable
• Testable and untestable classes of first-order formulae

This page was built for publication: Untestable Properties Expressible with Four First-Order Quantifiers

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