Three-variable statements of set-pairing

DOI10.1016/j.tcs.2004.03.028zbMath1058.03028OpenAlexW2028886883MaRDI QIDQ1885036

Andrea Formisano, Eugenio Giovanni Omodeo, Alberto Policriti

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.028

zbMATH Keywords

automated reasoningpairingaggregatesweak set theorycalculus of binary relations

Mathematics Subject Classification ID

Related Items (4)

Web ontology representation and reasoning via fragments of set theory ⋮ Tarski’s Influence on Computer Science ⋮ The axiom of elementary sets on the edge of Peircean expressibility ⋮ A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×

Uses Software

• OTTER

Cites Work

• Relation algebras by games
• The automation of syllogistic. I: Syllogistic normal forms
• Modal deduction in second-order logic and set theory. II
• Compiling dyadic first-order specifications into map algebra
• A set-theoretic translation method for polymodal logics
• Automated deduction in classical and non-classical logics. Selected papers
• Introduction to axiomatic set theory
• Proving termination with multiset orderings
• Undecidability results for restricted universally quantified formulae of set theory
• Relational Methods in Computer Science
• Modal deduction in second-order logic and set theory - I
• Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
• Layered map reasoning
• The axiom of elementary sets on the edge of Peircean expressibility
• Goals and benchmarks for automated map reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three-variable statements of set-pairing