The decision problem for standard classes

DOI10.2307/2272244zbMath0339.02045OpenAlexW4247725673MaRDI QIDQ4106190

Yuri Gurevich

Publication date: 1976

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272244

Mathematics Subject Classification ID

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

Related Items

Dominoes and the complexity of subclasses of logical theories, Embedding causal team languages into predicate logic, Decidability of the Clark's completion semantics for monadic programs and queries, Spectra and satisfiability for logics with successor and a unary function, Satisfiability of formulae with one \(\forall\) is decidable in exponential time, 0-1 laws and decision problems for fragments of second-order logic, Finite-model theory -- A personal perspective, The classical decision problem and partial functions, Decidability of a portion of the predicate calculus, Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen, Thue trees, Prefix classes of krom formulae with identity