On the public citation graph

Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators

https://doi.org/10.1007/bf00243807
0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpa.3160330503openalex-snapshot
Decision procedures for elementary sublanguages of set theory. I. Multi‐level syllogistic and some extensions
inferredcites →https://doi.org/10.1002/cpa.3160340203openalex-snapshot
Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
inferredcites →https://doi.org/10.1002/cpa.3160380403openalex-snapshot
A note on the decidability of mls extended with the powerset operator
inferredcites →https://doi.org/10.1002/cpa.3160380507openalex-snapshot
Decision procedures for elementary sublanguages of set theory. VI. Multi‐level syllogistic extended by the powerset operator
inferredcites →https://doi.org/10.1002/cpa.3160400302openalex-snapshot
Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present
inferredcites →https://doi.org/10.1002/cpa.3160400303openalex-snapshot
Decision algorithms for some fragments of analysis and related areas
inferredcites →https://doi.org/10.1002/cpa.3160410206openalex-snapshot
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
inferredcites →https://doi.org/10.1002/cpa.3160420809openalex-snapshot
Topological syllogistic with continuous and closed functions
inferredcites →https://doi.org/10.1002/malq.19780241902openalex-snapshot
The ∀n∃‐Completeness of Zermelo‐Fraenkel Set Theory
inferredcites →https://doi.org/10.1007/3-540-10009-1_8openalex-snapshot
Decision procedures for some fragments of set theory
inferredcites →https://doi.org/10.1007/bf01448447openalex-snapshot
Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem
inferredcites →https://doi.org/10.1016/0004-3702(71)90004-xopenalex-snapshot
Splitting and reduction heuristics in automatic theorem proving
inferredcites →https://doi.org/10.1016/0004-3702(77)90012-1openalex-snapshot
Non-resolution theorem proving
inferredcites →https://doi.org/10.1016/0004-3702(78)90028-0openalex-snapshot
Automatic theorem proving in set theory
inferredcites →https://doi.org/10.1016/0022-0000(87)90001-8openalex-snapshot
Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
inferredcites →https://doi.org/10.1016/s0747-7171(88)80023-3openalex-snapshot
The automation of syllogistic I. Syllogistic normal forms
inferredcites →https://doi.org/10.1145/321679.321689openalex-snapshot
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
inferredcites →https://doi.org/10.21236/ada006898openalex-snapshot
FOL: A Proof Checker for First-order Logic
inferredcites →https://doi.org/10.4064/fm-102-1-1-8openalex-snapshot
Sentences with three quantifiers are decidable in set theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpa.3160480902openalex-snapshot
Techniques of computable set theory with applications to proof verification
inferred← citeshttps://doi.org/10.1006/inco.2001.3096openalex-snapshot
Formative Processes with Applications to the Decision Problem in Set Theory
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9_5openalex-snapshot
Decision Procedures for Elementary Sublanguages of Set Theory. XVII. Commonly Occurring Decidable Extensions of Multi-level Syllogistic
inferred← citeshttps://doi.org/10.1007/bf00243808openalex-snapshot
Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
inferred← citeshttps://doi.org/10.1007/bf00245818openalex-snapshot
Decision procedures for elementary sublanguages of set theory
inferred← citeshttps://doi.org/10.1007/bf00881873openalex-snapshot
Set theory for verification: I. From foundations to functions
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.006openalex-snapshot
The Decision Problem for a Three-sorted Fragment of Set Theory with Restricted Quantification and Finite Enumerations
inferred← citeshttps://doi.org/10.1016/j.ic.2014.02.005openalex-snapshot
Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.049openalex-snapshot
Adding the power-set to description logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.023openalex-snapshot
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership
inferred← citeshttps://doi.org/10.1145/164081.164101openalex-snapshot
Decision procedures for stratified set-theoretic syllogistics
inferred← citeshttps://doi.org/10.3233/fi-2013-842openalex-snapshot
On the Satisfiability Problem for a 4-level Quantified Syllogistic and Some Applications to Modal Logic
inferred← citeshttps://doi.org/10.3233/fi-2021-2050openalex-snapshot
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*
inferred← citeshttps://doi.org/10.48550/arxiv.1209.1943openalex-snapshot
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic (extended version)
inferred← citeshttps://doi.org/10.48550/arxiv.1304.2412openalex-snapshot
On the satisfiability problem for a 3-level quantified syllogistic
inferred← citeshttps://doi.org/10.48550/arxiv.2101.00198openalex-snapshot
Hilbert's Tenth problem and NP-completeness of Boolean Syllogistic with unordered cartesian product
inferred← citeshttps://doi.org/10.48550/arxiv.math/0411226openalex-snapshot
A generalized small model property for languages which force the infinity
inferred← citeshttps://doi.org/10.48550/arxiv.math/0411227openalex-snapshot
Formative processes with applications to the decision problem in set theory: II. powerset and singleton operators, finiteness predicate
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.