Decidability of a portion of the predicate calculus

DOI10.1007/BF02759780zbMATH Open0368.02014OpenAlexW2003462500MaRDI QIDQ1242887FDOQ1242887

Authors: S. 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)

Cites Work

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

Cited In (7)

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

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

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