The decision problem for standard classes

DOI10.2307/2272244MaRDI QIDQ4106190zbMATH OpenOpenAlexFDO

Authors Yuri Gurevich

Publication date 1976

Published in 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)

Cited in

(13)

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

This page was built for publication: The decision problem for standard classes

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