scientific article
From MaRDI portal
Publication:3856727
zbMath0423.03003MaRDI QIDQ3856727
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)
Related Items
Asymptotic probabilities of existential second-order Gödel sentences, Undecidability of modal and intermediate first-order logics with two individual variables, Decidability and completeness for open formulas of membership theories, Implication of clauses is undecidable, Dominoes and the complexity of subclasses of logical theories, Common knowledge and update in finite environments, On the relative expressiveness of description logics and predicate logics, The periodic domino problem revisited, The decidability of the \(\forall ^*\exists\) class and the axiom of foundation, Decidability of ∀*∀‐Sentences in Membership Theories, Complexity results for classes of quantificational formulas, On the Decision Problem for Two-Variable First-Order Logic, Asymptotic conditional probabilities: The non-unary case, 0-1 laws and decision problems for fragments of second-order logic, The Undecidability of the Domino Problem, An aperiodic set of 11 Wang tiles, A theory of abstraction, The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability, Finite-model theory -- A personal perspective, Quine's ‘limits of decision’, On timeline-based games and their complexity, Domino-tiling games, Reasoning about knowledge of unawareness, On the Gödel class with identity, The undecidability of the first-order theories of one step rewriting in linear canonical systems, The complexity of the satisfiability problem for Krom formulas, Conservative reduction classes of Krom formulas, Thue trees, Existential interpretation. II