scientific article; zbMATH DE number 2090313

MaRDI QIDQ4809072zbMATH OpenFDO

Authors Calogero G. Zarba

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2392/23920363.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Recommendations

• Publication:4737128
• Decision Procedures for Multisets with Cardinality Constraints
• Verification: Theory and Practice
• Combining sets with cardinals
• Unions of non-disjoint theories and combinations of satisfiability procedures

Cited in

(17)

• Decision Procedures for Multisets with Cardinality Constraints
• Decision procedures for term algebras with integer constraints
• Combining nonstably infinite theories
• A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
• Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
• On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework
• Combining non-stably infinite theories
• A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
• Combining sets with cardinals
• scientific article; zbMATH DE number 2048759 (Why is no real title available?)
• Politeness and combination methods for theories with bridging functions
• scientific article; zbMATH DE number 2086594 (Why is no real title available?)
• Verification: Theory and Practice
• Efficient automated reasoning about sets and multisets with cardinality constraints
• Linear Arithmetic with Stars
• Decision Procedures for Automating Termination Proofs
• A polite non-disjoint combination method: theories with bridging functions revisited

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809072)