Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Domenico Cantone / rank
Normal rank
 
Property / author
 
Property / author: Eugenio Giovanni Omodeo / rank
Normal rank
 
Property / author
 
Property / author: Domenico Cantone / rank
 
Normal rank
Property / author
 
Property / author: Eugenio Giovanni Omodeo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.08.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3080392153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Boolean expressions into logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automation of syllogistic. II: Optimization and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2740887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to the Technique of Formative Processes in Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quantifier-free first-order constraints over finite sets and binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: {log}: A language for programming in logic with finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval propagation to reason about sets: Definition and implementation of a practical language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets and Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Logic and Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:38, 24 July 2024

scientific article
Language Label Description Also known as
English
Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
scientific article

    Statements

    Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (English)
    0 references
    0 references
    0 references
    15 December 2020
    0 references
    satisfiability problem
    0 references
    computable set theory
    0 references
    expressibility
    0 references
    NP-completeness
    0 references
    proof verification
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references