Combining sets with cardinals

DOI10.1007/s10817-005-3075-8zbMath1085.03011OpenAlexW2017184931MaRDI 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

cardinalitydecision procedurecombining setsset-theoretic language

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Axiomatics of classical set theory and its fragments (03E30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited ⋮ Deciding Boolean algebra with Presburger arithmetic ⋮ Unnamed Item ⋮ Politeness and combination methods for theories with bridging functions

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

This page was built for publication: Combining sets with cardinals