Pages that link to "Item:Q810494"

The following pages link to Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability (Q810494):

Displaying 22 items.

• Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
• The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator (Q795031) (← links)
• Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs (Q810491) (← links)
• Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators (Q810492) (← links)
• A decision method for a set of first order classical formulas and its applications to decision problems for non-classical propositional logics (Q911574) (← links)
• Decidability of \(\exists^*\forall\forall\)-sentences in HF (Q1049750) (← links)
• A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
• The automation of syllogistic. II: Optimization and complexity issues (Q1813824) (← links)
• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
• Decidability and completeness for open formulas of membership theories (Q1903592) (← links)
• A set-theoretic translation method for polymodal logics (Q1904398) (← links)
• Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
• Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory (Q3768865) (← links)
• Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae (Q3787974) (← links)
• Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present (Q3803085) (← links)
• Decision problems for Tarski and Presburger arithmetics extended with sets (Q4281682) (← links)
• THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION (Q4295224) (← links)
• Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575) (← links)
• Three-quantifier sentences (Q4425144) (← links)
• Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case (Q4884668) (← links)