A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
type: Item
instance of: scholarly article
title: A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
zbMATH Open document ID: 0796.03009
DOI: 10.1016/S0747-7171(06)80009-X
author: Franco Parlamento
author: Alberto Policriti
author: Eugenio Omodeo
published in: Journal of Symbolic Computation
publication date: 1994-09-26T00:00:00Z
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03E30
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 566070
zbMATH Keywords: program synthesis
zbMATH Keywords: weak theories of pure sets
zbMATH Keywords: decision method
zbMATH Keywords: satisfiability
zbMATH Keywords: completeness
zbMATH Keywords: abstract data-type
zbMATH Keywords: computable model
zbMATH Keywords: automatic synthesis algorithm
zbMATH Keywords: set computations
zbMATH Keywords: axiomatic set theories
describes a project that uses: ISETL
MaRDI profile type: Publication
cites work: Q3992552
cites work: Q4065051
cites work: Q4692624
cites work: Q3993251
cites work: Towards a computation system based on set theory
cites work: Set theory in first-order logic: Clauses for Gödel's axioms
cites work: Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae
cites work: The automation of syllogistic. I: Syllogistic normal forms
cites work: Q5679729
cites work: Q3619797
cites work: Q3993541
cites work: A Free Variable Version of the First-Order Predicate Calculus
cites work: Q3905252
cites work: Proving termination with multiset orderings
cites work: {log}: A language for programming in logic with finite sets
cites work: The ∀n∃‐Completeness of Zermelo‐Fraenkel Set Theory
cites work: Foundations of equational logic programming
cites work: Q5563359
cites work: Q5582304
cites work: Renaming a Set of Clauses as a Horn Set
cites work: Q4160889
cites work: Q5586197
cites work: Decidability of ∀*∀‐Sentences in Membership Theories
cites work: Q3700872
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
cites work: Expressing infinity without foundation
cites work: A linear time solution to the single function coarsest partition problem
cites work: Q3741005
full work available at URL: s0747-7171(06)80009-x
OpenAlex ID: W2010607908
description: scientific article; zbMATH DE number 566070