scientific article
From MaRDI portal
Publication:3905254
zbMath0457.03009MaRDI QIDQ3905254
Alfredo Ferro, Eugenio Giovanni Omodeo
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Foundations of classical theories (including reverse mathematics) (03B30)
Related Items (8)
The automation of syllogistic. I: Syllogistic normal forms ⋮ A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions1 1This research has been partially supported by MURST Grant prot. 2001017741 under project “Ragionamento su aggregati e numeri a supporto della programmazione e relative verifiche”. ⋮ A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case ⋮ Unnamed Item ⋮ Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
This page was built for publication:
