Combining sets with cardinals

DOI10.1007/s10817-005-3075-8zbMath1085.03011MaRDI QIDQ812443

Calogero G. Zarba

Publication date: 23 January 2006

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-005-3075-8

zbMATH Keywords

cardinality; decision procedure; combining sets; set-theoretic language

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03B35: Mechanization of proofs and logical operations

03E30: Axiomatics of classical set theory and its fragments

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Deciding Boolean algebra with Presburger arithmetic, A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity, convexity and combinations of theories
• Cooperation of background reasoners in theory reasoning by residue sharing
• Introduction to set constraint-based program analysis
• Unions of non-disjoint theories and combinations of satisfiability procedures
• The first order properties of products of algebraic systems
• Simplification by Cooperating Decision Procedures
• Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
• Quantifier Elimination and Provers Integration
• Combining Non-Stably Infinite Theories
• Verification: Theory and Practice
• Verification, Model Checking, and Abstract Interpretation