Decidability of a portion of the predicate calculus

DOI10.1007/BF02759780zbMath0368.02014OpenAlexW2003462500MaRDI QIDQ1242887

Saharon Shelah

Publication date: 1977

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02759780

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Related Items (6)

On the structure of \(Ext_ p(G,{\mathbb{Z}})\) ⋮ Testable and untestable classes of first-order formulae ⋮ A method for building models automatically. Experiments with an extension of OTTER ⋮ Relational Properties Expressible with One Universal Quantifier Are Testable ⋮ Thue trees ⋮ Prefix classes of krom formulae with identity

Cites Work

• The decision problem for standard classes
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Decidability of a portion of the predicate calculus