Two proof procedures of cardinality based language in propositional calculus - Archive ouverte HAL Access content directly
Conference Papers Year : 1994

Two proof procedures of cardinality based language in propositional calculus

(1) , (2)
1
2
Not file

Dates and versions

hal-03301139 , version 1 (27-07-2021)

Identifiers

  • HAL Id : hal-03301139 , version 1

Cite

Belaid Benhamou, Lakhdar Saïs. Two proof procedures of cardinality based language in propositional calculus. Proceedings of the 11th International Symposium on Theoretical Aspects of Computer Science - STACS'94, 1994, Caen, France. pp.71-82. ⟨hal-03301139⟩
22 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More