scientific article; zbMATH DE number 2090313
From MaRDI portal
Publication:4809072
zbMATH Open1072.68598MaRDI QIDQ4809072FDOQ4809072
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
Title of this publication is not available (Why is that?)
Recommendations
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Cited In (17)
- Title not available (Why is that?)
- Efficient automated reasoning about sets and multisets with cardinality constraints
- Verification: Theory and Practice
- Decision Procedures for Automating Termination Proofs
- 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
- A polite non-disjoint combination method: theories with bridging functions revisited
- Combining nonstably infinite theories
- Politeness and combination methods for theories with bridging functions
- Combining non-stably infinite theories
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
- Decision procedures for term algebras with integer constraints
- Linear Arithmetic with Stars
- Decision Procedures for Multisets with Cardinality Constraints
- On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework
- Title not available (Why is that?)
- Combining sets with cardinals
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)
