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 del

DOI10.1016/S1571-0661(04)80652-2zbMath1261.03068OpenAlexW1511302256MaRDI QIDQ4916221

Calogero G. Zarba, Domenico Cantone

Publication date: 19 April 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80652-2

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (1)

A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case

Cites Work

• The automation of syllogistic. II: Optimization and complexity issues
• Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 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 del