A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a computation system based on set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory in first-order logic: Clauses for Gödel's axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automation of syllogistic. I: Syllogistic normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Free Variable Version of the First-Order Predicate Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / 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: The ∀<sub><i>n</i></sub>∃‐Completeness of Zermelo‐Fraenkel Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of equational logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5582304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming a Set of Clauses as a Horn Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of ∀*∀‐Sentences in Membership Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing infinity without foundation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time solution to the single function coarsest partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741005 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0747-7171(06)80009-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010607908 / rank
 
Normal rank

Latest revision as of 10:35, 30 July 2024

scientific article
Language Label Description Also known as
English
A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
scientific article

    Statements

    A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (English)
    0 references
    0 references
    0 references
    26 September 1994
    0 references
    program synthesis
    0 references
    weak theories of pure sets
    0 references
    decision method
    0 references
    satisfiability
    0 references
    completeness
    0 references
    abstract data-type
    0 references
    computable model
    0 references
    automatic synthesis algorithm
    0 references
    set computations
    0 references
    axiomatic set theories
    0 references

    Identifiers

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